Exponential challenges in unbiasing quantum Monte Carlo algorithms with quantum computers

Abstract

Recently, Huggins et. al. [Nature, 603, 416-420 (2022)] devised a general projective Quantum Monte Carlo method suitable for implementation on quantum computers. This hybrid approach, however, relies on a subroutine -the computation of the local energy estimator on the quantum computer -that is intrinsically affected by an exponential scaling of the computational time with the number of qubits. By means of numerical experiments, we show that this exponential scaling manifests prominently already on systems below the point of "quantum advantage". For the prototypical transverse-field Ising model, we show that the required time resources to compete with classical simulations on around 40 qubits are already of the order of $10^{13}$ projective measurements, with an estimated running time of a few thousand years on superconducting hardware. These observations strongly suggest that the proposed hybrid method, in its present form, is unlikely to offer a sizeable advantage over conventional quantum Monte Carlo approaches.

Cited by in corpus (6)

• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• Perturbative quantum simulation
• Diagonalization of large many-body Hamiltonians on a quantum processor
• Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
• Quantum-assisted Monte Carlo algorithms for fermions
• A quantum computing approach to fixed-node Monte Carlo using classical shadows