Solving the electronic structure problem of molecules and solids to high accuracy is a major challenge in quantum chemistry and condensed matter physics. The rapid emergence and development of quantum computers offer a promising route to systematically tackle this problem. Recent work by [Huggins , ] proposed a hybrid quantum-classical quantum Monte Carlo (QC-QMC) algorithm using Clifford shadows to determine the ground state of a Fermionic Hamiltonian. This approach displayed inherent noise resilience and the potential for improved accuracy compared to its purely classical counterpart. Nevertheless, the use of Clifford shadows introduces an exponentially scaling postprocessing cost. In this work, we investigate an improved QC-QMC scheme utilizing the recently developed Matchgate shadows technique [], which removes the aforementioned exponential bottleneck. We observe from experiments on quantum hardware that the use of Matchgate shadows in QC-QMC is inherently noise robust. We show that this noise resilience has a more subtle origin than in the case of Clifford shadows. Nevertheless, we find that classical postprocessing, while asymptotically efficient, requires hours of runtime on thousands of classical CPUs for even the smallest chemical systems, presenting a major challenge to the scalability of the algorithm. Published by the American Physical Society 2024
Solving the electronic structure problem of molecules and solids to high accuracy is a major challenge in quantum chemistry and condensed matter physics. The rapid emergence and development of quantum computers offer a promising route to systematically tackle this problem. Recent work by [Huggins , ] proposed a hybrid quantum-classical quantum Monte Carlo (QC-QMC) algorithm using Clifford shadows to determine the ground state of a Fermionic Hamiltonian. This approach displayed inherent noise resilience and the potential for improved accuracy compared to its purely classical counterpart. Nevertheless, the use of Clifford shadows introduces an exponentially scaling postprocessing cost. In this work, we investigate an improved QC-QMC scheme utilizing the recently developed Matchgate shadows technique [], which removes the aforementioned exponential bottleneck. We observe from experiments on quantum hardware that the use of Matchgate shadows in QC-QMC is inherently noise robust. We show that this noise resilience has a more subtle origin than in the case of Clifford shadows. Nevertheless, we find that classical postprocessing, while asymptotically efficient, requires hours of runtime on thousands of classical CPUs for even the smallest chemical systems, presenting a major challenge to the scalability of the algorithm. Published by the American Physical Society 2024
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.
Abstract “Classical shadows” are estimators of an unknown quantum state, constructed from suitably distributed random measurements on copies of that state (Huang et al. in Nat Phys 16:1050, 2020, https://doi.org/10.1038/s41567-020-0932-7 ). In this paper, we analyze classical shadows obtained using random matchgate circuits, which correspond to fermionic Gaussian unitaries. We prove that the first three moments of the Haar distribution over the continuous group of matchgate circuits are equal to those of the discrete uniform distribution over only the matchgate circuits that are also Clifford unitaries; thus, the latter forms a “matchgate 3-design.” This implies that the classical shadows resulting from the two ensembles are functionally equivalent. We show how one can use these matchgate shadows to efficiently estimate inner products between an arbitrary quantum state and fermionic Gaussian states, as well as the expectation values of local fermionic operators and various other quantities, thus surpassing the capabilities of prior work. As a concrete application, this enables us to apply wavefunction constraints that control the fermion sign problem in the quantum-classical auxiliary-field quantum Monte Carlo algorithm (QC-AFQMC) (Huggins et al. in Nature 603:416, 2022, https://doi.org/10.1038/s41586-021-04351-z ), without the exponential post-processing cost incurred by the original approach.
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.
Quantum-classical auxiliary-field quantum Monte Carlo (QC-AFQMC) uses a trial state prepared on a quantum computer to improve the accuracy of the classical AFQMC algorithm. State-of-the-art QC-AFQMC represents this state with matchgate shadows, so every trial-walker overlap and local energy must be averaged over many snapshots, making this classical computation a bottleneck. Here we distill the matchgate shadow data into a symmetry-constrained, noise-aware, autoregressive transformer neural quantum state (NQS). Used as the AFQMC trial state, the NQS evaluates overlaps, force biases, and local energies without repeatedly summing over the matchgate shadows. For a nickel-catalyzed oxidative-addition reaction, the noise-awareness of our NQS design successfully recovers the ideal-upCCD AFQMC barrier and reaction energy within statistical uncertainty, while standard QC-AFQMC execution with the same shadow data yields qualitatively inaccurate results as a result of hardware noise. Since the shadow data are needed only for training, the estimated classical cost for the nickel system falls by approximately 99% relative to our previous QC-AFQMC implementation.
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.
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem, for instance, the development of variational quantum algorithms. A recent work by Huggins et al. [1] reports a novel candidate, i.e. a quantum-classical hybrid Monte Carlo algorithm with a reduced bias in comparison to its fully-classical counterpart. In this paper, we propose a family of scalable quantum-assisted Monte Carlo algorithms where the quantum computer is used at its minimal cost and still can reduce the bias. By incorporating a Bayesian inference approach, we can achieve this quantum-facilitated bias reduction with a much smaller quantum-computing cost than taking empirical mean in amplitude estimation. Besides, we show that the hybrid Monte Carlo framework is a general way to suppress errors in the ground state obtained from classical algorithms. Our work provides a Monte Carlo toolkit for achieving quantum-enhanced calculation of fermion systems on near-term quantum devices.