Metropolis-style random sampling of quantum gates for the estimation of low-energy observables
arXiv:2111.14676 · doi:10.1103/PhysRevD.105.034515
Abstract
We propose a quantum algorithm to compute low-energy expectation values of a quantum Hamiltonian by sampling a partition function associated with the average energy of that Hamiltonian. For any given quantum circuit-Hamiltonian pair, there is an associated average energy. The sampling is done through an accept/reject Metropolis-style algorithm on the quantum gates of the circuit itself. Observables calculated under the canonical ensemble from these samples of circuits are extrapolated from higher-energies to the ground state.
arXiv commentsix pages, five figures
References in corpus (17)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- The Variational Quantum Eigensolver: a review of methods and best practices
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Perspectives of quantum annealing: Methods and implementations
- Worm algorithms for classical statistical models
- Quantum Metropolis Sampling
- Near-optimal ground state preparation
- A Quantum-Quantum Metropolis Algorithm
- Preparing ground states of quantum many-body systems on a quantum computer
- Scattering in the Ising Model Using Quantum Lanczos Algorithm
- Projected Cooling Algorithm for Quantum Computation
- Simulating gauge theories with variational quantum eigensolvers in superconducting microwave cavities
- Projective Cooling for the transverse Ising model
- Quantum algorithm for preparing the ground state of a system via resonance transition