Searcharxiv⌕ Search

arXiv subjects

Hermawan Kresno Dipojono

Publications and source records attributed to Hermawan Kresno Dipojono.

11 recordsLinked to original sources

clifford qc: A Python Toolkit for Quantum Simulation

clifford_qc is a Python research toolkit for constructing quantum models, comparing variational and subspace eigensolvers, and estimating measurement resources. A common sparse Pauli algebra connects Hamiltonians, density operators, gates, and candidate-selection observables, while dedicated interfaces handle circuit programs, execution, and statistical estimates. We introduce the representation with a worked gradient example and trace a molecular calculation through reusable model preparation, an independent solve, and optional reference validation. Shared measurement caches reuse outcomes across observables on the same reference state; packed coefficient storage and streaming expose a memory-recomputation tradeoff. Committed small-system benchmarks show how these interfaces support comparisons with explicit accuracy and cost assumptions. Fully commuting measurement reduces the shots needed to certify a fixed first-order energy functional, but entangling-gate time and connectivity can offset the saving or make the protocol inadmissible under illustrative device models. Other studies identify a subspace bias floor that more shots cannot remove, an indeterminate comparison of fermionic encodings across instances, and an approximate-restriction screen whose required comparison fails before sampling. Generated tables, provenance records, and manuscript checks connect the reported claims to their inputs, although evidence labels are not yet validated uniformly. The package supports reproducible method development; these results establish neither hardware performance nor a general simulation speedup.

quant-ph↗

DA-CASE: reusable measurements for adaptive quantum subspaces

Quantum subspace methods are often compared by basis dimension or energyerror, although their dominant experimental costs arise from different statepreparations, measurement settings, and shot allocations. We present theDyadic Adaptive Clifford-Algebra Subspace Eigensolver (DA-CASE), whose basisstates are virtual directions $A_i|ψ\rangle$ generated from one reference.Overlap, Hamiltonian, and observable matrices are reconstructed from onecached set of Pauli expectations on that reference. The method thereforetrades multiple prepared basis states for a potentially wide measurement bank.We make that trade explicit on a frozen eight-qubit H$_4$ Hamiltonian. Twogenerator resolutions reach the same nine-dimensional subspace and the sameenergy to machine precision, while the retained bank changes from 7371 to 2240Pauli words. A reference-conditioned symmetry test certifies the narrower spanwithout asserting that its individual Pauli words conserve the sector asabstract operators. Independently, a dyadic commuting hierarchy reduces thedeterminant bank from 913 qubit-wise-commuting settings to 64 fully commutingsettings, while exposing the added logical-CX cost. In a separate four-qubitfinite-shot diagnostic, covariance-aware allocation reduces theprojected-matrix variance target by 68.9%. Mode-wise overlap regularizationremoves the observed catastrophic energy estimates and lowers RMSE, butdoubles the median error relative to a fixed cutoff. These are small-instanceexact and Monte Carlo results, not a hardware demonstration, scaling result,or quantum advantage claim. The contribution is a single-referencemeasurement architecture and a resource ledger that keeps contexts, settings,shots, circuit depth, and post-selection retries in their proper units.

quant-ph↗

Tree-Structured Commutativity Packing in Adaptive Variational Quantum Simulation: Measurement Overhead and Representation Limits

While fermion-to-qubit isomorphisms are mathematically invariant under exact unitary statevector transformations, their physical implementation on noisy intermediate-scale quantum (NISQ) devices introduces severe, practical measurement bottlenecks. In this work, we systematically investigate the measurement efficiency of adaptive derivative-assembled pseudo-trotter variational quantum eigensolver (ADAPT-VQE) algorithms across three critical molecular benchmarks (LiH, BeH2, and H2O) at stretched bond lengths (2xRe) covering distinct point-group symmetries. First, we establish exact representation invariance across all target multi-reference geometries, demonstrating that operator pool gradients and statevector electronic energies remain strictly isomorphic under exact mathematical execution (E(LiH) = -7.691469 Ha, E(BeH2) = -15.110110 Ha, and E(H2O) = -74.566874 Ha). Second, we quantify the hardware measurement overhead by partitioning operator pool observables into qubit-wise commuting (QWC) tensor-product basis (TPB) cliques. We reveal that while both Jordan-Wigner (JW) and Bravyi-Kitaev (BK) encodings yield identical total Pauli term counts across the singlet excitation manifold (128 terms for H2O and BeH2), the hierarchical binary-tree layout of the BK mapping dramatically compresses the required measurement circuits---achieving up to a 45.31% reduction in total hardware execution steps compared to 12.50% under JW. Our findings demonstrate that tree-structured mappers serve as implicit, highly efficient measurement-packing engines for adaptive quantum simulations without altering the underlying variational trajectory.

quant-ph↗

Adaptive operator-generated subspaces for effective many-body Hamiltonians

Electronic-structure and embedding workflows terminate in effective many-body Hamiltonians, whereas quantum eigensolver studies often start from hand-built qubit models. We present the Adaptive Clifford-Algebra Subspace Eigensolver (A-CASE), a single-reference, operator-generated Rayleigh--Ritz method. Overlap, Hamiltonian, observable, and response matrices are reconstructed from one shared Pauli-expectation bank, while adaptive growth scores overlap-aware local pencils and rejects symmetry leakage or near-linear dependence. A strict FCIDUMP adapter supplies the active-space boundary. For linear H$_4$ in STO-3G with CAS(4e,4o), the mapped sector agrees with independent determinant FCI to $3.1\times10^{-15}$ Ha. At a nine-vector budget A-CASE has a $3.019$ mHa error; replacing the determinant reference by a two-operator ADAPT-VQE state reduces it to $0.342$ mHa, without implying a matched total-cost advantage. Under a matched contract, the fixed-reference route uses one state preparation versus ADAPT-VQE's ninety but measures roughly an order of magnitude more Pauli words. Exact fixed-angle ADAPT-GCIM gives $13.364$ mHa at the nearest size match and $10.674$ mHa at the iteration match, with its transition-pair burden reported separately. Across a broader benchmark ladder, fixed Krylov bases are generally more accurate and often narrower but substantially less well conditioned. A grouped bootstrap propagates finite-shot variability through thresholding, diagonalization, root matching, spectral weights, susceptibility, and broadening; its bands are explicitly heuristic and conditional, not finite-sample confidence certificates. The work establishes an executable path from an interchange Hamiltonian to energies, correlations, and response, without claiming materials accuracy, favorable scaling, or quantum advantage.

quant-ph↗

Operator-centric Clifford algebra for variational eigensolvers and finite-shot adaptive selection

We develop a sparse operator-centric realization of $n$-qubit variational quantum algorithms in the complex Clifford algebra $\mathrm{Cl}(2n,\mathbb{C}) \cong M(2^n,\mathbb{C})$. Density operators, gates, observables, channels, fermionic modes, and adaptive-selection observables are represented in one Pauli-word algebra, with the Jordan--Wigner map providing the exact bridge to anticommuting Clifford generators. We distinguish general Pauli-word rotations from Spin-group rotors and formulate the familiar odd-$Y$ restriction for real-state adaptive ansatzes as an exact transpose-parity statement: for real Hamiltonians and real states, every candidate Pauli word containing an even number of $Y$ factors has zero ADAPT gradient, while odd-$Y$ rotations preserve the real sector. For the critical open transverse-field Ising chain, a depth-three Hamiltonian variational ansatz gives relative energy errors $4.84\times10^{-5}$, $2.19\times10^{-3}$, and $3.67\times10^{-3}$ for $n=4,5,6$. A compact local ADAPT pool is exact at $n=4$ but leaves residual errors at larger sizes; a systematic contiguous three-local odd-$Y$ pool reaches relative errors below $1.3\times10^{-12}$ for $n\leq6$. In 100-seed finite-shot tests at $n=4$, fixed-shot selection succeeds in $0/100$ runs, whereas uniform escalation and confidence-bound racing each succeed in $84/100$ runs; racing lowers median shots by $34\%$. We claim no asymptotic speedup over matrix methods. The contribution is a corrected algebraic formulation, a density-operator derivation and implementation of the real-sector pool filter, and a reproducible study of measurement-limited adaptive selection.

quant-ph↗

An Integrated DFT-Wannier-Quantum Embedding Pipeline for Strongly Correlated Materials: Scaling Benchmarks in Li-hBN

The seamless integration of Density Functional Theory (DFT) with quantum variational algorithms is essential for the predictive simulation of strongly correlated materials. In this work, we present an end-to-end computational pipeline - comprising DFT geometry relaxation, non-self-consistent field (NSCF) calculations, and Wannier-based orbital localization - to prepare active-space Hamiltonians for quantum embedding. We utilize the Adaptive Variational Quantum Eigensolver (ADAPT-VQE) framework, significantly enhanced by a Greedy-Operator Commutativity Partitioning (GOCP) approach and a Taylor-expanded O(5) operator evolution strategy to efficiently manage the exponential scaling of the Hilbert space. We demonstrate this framework through a systematic benchmark study of Li-hBN, mapping the system onto qubit registers and investigating the convergence behavior as the active space is expanded from 8 to 14 spatial orbitals. Our results quantify the relationship between active-space size and computational demand, identifying a critical "scaling wall" where classical simulation costs transition from manageable to intractable. This study provides a rigorous performance baseline for the DFT-to-ADAPT-VQE workflow and offers empirical insights into the memory and processing limits currently facing hybrid quantum-classical architectures using advanced co-processing strategies.

quant-ph↗

Alleviating the Sparse Matrix Scaling Bottleneck in Adaptive VQE via Greedy Operator Commutativity Partitioning and High-Order Taylor State Evolution

The Variational Quantum Eigensolver (VQE) and its adaptive variants, such as ADAPT-VQE, are central to the study of strongly correlated quantum systems. However, the classical simulation of the ansatz growth process remains constrained by the exponential scaling of operator space and the associated computational cost of unitary evolution. We introduce the Greedy Operator Commutativity Partitioning (GOCP) framework, an analytical methodology designed to optimize both operator selection and state evolution. By reformulating complex unitary rotations as a chained sequence of fifth-order O(5) Taylor series expansions, GOCP bypasses the need for explicit matrix exponentiation, reducing the computational task to a sequence of sparse matrix-vector operations. We evaluate the performance of this framework across diverse molecular systems, including BeH2 and strongly correlated H2O geometries, utilizing both Jordan-Wigner and Bravyi-Kitaev mappings. Our results demonstrate that the GOCP framework maintains exceptional numerical fidelity-exceeding 1 - 10^-6 in state fidelity-while achieving sub-chemical accuracy in ground-state energy calculations. By enabling the simulation of operator manifolds exceeding 2.68 x 10^8 elements with high efficiency, this approach provides a scalable and rigorous pathway for exploring deep variational circuits in complex quantum many-body systems.

quant-ph↗

Alleviating the Sparse Matrix Scaling Bottleneck in Adaptive VQE via High-Order Taylor State Evolution

The Variational Quantum Eigensolver (VQE) is a leading algorithm for noisy intermediate-scale quantum (NISQ) devices, but its adaptive variants (e.g., ADAPT-VQE) suffer from severe classical simulation bottlenecks during the ansatz growth phase. Representing and exponentiating pool operators for multi-qubit systems constructs massive sparse matrices that quickly scale to millions of elements, choking classical memory bandwidth and CPU/GPU cycle capacity. In this work, we present a resource-efficient software-layer framework that completely bypasses dense matrix exponentiation by evaluating state updates through a deterministic fifth-order (O(5)) Taylor series expansion. This approach reframes the costly unitary evolution into a chained sequence of five lightweight, successive sparse matrix-vector multiplications scaling strictly as O(Nz), where Nz is the number of non-zero elements. We validate our framework using equilibrium BeH2 (14 qubits), equilibrium H2O (12 qubits), and strongly correlated asymmetrically stretched H2O molecular profiles under both Jordan-Wigner (JW) and Bravyi-Kitaev (BK) transformations. The simulation results demonstrate that the O(5) truncation maintains exceptional numerical fidelity, retaining a state fidelity > 0.999999 and matching absolute ground state energies down to subchemical accuracy, while effortlessly navigating matrix spaces exceeding 268 million structural elements. This framework provides a scalable, high-performance pathway for executing deep variational simulations on hardware platforms with constrained computational budgets.

quant-ph↗

Shattering the Symmetry Trap in Fixed-Ansatz VQE: An Accelerated ADAPT-VQE Study of Three Pillar Molecules under Bravyi-Kitaev Mapping

Fixed-ansatz Variational Quantum Eigensolvers (VQE), such as the Unitary Coupled Cluster with Singles and Doubles (UCCSD) framework, frequently suffer from severe initialization paralyzation and zero-gradient traps when evaluated using the non-local Bravyi-Kitaev (BK) fermion-to-qubit mapping. In this work, we systematically demonstrate how the Adaptive Derivative-Assembled Pseudo-Trotter (ADAPT-VQE) framework shatters these structural limitations across three distinct electronic and geometric molecular pillars: Lithium Hydride ($\text{LiH}$), Hydrogen Fluoride ($\text{HF}$), and Water ($\text{H}_2\text{O}$), under heavily stretched or asymmetric multi-reference configurations. While conventional UCCSD-VQE flatlines completely at a zero energy shift ($0.000000$~Ha) due to global phase cancellations inherent to the BK tree structures, our dynamic ADAPT-VQE loop successfully isolates the dominant symmetry-breaking operators using analytical commutator gradients. To bypass the severe $\mathcal{O}(N^3)$ computational bottlenecks of dense matrix exponentiation and Singular Value Decomposition on larger registers, we implement a highly optimized, vector-based Taylor series expansion state-evolution engine. Our numerical results show that the accelerated ADAPT-VQE framework achieves instant, exact Full Configuration Interaction (FCI) convergence within the very first macro-cycle across all three molecular systems, maintaining absolute numerical stability up to a 12-qubit register space. This study establishes a robust, hardware-efficient path for simulating strongly correlated, highly polarized triatomic chemical environments on near-term local architectures.

quant-ph↗

Shot-Efficient ADAPT-VQE via Reused Pauli Measurements and Variance-Based Shot Allocation

The Adaptive Variational Quantum Eigensolver (ADAPT-VQE) is a promising approach for quantum algorithms in the Noisy Intermediate-Scale Quantum (NISQ) era, offering advantages over traditional VQE methods by reducing circuit depth and mitigating challenges in classical optimization. However, a major challenge in ADAPT-VQE is the high quantum measurement (shot) overhead required for circuit parameter optimization and operator selection. In this work, we propose two integrated strategies to reduce the shot requirements in ADAPT-VQE. First, we reuse Pauli measurement outcomes obtained during VQE parameter optimization in the subsequent operator selection step of the next ADAPT-VQE iteration, which involves operator gradient measurements. Second, we apply variance-based shot allocation to both Hamiltonian and operator gradient measurements. Our numerical results demonstrate that each method, individually and in combination, significantly reduces the number of shots needed to achieve chemical accuracy while maintaining result fidelity across the studied molecular systems.

quant-ph↗

Ethylene Carbonate Adsorption and Decomposition on Pristine and Defective ZnO (1010) Surface: A First-Principles Study

Fundamental understanding of the reactivity between coating material of Li-ion battery cathode and electrolyte is important in order to obtain suitable coating candidates. Herein, we study ethylene carbonate (EC) adsorption and decomposition reactions on pristine, O vacancy- and Zn vacancy-defected ZnO (10-10) by means of first-principles density functional theory (DFT) calculations. Possible decomposition pathways via H-abstraction and EC ring-opening reaction that leads to the generation of CO2 and C2H4 gases are studied from the thermodynamic and kinetic aspects. Firstly, we find that molecular EC preferably adsorbs on both pristine and defective ZnO (1010) via the bonding between its carbonyl oxygen (OC) and surface Zn. Secondly, subsequent decomposition reactions show large tendency of EC to decompose on both pristine and defective ZnO (10-10). This tendency is indicated by the large thermodynamic driving forces to decompose EC that range from -1.5 eV to -2.5 eV on both pristine and defective ZnO (10-10) (calculated with respect to EC gas phase). The large tendency of EC to decompose, however, is hindered by the high activation barriers of the EC decomposition, shown by the lowest activation barrier of 0.96 eV on Zn vacancy defected ZnO (10-10). Our results thus indicate that EC decomposition on ZnO (10-10) is mainly hindered due to its slow rate of decomposition instead of the thermodynamic factors.

cond-mat.mtrl-sci↗