The Complexity of Local Stoquastic Hamiltonians on 2D Lattices

We show the 2-Local Stoquastic Hamiltonian problem on a 2D square lattice is StoqMA-complete. We achieve this by extending the spatially sparse circuit construction of Oliveira and Terhal, as well as the perturbative gadgets of Bravyi, DiVincenzo, Oliveira, and Terhal. Our main contributions demonstrate StoqMA circuits can be made spatially sparse and that geometrical, stoquastic-preserving, perturbative gadgets can be constructed.