Sample-based quantum diagonalization (SQD) is a hybrid quantum-classical algorithm for estimating ground-state energies in electronic-structure calculations. It uses a quantum processor as a sampler to construct a variational subspace, with Hamiltonian projection and diagonalization performed classically. A critical step in SQD is self-consistent particle-number recovery guided by a global reference occupancy vector. In strongly correlated systems, however, dominant determinants can be distributed across regions of determinant space, causing this reference to become mixture-averaged and biasing recovery toward mean occupations. Here, we introduce cluster-adaptive SQD (CSQD), which clusters pooled single-spin strings and performs particle-number recovery using cluster-specific reference occupancy vectors. Under a matched variational budget, CSQD lowers ground-state energies relative to SQD by up to 15.95 mHa for stretched N2 in a (10e,26o) active space and 57.82 mHa for [2Fe-2S] in a (30e,20o) active space. These results suggest that CSQD better captures dispersed occupation structure in strongly correlated systems.
Comments
23 pages, 5 figures; supplementary information provided as ancillary file
Sample-based quantum diagonalization (SQD) is a hybrid quantum-classical algorithm for estimating ground-state energies in electronic-structure calculations. It uses a quantum processor as a sampler to construct a variational subspace, with Hamiltonian projection and diagonalization performed classically. A critical step in SQD is self-consistent particle-number recovery guided by a global reference occupancy vector. In strongly correlated systems, however, dominant determinants can be distributed across regions of determinant space, causing this reference to become mixture-averaged and biasing recovery toward mean occupations. Here, we introduce cluster-adaptive SQD (CSQD), which clusters pooled single-spin strings and performs particle-number recovery using cluster-specific reference occupancy vectors. Under a matched variational budget, CSQD lowers ground-state energies relative to SQD by up to 15.95 mHa for stretched N2 in a (10e,26o) active space and 57.82 mHa for [2Fe-2S] in a (30e,20o) active space. These results suggest that CSQD better captures dispersed occupation structure in strongly correlated systems.
Sampling-based quantum diagonalization method exploits Quantum-centric supercomputing platforms to sample bitstrings for Hamiltonian projection on a quantum computer, and then classically diagonalize the Hamiltonian to estimate the eigenvalues and eigenvectors. In current quantum devices an algorithm is useful when shallow quantum circuits with error mitigation support can discover better results while having either a proof of convergence or some method to explain trust in experiment. In this paper, we introduce DF-SQD, a hybrid algorithm that derives deterministic auxiliary-field circuits from selected double-factorization leaves of the two-electron tensor. The circuits propose occupation-number configurations, while selected configuration interaction evaluates the original active-space Hamiltonian and can recentre subsequent proposal rounds. On N2 (32 qubits; 6-31G basis) and a 40-qubit [Fe2S2(SCH3)4]2- active-space Hamiltonian, we show that DF-SQD improves the energy obtained from sampled determinant spaces while using shallow number-preserving circuits in both simulator and hardware runs. For N2, DF-SQD is 45x more accurate with a 11.23\% smaller subspace, and due to its ability to sample better bitstrings at lesser shots it is 2.93x faster than SQD in quantum devices. For the iron-sulfur cluster, DF-SQD generated a subspace dimension of 221M with 400K shots, while SQD needed 1.5M shots to generate a 238M subspace, thus we have better subspace recovery evident from the hardware at 3.75x reduced shots. At a matched 50M subspace dimension, DF-SQD is 1.32x more accurate (achieves a 24.5\% relative error reduction over standard SQD). So overall, our method is able to discover better results with shallower circuits, is sample efficient, uses configuration recovery (so has targeted error mitigation) and we have empirical convergence observation.
Quantum Selected Configuration Interaction (QSCI) and an extended protocol known as Sample-based Quantum Diagonalization (SQD) have emerged as promising algorithms to solve the electronic Schrödinger equation with noisy quantum computers. In QSCI/SQD a quantum circuit is repeatedly prepared on the quantum device, and measured configurations form a subspace of the many-body Hilbert space in which the Hamiltonian is diagonalized classically. For the dissociation of N 2 and a model [2Fe – 2S] cluster (correlating 10 electrons in 26 orbitals and 30 electrons in 20 orbitals, respectively) we show that a nonperturbative stochastic approach, phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC), using truncated SQD trial wave functions obtained from quantum hardware can recover a substantial amount (e.g., O (100) mHa) of correlation energy. This hybrid quantum-classical combination has the potential to greatly reduce the sampling burden placed on the QSCI/SQD procedure, and is a compelling alternative to recently proposed hybrid ph-AFQMC algorithms that rely on quantum state tomography.
Sample-based quantum diagonalization (SQD), equivalently quantum-selected configuration interaction (QSCI), has become a centre of gravity of pre-fault-tolerant quantum chemistry: a processor samples electronic configurations and the Hamiltonian is diagonalized classically in the resulting subspace. Accuracy is governed entirely by which configurations enter it -- a machine-learning selection problem, made acute by a coupon-collector bottleneck. We review the generative and learned selectors by what each generates and the signal it exploits, and identify one gap: no reward-proportional generative-flow-network proposer has been built for tail discovery. On the field's central question -- whether the quantum sampler beats classical selected CI -- the negative verdict is not ours to claim: priority belongs to Reinholdt et al. [JCTC 21, 6811 (2025)], and polynomial-time classical estimation of the flagship circuits has reinforced it. We state that verdict at the precision a falsifiable claim requires -- it concerns reproducible, same-active-space comparisons on molecular electronic structure -- and weigh the claims outside those qualifiers. We show that alpha-string weights are not invariant under rotations inside degenerate orbital shells, so determinant counts are undefined until the orbital gauge is declared. We distil a ten-element benchmarking standard and apply it to our own deposit, which returned defects that changed numbers printed here and retracted one from v1. FCI-exact experiments confirm one prediction and refute another: the single generative advantage we find keeps no consistent sign along the dissociation coordinate at device-calibrated noise and reverses under a symmetric readout model. It does beat a noise-matched classical recovery loop on N2 by a margin five seeds cannot resolve, and loses by over a factor of two to a classical selector that needs no sampler.
Sample-based Quantum Diagonalization (SQD) is a hybrid quantum-classical method that replaces variational optimization with a self-consistent recovery loop over QPU samples. Although SQD is considered robust to noisy samples and imperfect classical inputs, its robustness across practical deployment choices has not been systematically analyzed. As a result, shot budgets, qubit layouts, noise mitigation strategies, and the coupled-cluster singles and doubles (CCSD) amplitudes that initialize the ansatz are often chosen without clear empirical guidance. We analyze SQD robustness on IBM Heron hardware across these dimensions. Structured CCSD-amplitude perturbations, including complete zeroing, produce only modest energy shifts from the clean baseline. Differences across layouts and noise-mitigation settings are large in the first recovery iteration but narrow within a few iterations. Accuracy saturates at moderate shot budgets, while very large budgets slightly worsen recovered energies, likely because working-set selection limits the value of additional samples. These results identify where SQD provides genuine deployment robustness and where its limits remain.
Sample-based quantum diagonalization (SQD) offers a powerful route to accurate quantum chemistry on noisy intermediate-scale quantum (NISQ) devices by combining quantum sampling with classical diagonalization. Here we introduce HSQD, a novel half-qubit SQD approach that halves the qubit requirement for simulating a chemical system and drastically reduces overall circuit depth and gate counts, suppressing hardware noise. When modeling the dissociation of the nitrogen molecule with a (10e, 26o) active space, HSQD matches the accuracy of SQD on IBM quantum hardware using only half the number of qubits and 40% fewer measurements. We further enhance HSQD with a heat-bath configuration interaction (HCI) inspired selection of the samples, forming HCI-HSQD. This yields sub-millihartree accuracy across the N2 potential energy surface and produces subspaces up to 39% smaller than those from classical HCI, showing a significant improvement in the compactness of the ground-state representation. Finally, we demonstrate the scalability of HCI-HSQD using iron-sulfur clusters, reaching active spaces of up to (54e, 36o) while using only half as many qubits as the original SQD. For these systems, HCI-HSQD reduces SQD energy errors by up to 76% for [2Fe-2S] and 26% for [4Fe-4S], while also reducing subspace sizes, halving measurement requirements, and eliminating expensive post-processing. Together, these results establish half-qubit SQD as a noise-resilient and resource-efficient pathway toward practical quantum advantage in strongly correlated chemistry.
Accurately and efficiently describing strongly correlated electronic systems is a central challenge in quantum computational chemistry, with classical and quantum computers. The localized active space self-consistent field method (LASSCF) uses a product of fragment active spaces as a variational space, with the Schrödinger equation solved exactly in each fragment and the fragment active-space orbitals defined in a self-consistent manner. LASSCF is accurate for systems with strong intra-fragment and weak inter-fragment correlation, and its computational cost is combinatorial with respect to the size of the individual fragment active spaces, rather than their product. However, exactly solving the Schrödinger equation in each fragment remains a substantial bottleneck. Here, we address the possibility of solving the fragment active space Schrödinger equation with approximate methods, particularly sample-based quantum diagonalization (SQD). SQD is a technique that uses a quantum computer to sample configurations from a chemically motivated quantum circuit and a classical computer to mitigate errors and solve the Schrödinger equation in a subspace of the configuration space. We apply the proposed method, LASSQD, to the [Fe(H2O)4]2bpym4+ compound and the [FeIIIFeIIIFeII(μ3-O)-(HCOO)6] complex for calculating the intermediate-spin ground state energies. We observe that LASSQD can tackle fragment sizes intractable by LASSCF, achieves within 1kcal/mol agreement to LASSCF, and delivers results that are competitive with alternative classical methods to solve the Schrödinger equation, and thus can be used as a starting point for a perturbative treatment (LASSQD-PDFT) to recover correlation external to the active space.