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.

arXiv comment41 pages, 11 figures

References in corpus (46)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group
• Surface codes: Towards practical large-scale quantum computation
• Efficient simulation of one-dimensional quantum many-body systems
• Simulated Quantum Computation of Molecular Energies
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Quantum Monte Carlo methods for nuclear physics
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Towards Practical Quantum Variational Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Variational ansatz-based quantum simulation of imaginary time evolution
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Direct estimations of linear and non-linear functionals of a quantum state
• Universal Quantum Estimator
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• A random compiler for fast Hamiltonian simulation
• Quantum Algorithms for Fermionic Simulations
• Gate count estimates for performing quantum chemistry on small quantum computers
• 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
• Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
• Faster quantum simulation by randomization
• Higher Order Decompositions of Ordered Operator Exponentials
• Ab initio computations of molecular systems by the auxiliary-field quantum Monte Carlo method
• Algorithms for quantum simulation at finite energies
• Proof for an upper bound in fixed-node Monte Carlo for lattice fermions
• Monte Carlo study of real time dynamics
• A randomized quantum algorithm for statistical phase estimation
• Error mitigation via verified phase estimation
• Quantum Filter Diagonalization: Quantum Eigendecomposition without Full Quantum Phase Estimation
• Finite-temperature Auxiliary-Field Quantum Monte Carlo: Self-Consistent Constraint and Systematic Approach to Low Temperatures
• A theory of quantum subspace diagonalization
• Evaluating energy differences on a quantum computer with robust phase estimation
• Ab Initio Finite Temperature Auxiliary Field Quantum Monte Carlo
• Spectral density estimation with the Gaussian Integral Transform
• Probabilistic Nonunitary Gate in Imaginary Time Evolution
• Imaginary Time Propagation on a Quantum Chip
• QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
• Randomizing multi-product formulas for Hamiltonian simulation
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries

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