Obstructions To Classically Simulating The Quantum Adiabatic Algorithm
M. B. Hastings, M. H. Freedman

TL;DR
This paper demonstrates that quantum Monte Carlo methods can fail to efficiently simulate certain adiabatic quantum algorithms due to topological obstructions, even when the spectral gap is only polynomially small.
Contribution
The paper constructs specific Hamiltonians with topological features that cause QMC to fail in equilibration, revealing fundamental obstructions to classical simulation of quantum adiabatic algorithms.
Findings
QMC does not equilibrate in certain topologically nontrivial Hamiltonians.
Failure of QMC occurs even with polynomially small spectral gaps.
Topological properties can prevent classical simulation of quantum algorithms.
Abstract
We consider the adiabatic quantum algorithm for systems with "no sign problem", such as the transverse field Ising mode, and analyze the equilibration time for quantum Monte Carlo (QMC) on these systems. We ask: if the spectral gap is only inverse polynomially small, will equilibration methods based on slowly changing the Hamiltonian parameters in the QMC simulation succeed in a polynomial time? We show that this is not true, by constructing counter-examples. Some examples are Hamiltonians where the space of configurations where the wavefunction has non-negligible amplitude has a nontrivial fundamental group, causing the space of trajectories in imaginary time to break into disconnected components, with only negligible probability outside these components. For the simplest example we give with an abelian fundamental group, QMC does not equilibrate but still solves the optimization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Chemical Physics Studies · Quantum many-body systems · Markov Chains and Monte Carlo Methods
