Processing qubit Hamiltonians derived from electronic-structure problems can become classically prohibitive because many downstream manipulations still rely on dense operator constructions whose cost grows exponentially with qubit number. We introduce Qronecker, a cut-aware low-rank Kronecker decomposition algorithm that turns Hamiltonian compression into a certifiable, resource-aware decision primitive. Operating entirely in Pauli coefficient space, Qronecker avoids forming dense 2^n x 2^n matrices, constructs low-rank Kronecker approximations under a chosen bipartition, and returns both an instance-specific compressibility curve and a state-independent worst-case energy certificate that links rank and cut choices to conservative energy-deviation bounds. Across molecular benchmarks comprising hundreds of systems up to 30 qubits, we find that traceless low-rank structure is common but heterogeneous: many screened systems reach high coefficient-space fidelity at low rank, yielding large savings in classical preprocessing and conditional reductions in downstream circuit-resource proxies, while the certificate remains valid but conservative on the auditable subset. The same analysis shows that fixed global fidelity targets are not generally sufficient for chemistry-level guarantees, motivating adaptive rank and cut selection. These results position Qronecker as a certifiable compression primitive for rank and cut selection in quantum-chemistry Hamiltonian processing.
Processing qubit Hamiltonians derived from electronic-structure problems can become classically prohibitive because many downstream manipulations still rely on dense operator constructions whose cost grows exponentially with qubit number. We introduce Qronecker, a cut-aware low-rank Kronecker decomposition algorithm that turns Hamiltonian compression into a certifiable, resource-aware decision primitive. Operating entirely in Pauli coefficient space, Qronecker avoids forming dense 2^n x 2^n matrices, constructs low-rank Kronecker approximations under a chosen bipartition, and returns both an instance-specific compressibility curve and a state-independent worst-case energy certificate that links rank and cut choices to conservative energy-deviation bounds. Across molecular benchmarks comprising hundreds of systems up to 30 qubits, we find that traceless low-rank structure is common but heterogeneous: many screened systems reach high coefficient-space fidelity at low rank, yielding large savings in classical preprocessing and conditional reductions in downstream circuit-resource proxies, while the certificate remains valid but conservative on the auditable subset. The same analysis shows that fixed global fidelity targets are not generally sufficient for chemistry-level guarantees, motivating adaptive rank and cut selection. These results position Qronecker as a certifiable compression primitive for rank and cut selection in quantum-chemistry Hamiltonian processing.
Efficient manipulation of Pauli-algebraic objects is a key bottleneck in the classical emulation and benchmarking of quantum algorithms for chemistry and many-body physics. This bottleneck appears in Hamiltonian construction, variational ansatz preparation, expectation-value and gradient evaluation, and real-time propagation, all of which require repeated Pauli-algebra operations. Here, we present a high-performance Pauli-algebra framework tailored to quantum many-body and quantum-chemical simulations. The framework combines compact binary symplectic encoding, canonical coefficient reduction, and grouped sparse operator representations that exploit shared bit-flip patterns among Pauli strings. The resulting Julia/C\texttt{++} implementation accelerates Pauli multiplication, Hamiltonian construction, and operator--state multiplication in sparse and symmetry-adapted many-electron spaces. Benchmarks demonstrate efficient Hamiltonian construction, large-active-space VQE and ADAPT-VQE calculations, and real-time variational dynamics on modern multicore CPU and GPU architectures. These results show that structure-aware Pauli-algebra engines provide a scalable classical backend for developing and benchmarking quantum algorithms in quantum chemistry and many-body simulation.
In ab-initio quantum chemistry, solving the electronic structure problem of a molecular system of interest to obtain an approximation of the ground and, in some cases, the excited state energies is a core and central task in various quantum chemistry processes. These include, but certainly not limited to, the calculation of the activation energy–that is the minimal energy required to launch a given chemical reaction–, the dipole and multipole moments which describe the polarity of the molecule, performing the optimization of the geometry of the molecule and searching for transition states. Furthermore, many quantum chemistry applications are predicated, not merely on the approximation of the ground state energy, but also on the corresponding first order derivatives. The body of literature of classical algorithms approximating the ground state energy and its first order derivative is extensively rich with a plethora of methods such as self-consistent mean-field methods, coupled-cluster methods, density matrix renormalization group and many more, each of which has intrinsic set of properties and characteristics that makes it suitable for specific tasks and cases. However, classical methods face a practically insurmountable challenge: the efficient computation of high accuracy approximation of ground state energies of large system sizes. This is fundamentally because the electronic structure problem provably belongs to the complexity class of QMA-hard problems. Which also means that it is out of reach for quantum algorithms as well in general. However, with certain assumptions that are expected to hold molecules of interest–that so far proved to be classically challenging because the required accuracy set by the standard of chemical accuracy threshold (generally held in quantum chemistry)– quantum algorithms can efficiently treat such cases. While originally theorized by Richard Feynmann as a potentially efficient way of simulating some classically intractable many-body systems, quantum computing has since proven to have a stronger and richer potential paving the way for the inception of new algorithms such as Shor’s algorithm for integer factorization, HHL for solving linear system of equation and Grover’s algorithm for constrained binary search, just to name a few. These algorithms provably exhibit an improvement rate that goes respectively exponentially and quadratically in the time complexity. Quantum chemistry is considered a prominent candidate to benefit from quantum computing given the variety of quantum algorithms put forth to solve the electronic structure problem of particular systems of interest. These quantum algorithm proposals can be broadly categorized in three main categories that span the spectrum: from noisy intermediate scale quantum (NISQ) computers to early and full scale fault tolerant quantum ((E)FTQC) computers. Firstly, the variational quantum eigensolver (VQE) family of quantum algorithms which variationally search for the ground state energy through the optimization of the energy of a parametrized state prepared in a quantum computer using an ansatz. Secondly, the quantum Krylov subspace diagonalization (QKSD) methods, which generate a subspace of the original Hilbert space and efficiently produce the lowest energy in said subspace as its output. Lastly, we have the quantum phase estimation (QPE) algorithms, which provably produce the ground state energy in Heisenberg scaling presenting hence a provable efficient solution. In this thesis, we firstly set to work on the problem of efficient Hamiltonian linear combination of unitaries (LCU) representation. This is mainly motivated by the wide-range impact an efficient compression of the Hamiltonian can potentially have on several quantum algorithms such as VQE, QPE...etc. We designed a method that efficiently compress the Hamiltonian representation in a way that is beneficially impactful across the set of the aforementioned quantum algorithms. Namely, we motivate and present in Sections 1.3 and 1.4 respectively, the regularized compressed double-factorization (RC-DF) and show how it reduces the energy measurement complexity both in terms of number of distinct observables and number of samples. Moreover, it also reduces the total depth of the quantum phase estimation circuit thanks to its low normalization factor. Secondly, given the importance of the energy derivatives, in Sections 2.1 and 2.2, we introduce and present an efficient quantum algorithm for the calculation of the analytic gradient of VQE energies of double-factorized Hamiltonians. Furthermore, in Section 2.1, we expand on the utility of RC-DF by presenting a quantum algorithm that determines the analytic gradient of energies measured with respect to RC-DF Hamiltonains. Third, in Section 3.1, we summarize the theoretical results of purification error-mitigation techniques, namely echo verification and virtual distillation. In Section 3.2, we report on the results of the experimental bench mark, of said techniques, performed on on Google’s Sycamore device to validate the theoretical scaling of error suppression and extrapolate the resources needed for classically intractable system sizes. Fourth, in Section 4 we establish the challenges of computing energy gradients in a quantum Krylov frame work. To overcome the problem, we provide, in Section 4.3, an efficient quantum algorithm for calculating energy derivative obtained through QKSD procedures. Our approach shows how the QKSD ground state can be prepared using quantum signal processing (QSP) and reduces the number of observables to O(1) per reduced density matrix (RDM). Lastly, in light of the importance of quantum RAMs due to their utility in a variety of quantum algorithms that require efficient initial state preparation, as explained in Section 5.5, we address the problematic exponential depth of the bucket-brigade QRAM (when decomposed). We present in Section 5.6 a very efficient Clifford+T decomposition of the bucket-brigade QRAM, which preserves the linear scaling of the depth of the circuit without introducing any additional ancilla.
Abstract Ab‐initio quantum chemistry simulations are essential for understanding electronic structure of molecules and materials in almost all areas of chemistry. A broad variety of electronic structure theories and implementations has been developed in the past decades to hopefully solve the many‐body Schrödinger equation in an approximate manner on modern computers. In this review, we present recent progress in advancing low‐rank electronic structure methodologies that rely on the wavefunction sparsity and compressibility to select the important subset of electronic configurations for both weakly and strongly correlated molecules. Representative chemistry applications that require the many‐body treatment beyond traditional density functional approximations are discussed. The low‐rank electronic structure theories have further prompted us to highlight compressive and expressive principles that are useful to catalyze idea of quantum learning models. The intersection of the low‐rank correlated feature design and the modern deep neural network learning provides new feasibilities to predict chemically accurate correlation energies of unknown molecules that are not represented in the training dataset. The results by others and us are discussed to reveal that the electronic feature sets from an extremely low‐rank correlation representation, which is very poor for explicit energy computation, are however sufficiently expressive for capturing and transferring electron correlation patterns across distinct molecular compositions, bond types and geometries. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods Software > Quantum Chemistry Software > Simulation Methods
Abstract: Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone–resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in O(Gn) time for a circuit with Ggates on nqubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than 103 circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit T1/T2 rates, up to n= 8, depth 40), the envelope bound achieves 100% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately 2.6× at depth 20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime n≤ 8, depth ≤ 20, and γT ≲ 0.3. These results establish a circuit-structure–based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.
Abstract Reliable quantum computation requires certifiable bounds on the degradation of ideal circuit outputs under realistic noise. Existing fidelity estimates are typically asymptotic, hardware-specific, or require full density-matrix simulation, rendering them impractical for circuit-scale certification. We introduce a computable fidelity floor for noisy quantum circuits based on light-cone--resolved Pauli weight growth. For circuits subject to independent Markovian single-qubit noise, we prove a rigorous trace-distance bound expressed entirely in terms of circuit structure: per-qubit active times and a combinatorial backward light-cone descriptor of entangling gates. The resulting bound is computable in O(Gn) time for a circuit with G gates on n qubits, avoiding exponential state-space simulation. We further introduce an empirically validated exponential envelope refinement that tightens the rigorous bound while remaining conservative across all tested configurations. Across more than 103 circuit instances spanning four noise heterogeneity structures (uniform, anti-correlated, spike, and random per-qubit T1/T2 rates, up to n=8, depth~40), the envelope bound achieves 100\% validity and exhibits a stable compression factor across heterogeneity modes, reaching approximately 2.6× at depth~20 relative to the combinatorial bound. The envelope remains informative within the empirically determined regime n≤8, depth~≤20, and γT≲0.3. These results establish a circuit-structure--based fidelity certification framework computable at compiler timescale and identify a depth-dependent compression invariant connecting rigorous combinatorial bounds to empirically tighter envelope estimates.
Progress towards quantum utility in chemistry requires not only algorithmic advances, but also the identification of chemically meaningful problems whose electronic structure fundamentally challenges classical methods. Here, we introduce a curated hierarchy of chemically decisive benchmark systems designed to probe distinct regimes of electronic correlation relevant to molecular, bioinorganic, and heavy-element chemistry. Moving beyond minimal toy models, our benchmark set spans multireference bond breaking (N2), high-spin transition-metal chemistry (FeS), biologically relevant iron-sulfur clusters ([2Fe-2S]), and actinide-actinide bonding (U2), which exhibits extreme sensitivity to active-space choice, relativistic treatment, and correlation hierarchy even within advanced multireference frameworks. As a concrete realization, we benchmark a recently developed automated and adaptive quantum algorithm based on generator-coordinate-inspired subspace expansion,ADAPT-GCIM, using a black-box workflow that integrates entropy-based active-space selection via the ActiveSpaceFinder tool. Across this chemically diverse problem set, ADAPT-GCIM achieves high accuracy in challenging correlation regimes. Equally importantly, these benchmarks expose general failure modes and design constraints-independent of any specific algorithm-highlighting the necessity of problem-aware and correlation-specific strategies for treating strongly correlated chemistry on quantum computers. To support systematic benchmarking and reproducible comparisons, the Hamiltonians for all systems studied are made openly available.