Quantum computing quantum Monte Carlo algorithm
Yukun Zhang, Yifei Huang, Jinzhao Sun, Dingshun Lv, Xiao Yuan
TL;DR
The paper addresses the sign problem and circuit-depth limitations that hinder solving ground-state problems in strongly correlated quantum systems. It introduces QC-FCIQMC, a hybrid quantum-classical algorithm that replaces classical Slater-determinant walkers with quantum walkers |\phi_i\rangle=U|i\rangle, where U is prepared by a shallow VQE circuit to yield a Walker basis closer to the ground state. Non-stoquasticity indicators (NSIs) with computable upper bounds quantify the sign problem and guide basis rotations to mitigate it, while quantum circuits efficiently sample Hamiltonian couplings |\widetilde{H_{ij}}| and implement spawning via a Bernoulli factory, enabling scalable imaginary-time evolution without exponential resource costs. Numerical tests on N2 (12 qubits) and the 2×4 Hubbard model (16 qubits) show substantial reductions in NSIs and energy variance, and orders-of-magnitude fewer walkers are needed as the VQE-based basis deepens, achieving chemical accuracy with shallow circuits. Overall, the work demonstrates a practical pathway for near-term quantum hardware to tackle realistic quantum chemistry and condensed-matter problems, supported by NSI bounds that quantify and guide sign-problem mitigation.
Abstract
Quantum computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates these two methods, inheriting their distinct features in efficient representation and manipulation of quantum states and overcoming their limitations. We first introduce non-stoquasticity indicators (NSIs) and their upper bounds, which measure the sign problem, the most notable limitation of QMC. We show that our algorithm could greatly mitigate the sign problem, which decreases NSIs with the assistance of quantum computing. Meanwhile, the use of quantum Monte Carlo also increases the expressivity of shallow quantum circuits, allowing more accurate computation that is conventionally achievable only with much deeper circuits. We numerically test and verify the method for the N$_2$ molecule (12 qubits) and the Hubbard model (16 qubits). Our work paves the way to solving practical problems with intermediate-scale and early-fault tolerant quantum computers, with potential applications in chemistry, condensed matter physics, materials, high energy physics, etc.
