Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
arXiv:2106.09880 · doi:10.1103/PRXQuantum.2.040361
Abstract
Quantum Monte Carlo and quantum simulation are both important tools for understanding quantum many-body systems. As a classical algorithm, quantum Monte Carlo suffers from the sign problem, preventing its application to most fermion systems and real time dynamics. In this paper, we introduce a novel non-variational algorithm using quantum simulation as a subroutine to accelerate quantum Monte Carlo by easing the sign problem. The quantum subroutine can be implemented with shallow circuits and, by incorporating error mitigation, can reduce the Monte Carlo variance by several orders of magnitude even when the circuit noise is significant. As such, the proposed quantum algorithm is applicable to near-term noisy quantum hardware.
arXiv comment22 pages, 7 figures
References in corpus (75)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Surface codes: Towards practical large-scale quantum computation
- Barren plateaus in quantum neural network training landscapes
- Theory of ultracold Fermi gases
- Quantum computational chemistry
- Quantum Chemistry in the Age of Quantum Computing
- Simulated Quantum Computation of Molecular Energies
- Quantum Amplitude Amplification and Estimation
- Error mitigation for short-depth quantum circuits
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
- Quantum Monte Carlo with Directed Loops
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Quantum Monte Carlo methods for nuclear physics
- 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
- Efficient variational quantum simulator incorporating active error minimisation
- Superfluid Fermi Gases with Large Scattering Length
- Variational ansatz-based quantum simulation of imaginary time evolution
- Noise tailoring for scalable quantum computation via randomized compiling
- Practical Quantum Error Mitigation for Near-Future Applications
- Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Cluster Algorithm for Vertex Models
- A random compiler for fast Hamiltonian simulation
- High density QCD on a Lefschetz thimble?
- Quantum Metropolis Sampling
- Gate count estimates for performing quantum chemistry on small quantum computers
- Lattice simulations for few- and many-body systems
- Error-mitigated digital quantum simulation
- Low-cost error mitigation by symmetry verification
- Learning-based quantum error mitigation
- Hybrid quantum-classical approach to correlated materials
- Taming the dynamical sign problem in real-time evolution of quantum many-body problems
- Feynman diagrams versus Fermi-gas Feynman emulator
- Virtual Distillation for Quantum Error Mitigation
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
- The problem of equilibration and the computation of correlation functions on a quantum computer
- Thermalization in Nature and on a Quantum Computer
- Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
- Monte Carlo simulations on the Lefschetz thimble: taming the sign problem
- Higher Order Decompositions of Ordered Operator Exponentials
- Diagrammatic Monte Carlo
- Ab initio calculation of the spectrum and structure of O
- A dissipative quantum Church-Turing theorem
- A Quantum-Quantum Metropolis Algorithm
- Quantum advantage with noisy shallow circuits in 3D
- Eigenvector continuation with subspace learning
- Quantum algorithm for simulating the dynamics of an open quantum system
- Algorithms for quantum simulation at finite energies
- Eigenvector Continuation as an Efficient and Accurate Emulator for Uncertainty Quantification
- Monte Carlo study of real time dynamics
- Universal simulation of Markovian quantum dynamics
- Essential elements for nuclear binding
- Easing the Monte Carlo sign problem
- Preparing thermal states of quantum systems by dimension reduction
- Reconstructing non-equilibrium regimes of quantum many-body systems from the analytical structure of perturbative expansions
- Evaluating energy differences on a quantum computer with robust phase estimation
- Dual-state purification for practical quantum error mitigation
- QFold: Quantum Walks and Deep Learning to Solve Protein Folding
- Convergence of Eigenvector Continuation
- Imaginary Time Propagation on a Quantum Chip
- QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator
- Ab initio lattice results for Fermi polarons in two dimensions
- Leveraging Machine Learning to Alleviate Hubbard Model Sign Problems
- Hidden spin-isospin exchange symmetry
- Hardware-efficient quantum algorithm for the simulation of open-system dynamics and thermalisation
- Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries
Cited by in corpus (19)
- Quantum Error Mitigation
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Improved Hamiltonians for Quantum Simulations
- Quantum computing for chemistry and physics applications from a Monte Carlo perspective
- Error statistics and scalability of quantum error mitigation formulas
- Virtual quantum resource distillation
- Error-resilient Monte Carlo quantum simulation of imaginary time
- Gauge Theory Couplings on Anisotropic Lattices
- Quantum computing quantum Monte Carlo with hybrid tensor network for electronic structure calculations
- Fault-tolerant quantum algorithms for quantum molecular systems: A survey
- Quantum-assisted Monte Carlo algorithms for fermions
- Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
- Measurement-efficient quantum Krylov subspace diagonalisation
- Unified multivariate trace estimation and quantum error mitigation
- Exponentially reduced circuit depths in Lindbladian simulation
- TE-PAI: Exact Time Evolution by Sampling Random Circuits
- High-precision and low-depth quantum algorithm design for eigenstate problems
- Exponential distillation of dominant eigenproperties
- Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization