Error-resilient Monte Carlo quantum simulation of imaginary time

Abstract

Computing the ground-state properties of quantum many-body systems is a promising application of near-term quantum hardware with a potential impact in many fields. The conventional algorithm quantum phase estimation uses deep circuits and requires fault-tolerant technologies. Many quantum simulation algorithms developed recently work in an inexact and variational manner to exploit shallow circuits. In this work, we combine quantum Monte Carlo with quantum computing and propose an algorithm for simulating the imaginary-time evolution and solving the ground-state problem. By sampling the real-time evolution operator with a random evolution time according to a modified Cauchy-Lorentz distribution, we can compute the expected value of an observable in imaginary-time evolution. Our algorithm approaches the exact solution given a circuit depth increasing polylogarithmically with the desired accuracy. Compared with quantum phase estimation, the Trotter step number, i.e. the circuit depth, can be thousands of times smaller to achieve the same accuracy in the ground-state energy. We verify the resilience to Trotterisation errors caused by the finite circuit depth in the numerical simulation of various models. The results show that Monte Carlo quantum simulation is promising even without a fully fault-tolerant quantum computer.

41 pages, 11 figures

References in corpus (13)

• Surface codes: Towards practical large-scale quantum computation
• Simulated Quantum Computation of Molecular Energies
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Real- and imaginary-time evolution with compressed quantum circuits
• A randomized quantum algorithm for statistical phase estimation
• Error mitigation via verified phase estimation
• A theory of quantum subspace diagonalization
• Evaluating energy differences on a quantum computer with robust phase estimation
• Imaginary Time Propagation on a Quantum Chip
• Randomizing multi-product formulas for Hamiltonian simulation
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer

Cited by in corpus (14)

• Linear combination of Hamiltonian simulation for nonunitary dynamics with optimal state preparation cost
• Kerr-effect-based quantum logical gates in decoherence-free subspace
• Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity
• Measurement-efficient quantum Krylov subspace diagonalisation
• Probing spectral features of quantum many-body systems with quantum simulators
• Accelerating quantum imaginary-time evolution with random measurements
• A Quantum Simulation Approach to Implementing Nuclear Density Functional Theory via Imaginary Time Evolution
• Quantum computing quantum Monte Carlo algorithm
• Adaptive sampling-based optimization of quantics tensor trains for noisy functions: applications to quantum simulations
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Exponential distillation of dominant eigenproperties
• Warm Start of Variational Quantum Algorithms for Quadratic Unconstrained Binary Optimization Problems
• Error analysis of quantum operators written as a linear combination of permutations
• Quantum imaginary time evolution and UD-MIS problem