Abstract Quantum-enhanced auxiliary field quantum Monte Carlo (QC-AFQMC) uses output from a quantum computer to increase the accuracy of its classical counterpart. The algorithm requires the estimation of overlaps between walker states and a trial wavefunction prepared on the quantum computer. We study the applicability of this algorithm in terms of the number of measurements required from the quantum computer and the classical costs of post-processing those measurements. We compare the classical post-processing costs of state-of-the-art measurement schemes using classical shadows to determine the overlaps and argue that the overall post-processing cost stemming from overlap estimations scales like O ( N 9 ) per walker throughout the algorithm. With further numerical simulations, we compare the variance behavior of the classical shadows when randomizing over different ensembles, e.g. Cliffords and (particle-number restricted) matchgates beyond their respective bounds, and uncover the existence of covariances between overlap estimations of the AFQMC walkers at different imaginary time steps. Moreover, we include analyses of how the error in the overlap estimation propagates into the AFQMC energy and discuss its scaling when increasing the system size.
Abstract Quantum-enhanced auxiliary field quantum Monte Carlo (QC-AFQMC) uses output from a quantum computer to increase the accuracy of its classical counterpart. The algorithm requires the estimation of overlaps between walker states and a trial wavefunction prepared on the quantum computer. We study the applicability of this algorithm in terms of the number of measurements required from the quantum computer and the classical costs of post-processing those measurements. We compare the classical post-processing costs of state-of-the-art measurement schemes using classical shadows to determine the overlaps and argue that the overall post-processing cost stemming from overlap estimations scales like O ( N 9 ) per walker throughout the algorithm. With further numerical simulations, we compare the variance behavior of the classical shadows when randomizing over different ensembles, e.g. Cliffords and (particle-number restricted) matchgates beyond their respective bounds, and uncover the existence of covariances between overlap estimations of the AFQMC walkers at different imaginary time steps. Moreover, we include analyses of how the error in the overlap estimation propagates into the AFQMC energy and discuss its scaling when increasing the system size.
Quantum-classical auxiliary-field quantum Monte Carlo (QC-AFQMC) is a promising route to using quantum computers for strongly correlated electronic structure problems, but its scalability is limited by a classical post-processing bottleneck: the measured quantum trial state must be used to evaluate overlaps, force biases, and local energies for many walkers throughout the AFQMC propagation. Existing matchgate-shadow approaches avoid the exponential cost of generic classical shadows, but their post-processing remains expensive for large systems. In this work, we show that particle-number-preserving fermionic shadows, implemented as orbital-rotation shadows, are able to drastically reduce QC-AFQMC post-processing costs. We derive efficient estimators for overlaps and their derivatives, giving O(N3) scaling for overlaps and force biases and O(N4) scaling for local energies per shadow and walker and with O(N) Cholesky vector. For fixed normalized target determinants, we also prove that the overlap estimator is unbiased with variance upper bounded by O(η), where η is the particle number, yielding a sufficient budget of O(η/ε2) ideal independent measurements for additive overlap error ε. We combine these estimators with a novel virtual-correlation-energy treatment and a GPU implementation and demonstrate QC-AFQMC using orbital-rotation shadows. Performance projections for π-conjugated molecules up to pentacene with a (22e, 22o) active space and 356 total orbitals show that the full classical post-processing workflow can be completed in slightly more than two days on 8×A100 graphics processing units (GPUs). These results significantly reduce classical post-processing costs for QC-AFQMC and motivate further improvements in preparation and measurement of the trial state on quantum hardware.
We introduce algorithmic improvements to quantum-classical auxiliary-field quantum Monte Carlo (QC-AFQMC) that reduce the dominant per-step classical scaling from O~(N5.5) to O~(N4.5) as a function of the number of molecular spin-orbitals N. Central to this improvement is the application of Aitken's block transformation to handle singular Pfaffians arising in the estimation of overlaps between a quantum trial state and classical Slater-determinant walkers. Together with the use of algorithmic differentiation for the computation of the force bias, this yields a 248× estimated runtime improvement for a system of 100 molecular orbitals. Using our workflow, we demonstrate a ground-state energy calculation for H8 from quantum data collected on IQM Emerald and post-processed with a tensor-network-based error-mitigation technique. We further validate the method's scalability through noiseless simulation of hydrogen chains up to H12, and on the lithium-air battery related rearrangement pathway of the Li2O4 lithium superoxide dimer in a (26e, 20o) active space. We estimate both quantum and classical runtimes for a potential fault-tolerant implementation of QC-AFQMC, showing that the method holds promise for the early fault-tolerant era. These results move QC-AFQMC a step closer to treating chemically relevant systems.
High Resolution Image Download MS PowerPoint Slide Quantum Monte Carlo (QMC) methods are powerful approaches for solving electronic structure problems. Although they often provide high-accuracy solutions, the precision of most QMC methods is ultimately limited by the trial wave function that must be used. Recently, an approach has been demonstrated to allow the use of trial wave functions prepared on a quantum computer [Huggins et al., Unbiasing fermionic quantum Monte Carlo with a quantum computer. Nature 2022, 603, 416] in the auxiliary-field QMC (AFQMC) method using classical shadows to estimate the required overlaps. However, this approach has an exponential post-processing step to construct these overlaps when performing classical shadows obtained using random Clifford circuits. Here, we study an approach to avoid this exponential scaling step by using a fixed-node Monte Carlo method based on full configuration interaction quantum Monte Carlo. This method is applied to the local unitary cluster Jastrow ansatz. We consider H 4, ferrocene, and benzene molecules using up to 12 qubits as examples. Circuits are compiled to native gates for typical near-term architectures, and we assess the impact of circuit-level depolarizing noise on the method. We also provide a comparison of AFQMC and fixed-node approaches, demonstrating that AFQMC is more robust to errors, although extrapolations of the fixed-node energy reduce this discrepancy. Although the method can be used to reach chemical accuracy, the sampling cost to achieve this is high even for small active spaces, suggesting caution about the prospect of outperforming conventional QMC approaches.
Using trial wave functions prepared on quantum devices to reduce the bias of auxiliary-field quantum Monte Carlo (QC-AFQMC) has established itself as a promising hybrid approach to the simulation of strongly correlated many body systems. Here, we further reduce the required quantum resources by decomposing the trial wave function into classical and quantum parts, respectively treated by classical and quantum devices, within the contextual subspace projection formalism. Importantly, we show that our algorithm is compatible with the recently developed matchgate shadow protocol for efficient overlap calculation in QC-AFQMC. Investigating the nitrogen dimer and the reductive decomposition of ethylene carbonate in lithium-based batteries, we observe that our method outperforms a number of established algorithm for ground state energy computations, while reaching chemical precision with less than half of the original number of qubits.
We introduce QC-CBT-AFQMC, a hybrid algorithm that incorporates computational basis tomography (CBT) into the quantum-classical auxiliary field quantum Monte Carlo (QC-AFQMC) method proposed by Huggins [], replacing the use of classical shadows. While the original QC-AFQMC showed high accuracy for quantum chemistry calculations, it required exponentially costly postprocessing. Subsequent work using Matchgate shadows [Wan ] improved scalability, but still suffers from prohibitive computational requirements that limit practical applications. Our QC-CBT-AFQMC approach uses shallow Clifford circuits with a quadratic reduction of two-qubit gates over the original algorithm, significantly reducing computational requirements and enabling accurate calculations under limited measurement budgets. We demonstrate its effectiveness on the hydroxyl radical, ethylene, and nitrogen molecule, producing potential energy curves that closely match established benchmarks. We also examine the influence of CBT measurement counts on accuracy, showing that subtracting the active space AFQMC energy mitigates measurement-induced errors. Furthermore, we apply QC-CBT-AFQMC to estimate reaction barriers in [ 3 + 2 ] cycloaddition reactions, achieving agreement with high-level references and successfully incorporating complete basis set extrapolation techniques. These results highlight QC-CBT-AFQMC as a practical quantum-classical hybrid method that bridges the capabilities of quantum devices and accurate chemical simulations.
The phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) method is a stochastic imaginary-time projection method for computing ground-state properties of strongly correlated quantum systems, whose accuracy depends critically on the trial wavefunction. We present a benchmarking study of trial wavefunctions prepared using parameterized quantum circuits, spanning unitary coupled cluster (UCC), Hamiltonian-informed, Jastrow-inspired, and adaptively constructed ansatzes, and evaluate their accuracy, expressibility, and resource requirements within the quantum-computing-enhanced AFQMC (QC-AFQMC) framework. Trial states are prepared with GPU-accelerated statevector simulations using CUDA-Q and tested on stretched linear hydrogen chains and nine closed-shell molecules at equilibrium with varying static correlation. We find that at similar parameter counts, ph-AFQMC largely removes differences between families for weakly and moderately correlated systems: every trial yields a ph-AFQMC energy within chemical accuracy despite trial energy errors spanning nearly three orders of magnitude, whereas ansatz choice becomes consequential as static correlation grows. Our results indicate that trial variational energy is not always a reliable indicator of ph-AFQMC quality, and that adding variational parameters can lower the trial energy while degrading the ph-AFQMC energy. Across our benchmark systems, trial fidelity ranks trials more reliably than variational energy, and for spin-contaminated trials, the singlet-projected fidelity is more reliable than unprojected fidelity. The UCCSD ansatz initialized from unrestricted CCSD amplitudes provides a robust and inexpensive-to-optimize baseline across benchmark systems, with circuit depth as its principal limitation, while adaptive and compact layered ansatzes remain competitive in accuracy under strong correlation with substantially shallower circuits.