The Bose-Hubbard model is QMA-complete

Abstract

The Bose-Hubbard model is a system of interacting bosons that live on the vertices of a graph. The particles can move between adjacent vertices and experience a repulsive on-site interaction. The Hamiltonian is determined by a choice of graph that specifies the geometry in which the particles move and interact. We prove that approximating the ground energy of the Bose-Hubbard model on a graph at fixed particle number is QMA-complete. In our QMA-hardness proof, we encode the history of an n-qubit computation in the subspace with at most one particle per site (i.e., hard-core bosons). This feature, along with the well-known mapping between hard-core bosons and spin systems, lets us prove a related result for a class of 2-local Hamiltonians defined by graphs that generalizes the XY model. By avoiding the use of perturbation theory in our analysis, we circumvent the need to multiply terms in the Hamiltonian by large coefficients.

References in corpus (5)

• Universal computation by multi-particle quantum walk
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• The power of quantum systems on a line
• N-representability is QMA-complete
• A new construction for a QMA complete 3-local Hamiltonian

Cited by in corpus (11)

• Quantum Chemistry in the Age of Quantum Computing
• Adiabatic Quantum Simulation of Quantum Chemistry
• Exploiting locality in quantum computation for quantum chemistry
• Simple universal models capture all classical spin physics
• Quantum inverse iteration algorithm for programmable quantum simulators
• Towards quantum advantage via topological data analysis
• A method to efficiently simulate the thermodynamical properties of the Fermi-Hubbard model on a quantum computer
• Thermal Area Law for Lattice Bosons
• StoqMA vs. MA: the power of error reduction
• Finding the Dynamics of an Integrable Quantum Many-Body System via Machine Learning
• Approximating Ground and Excited State Energies on a Quantum Computer