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 vertical bar V vertical bar = 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 vertical bar V vertical bar 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.

}, issn = {0031-9007}, doi = {10.1103/PhysRevLett.125.170504}, author = {Bringewatt, Jacob and Jarret, Michael} } @article { ISI:000488249400003, title = {Polynomial time algorithms for estimating spectra of adiabatic Hamiltonians}, journal = {Phys. Rev. A}, volume = {100}, number = {3}, year = {2019}, month = {SEP 30}, pages = {032336}, publisher = {AMER PHYSICAL SOC}, type = {Article}, abstract = {Much research regarding quantum adiabatic optimization has focused on stoquastic Hamiltonians with Hamming-symmetric potentials, such as the well-studied {\textquoteleft}{\textquoteleft}spike{{\textquoteright}{\textquoteright}} example. Due to the large amount of symmetry in these potentials such problems are readily open to analysis both analytically and computationally. However, more realistic potentials do not have such a high degree of symmetry and may have many local minima Here we present a somewhat more realistic class of problems consisting of many individually Hamming-symmetric potential wells. For two or three such wells we demonstrate that such a problem can be solved exactly in time polynomial in the number of qubits and wells. For greater than three wells, we present a tight-binding approach with which to efficiently analyze the performance of such Hamiltonians in an adiabatic computation. We provide several basic examples designed to highlight the usefulness of this toy model and to give insight into using the tight-binding approach to examining it, including (1) an adiabatic unstructured search with a transverse field driver and a prior guess to the marked item and (2) a scheme for adiabatically simulating the ground states of small collections of strongly interacting spins, with an explicit demonstration for an Ising-model Hamiltonian.}, issn = {2469-9926}, doi = {10.1103/PhysRevA.100.032336}, author = {Bringewatt, Jacob and Dorland, William and Jordan, Stephen P.} }