Fetching the paper…
Reading the bibliography…
We consider the computational complexity of Hamiltonians which are sums of commuting terms acting on plaquettes in a square lattice of qubits, and we show that deciding whether the ground state minimizes the energy of each local term individually is in the complexity class NP.
F. Barahona, On the computational complexity of Ising spin glass models . J. Phys. A 15
1982
Earlier work this paper cites.
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and quantum computation , American Mathematical Society, Providence, Rhode Island, 2002
2002
Earlier work this paper cites.
D. Aharonov and T. Naveh, Quantum NP - A Survey . quant-ph/0210077 (2002)
2002
Earlier work this paper cites.
A. Kitaev, Fault-tolerant quantum computation by anyons . Ann. Phys. 303
2003
Earlier work this paper cites.
F. Verstraete and J. I. Cirac, Valence Bond Solids for Quantum Computation . Phys. Rev. A 70
2004
Earlier work this paper cites.
M. A. Levin and X.-G. Wen, String-net condensation: A physical mechanism for topological phases . Phys. Rev. B 71
2005
Cited alongside, same era.
S. Bravyi and M. Vyalyi, Commutative version of the k-local Hamiltonian problem and common eigenspace problem . Quant. Inf. Comput. 5
2005
Cited alongside, same era.
S. Bravyi, M. B. Hastings, and F. Verstraete, Lieb-Robinson bounds and the generation of correlations and topological quantum order . Phys. Rev. Lett. 97
2006
Cited alongside, same era.
N. Schuch, M. M. Wolf, F. Verstraete, and J. I. Cirac, The computational complexity of PEPS . Phys. Rev. Lett. 98
2007
Cited alongside, same era.
S. Bravyi, D. P. DiVincenzo, R. I. Oliveira, and B. M. Terhal, The Complexity of Stoquastic Local Hamiltonian Problems . Quant. Inf. Comput. 8
2008
Cited alongside, same era.
R. Oliveira and B. M. Terhal, The complexity of quantum spin systems on a two-dimensional square lattice . Quant. Inf. Comput. 8
2009
Later among the works it cites.
2009
Later among the works it cites.
S. Bravyi and B. Terhal, Complexity of stoquastic frustration-free Hamiltonians . SIAM J. Comput. 39
2009
Later among the works it cites.
2011
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…