Quantum Metropolis sampling

  title={Quantum Metropolis sampling},
  author={Kristan Temme and Tobias J. Osborne and Karl Gerd H. Vollbrecht and David Poulin and F. Verstraete},
The original motivation to build a quantum computer came from Feynman, who imagined a machine capable of simulating generic quantum mechanical systems—a task that is believed to be intractable for classical computers. Such a machine could have far-reaching applications in the simulation of many-body quantum physics in condensed-matter, chemical and high-energy systems. Part of Feynman’s challenge was met by Lloyd, who showed how to approximately decompose the time evolution operator of… 
A quantum–quantum Metropolis algorithm
This work presents a quantum algorithm which fully generalizes the classical Metropolis algorithm to the quantum domain, and offers a quantum speedup relative to the classical counterpart.
Metropolis-style random sampling of quantum gates to estimate low-energy observables
In many areas of physics, we are often interested in calculating observables when the physical system is in, or is around, its lowest energy state. One particularly difficult problem of this nature
Algorithms for Quantum Simulation at Finite Energies
A quantum algorithm to compute expectation values of observables in a finite energy interval for many-body problems based on a filtering operator, similar to quantum phase estimation, which recovers the physical values by performing interferometric measurements without the need to prepare the filtered state.
Algorithms for Gibbs state preparation on noiseless and noisy random quantum circuits
Two quantum algorithms with provable guarantees to prepare thermal states on current noisy quantum hardware are proposed and tailored to ergodic interacting systems which are a vast subset of physical Hamiltonians.
Quantum algorithm for simulating the dynamics of an open quantum system
In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science.
In this review, a detailed snapshot of current progress in quantum algorithms for ground-state, dynamics, and thermal-state simulation is taken and their strengths and weaknesses for future developments are analyzed.
Quantum algorithm for the simulation of open-system dynamics and thermalization
This paper proposes a way to simulate open-system dynamics by reproducing reservoir correlation functions using a minimised Hilbert space and suggests that the environment on the quantum computer could be even smaller than the system.
Quantum Markov chain Monte Carlo with digital dissipative dynamics on quantum computers
Modeling the dynamics of a quantum system connected to the environment is critical for advancing our understanding of complex quantum processes, as most quantum processes in nature are affected by an
Hardware-efficient quantum algorithm for the simulation of open-system dynamics and the thermalisation on quantum computer
This paper proposes a way to simulate open-system dynamics by reproducing reservoir correlation functions using a minimised Hilbert space and suggests that the environment on the quantum computer could be even smaller than the system.
Quantum algorithm for preparing thermal Gibbs states - detailed analysis
A modified algorithm and a more detailed analysis of the errors that arise due to imperfect simulation of Hamiltonian time evolutions and limited performance of phase estimation are presented to prove a better running time by the effect of these sources of error on the overall complexity.


Quantum information processing in continuous time
Quantum mechanical computers can solve certain problems asymptotically faster than any classical computing device. Several fast quantum algorithms are known, but the nature of quantum speedup is not
The Power of Quantum Systems on a Line
The proof of the QMA-completeness result requires an additional idea beyond the usual techniques in the area: Some illegal configurations cannot be ruled out by local checks, and are instead ruled out because they would, in the future, evolve into a state which can be seen locally to be illegal.
Problem of equilibration and the computation of correlation functions on a quantum computer
The quantum algorithms that are presented could provide an exponential speedup over what can be achieved with a classical device, given a preparation of the equilibrium state.
Quantum simulations of physics problems
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.
Quantum computation and quantum-state engineering driven by dissipation
In quantum information science, dissipation is commonly viewed as an adverse effect that destroys information through decoherence. But theoretical work shows that dissipation can be used to drive
Simulated Quantum Computation of Molecular Energies
Calculations of the water and lithium hydride molecular ground-state energies have been carried out on a quantum computer simulator using a recursive phase-estimation algorithm and mapping of the molecular wave function to the quantum bits are described.
Quantum algorithms for fermionic simulations
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems,
Towards quantum chemistry on a quantum computer.
The application of the latest photonic quantum computer technology to calculate properties of the smallest molecular system: the hydrogen molecule in a minimal basis is reported and the complete energy spectrum is calculated to 20 bits of precision.
Computational complexity of interacting electrons and fundamental limitations of density functional theory
Using arguments from computational complexity theory, fundamental limitations are found for how efficient it is to calculate the ground-state energy of many-electron systems using density functional