Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Effective Gaps Are Not Effective: Quasipolynomial Classical Simulation of Obstructed Stoquastic Hamiltonians

Journal Article · · Physical Review Letters
 [1];  [2]
  1. Univ. of Maryland, College Park, MD (United States); Joint Center for Quantum Information and Computer Science, College Park, MD (United States); Joint Quantum Institute, College Park, MD (United States)
  2. Booz Allen Hamilton, Inc., Annapolis Junction, VA (United States); George Mason Univ., Fairfax, VA (United States)

All known examples suggesting an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (StoqAQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to subexponentially sample from an effective subspace of any k -local stoquastic Hamiltonian H , without a priori knowledge of its symmetries (or near symmetries). Our algorithm maps any k -local Hamiltonian to a graph G = ( V , E ) with | V | = O (poly (n)) , where n is the number of qubits. Given the well-known result of Babai [Graph isomorphism in quasipolynomial time, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (2016), pp. 684–697], we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasipolynomial in | V | for producing samples from effective subspace eigenstates of H . Our results rule out exponential separations between StoqAQC and classical computation that arise from hidden symmetries in k -local Hamiltonians. Our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in nonstoquastic cases, or be useful in studying additional properties of k -local Hamiltonians.

Research Organization:
Univ. of Maryland, College Park, MD (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Basic Energy Sciences (BES). Materials Sciences & Engineering Division; AFRL
Grant/Contract Number:
SC0019040; SC0019323; SC0019449; SC0020312; FA8750-19-C-0044
OSTI ID:
1852777
Journal Information:
Physical Review Letters, Vol. 125, Issue 17; ISSN 0031-9007
Publisher:
American Physical Society (APS)Copyright Statement
Country of Publication:
United States
Language:
English

References (17)

Graph isomorphism problem journal May 1985
A useful variant of the Davis–Kahan theorem for statisticians journal April 2015
How to make the Quantum Adiabatic Algorithm fail journal June 2008
Quantum Simulation of Many-Body Hamiltonians Using Perturbation Theory with Bounded-Strength Interactions journal August 2008
Discrete nodal domain theorems journal October 2001
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation journal January 2008
Polynomial-Time Classical Simulation of Quantum Ferromagnets journal September 2017
Spectral-gap analysis for efficient tunneling in quantum adiabatic optimization journal September 2016
A note on the switching adiabatic theorem journal October 2012
Bounds for the adiabatic approximation with applications to quantum computation journal October 2007
Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems journal July 2016
Diffusion Monte Carlo approach versus adiabatic computation for local Hamiltonians journal February 2018
Adiabatic optimization versus diffusion Monte Carlo methods journal October 2016
Polynomial time algorithms for estimating spectra of adiabatic Hamiltonians journal September 2019
Tunneling through high energy barriers in simulated quantum annealing preprint January 2014
Graph isomorphisms in quasi-polynomial time preprint January 2017
How to Make the Quantum Adiabatic Algorithm Fail text January 2005

Similar Records

Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices
Journal Article · Mon Mar 15 00:00:00 EDT 2010 · Physical Review. A · OSTI ID:21408402

Simultaneous stoquasticity
Journal Article · Thu Jun 09 00:00:00 EDT 2022 · Physical Review A · OSTI ID:1973593

Studies in computational geometry motivated by mesh generation
Thesis/Dissertation · Sun Jan 01 00:00:00 EST 1989 · OSTI ID:5923035