Quantum computing quantum Monte Carlo algorithm
arXiv:2206.10431 · doi:10.1103/jt8s-hzhd
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 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.
References in corpus (82)
- 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
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- Solving the Quantum Many-Body Problem with Artificial Neural Networks
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computational chemistry
- Adiabatic Quantum Computing
- Quantum Chemistry in the Age of Quantum Computing
- Simulated Quantum Computation of Molecular Energies
- Error mitigation for short-depth quantum circuits
- Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- The power of quantum neural networks
- Noise-Induced Barren Plateaus in Variational Quantum Algorithms
- Quantum algorithms for quantum chemistry and quantum materials science
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- Hartree-Fock on a superconducting qubit quantum computer
- Towards Practical Quantum Variational Algorithms
- Efficient variational quantum simulator incorporating active error minimisation
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Stripe order in the underdoped region of the two-dimensional Hubbard model
- Tensor networks for complex quantum systems
- Quantum Simulators: Architectures and Opportunities
- Toward the first quantum simulation with quantum speedup
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Density matrix embedding: A simple alternative to dynamical mean-field theory
- Practical Quantum Error Mitigation for Near-Future Applications
- Hybrid quantum-classical algorithms and quantum error mitigation
- Quantum Algorithms for Quantum Field Theories
- Heat-bath Configuration Interaction: An efficient selected CI algorithm inspired by heat-bath sampling
- Deep neural network solution of the electronic Schrödinger equation
- Ab-Initio Solution of the Many-Electron Schrödinger Equation with Deep Neural Networks
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Training variational quantum algorithms is NP-hard
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- A deterministic alternative to the full configuration interaction quantum Monte Carlo method
- Absence of superconductivity in the pure two-dimensional Hubbard model
- Subspace-search variational quantum eigensolver for excited states
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
- An adaptive configuration interaction approach for strongly correlated electrons with tunable accuracy
- Hybrid quantum-classical approach to correlated materials
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Arbitrary accuracy iterative phase estimation algorithm as a two qubit benchmark
- Scalable error mitigation for noisy quantum circuits produces competitive expectation values
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Near-optimal ground state preparation
- Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
- Interactions between Large Molecules: Puzzle for Reference Quantum-Mechanical Methods
- Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
- Loop updates for variational and projector quantum Monte Carlo simulations in the valence-bond basis
- Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
- A quantum algorithm for high energy physics simulations
- Efficient measure for the expressivity of variational quantum algorithms
- Variational Quantum Fidelity Estimation
- Algorithms for quantum simulation at finite energies
- Sign-Problem-Free Fermionic Quantum Monte Carlo: Developments and Applications
- Observing ground-state properties of the Fermi-Hubbard model using a scalable algorithm on a quantum computer
- Semi-stochastic full configuration interaction quantum Monte Carlo: developments and application
- A randomized quantum algorithm for statistical phase estimation
- Easing the Monte Carlo sign problem
- Early fault-tolerant simulations of the Hubbard model
- Purification-based quantum error mitigation of pair-correlated electron simulations
- Experimental quantum computational chemistry with optimised unitary coupled cluster ansatz
- Toward Practical Quantum Embedding Simulation of Realistic Chemical Systems on Near-term Quantum Computers
- Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
- On the Computational Complexity of Curing the Sign Problem
- Resource Estimation for Quantum Variational Simulations of the Hubbard Model
- Mutual information-assisted Adaptive Variational Quantum Eigensolver
- On low-depth algorithms for quantum phase estimation
- Projector quantum Monte Carlo with matrix product states
- Wavefunction positivization via automatic differentiation
- Mitigating the Sign Problem Through Basis Rotations
- Error-resilient Monte Carlo quantum simulation of imaginary time
- Topological Origin of the Fermion Sign Problem
- Quantum-assisted Monte Carlo algorithms for fermions
- Modeling the Performance of Early Fault-Tolerant Quantum Algorithms