Fetching the paper…
Reading the bibliography…
The calculation of ground-state energies of physical systems can be formalised as the k-local Hamiltonian problem, which is the natural quantum analogue of classical constraint satisfaction problems.
Ordering energy levels of interacting spin systems
E. Lieb and D. Mattis · 1962
Earlier work this paper cites.
On next-nearest-neighbor interaction in linear chain. I
C. Majumdar and D. Ghosh · 1969
Earlier work this paper cites.
On the structure of polynomial time reducibility
R. Ladner · 1975
Earlier work this paper cites.
The complexity of satisfiability problems
T. Schaefer · 1978
Earlier work this paper cites.
On the computational complexity of Ising spin glass models
F. Barahona · 1982
Earlier work this paper cites.
Exact ground states for a class of antiferromagnetic Heisenberg models with short-range interactions
D. Klein · 1982
Earlier work this paper cites.
Exact Jastrow-Gutzwiller resonating-valence-bond ground state of the spin-1/2 antiferromagnetic Heisenberg chain with 1 / r 2 1/r^{2} exchange
F. Haldane · 1988
Earlier work this paper cites.
Exact solution of an S=1/2 Heisenberg antiferromagnetic chain with long-ranged interactions
B. Sriram Shastry · 1988
Earlier work this paper cites.
Normal forms for skew-symmetric matrices and Hamiltonian systems with first integrals linear in momenta
G. Thompson · 1988
Earlier work this paper cites.
The spin-1/2 Heisenberg star with frustration: numerical versus exact results
J. Richter and A. Voigt · 1994
Earlier work this paper cites.
A dichotomy theorem for maximum generalized satisfiability problems
N. Creignou · 1995
Earlier work this paper cites.
Information-theoretic aspects of inseparability of mixed states
R. Horodecki and M. Horodecki · 1996
Earlier work this paper cites.
An Introduction to Quantum Theory
K. Hannabuss · 1997
Earlier work this paper cites.
A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction
S. Khanna, M. Sudan, and D. Williamson · 1997
Earlier work this paper cites.
Quantum Mechanics: a Modern Development
L. Ballentine · 1998
Earlier work this paper cites.
Universal quantum computation with the exchange interaction
D. DiVincenzo, D. Bacon, J. Kempe, G. Burkard, and K. B. Whaley · 2000
Earlier work this paper cites.
Quantum computation by adiabatic evolution
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 2000
Earlier work this paper cites.
Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights
P. Jonsson · 2000
Earlier work this paper cites.
Theory of decoherence-free fault-tolerant universal quantum computation
J. Kempe, D. Bacon, D. Lidar, and K. B. Whaley · 2000
Earlier work this paper cites.
Complexity Classifications of Boolean Constraint Satisfaction Problems
N. Creignou, S. Khanna, and M. Sudan · 2001
Earlier work this paper cites.
Entanglement capabilities of non-local Hamiltonians
W. Dür, G. Vidal, J. Cirac, N. Linden, and S. Popescu · 2001
Earlier work this paper cites.
Encoded universality from a single physical interaction
J. Kempe, D. Bacon, D. DiVincenzo, and K.B. Whaley · 2001
Cited alongside, same era.
Optimal simulation of two-qubit Hamiltonians using general local operations
C. Bennett, J. Cirac, M. Leifer, D. Leung, N. Linden, S. Popescu, and G. Vidal · 2002
Cited alongside, same era.
A dichotomy theorem for constraints on a three-element set
A. Bulatov · 2002
Cited alongside, same era.
Exact gate-sequences for universal quantum computation using the XY-interaction alone
J. Kempe and K. B. Whaley · 2002
Cited alongside, same era.
Classical and Quantum Computation
A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002
Cited alongside, same era.
An explicit universal gate-set for exchange-only quantum computation
M. Hsieh, J. Kempe, S. Myrgren, and K. B. Whaley · 2003
Cited alongside, same era.
Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices
S. Jordan, D. Gosset, and P. Love · 2010
Later among the works it cites.
Interacting boson problems can be QMA Hard
T.-C. Wei, M. Mosca, and A. Nayak · 2010
Later among the works it cites.
D. Aharonov and L. Eldar · 2011
Later among the works it cites.
Efficient algorithm for a quantum analogue of 2-SAT
S. Bravyi · 2011
Later among the works it cites.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
M. Bremner, R. Jozsa, and D. Shepherd · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Commutative version of the k-local Hamiltonian problem and common eigenspace problem
S. Bravyi and M. Vyalyi · 2005
Cited alongside, same era.
An intrinsic limit to quantum coherence due to spontaneous symmetry breaking
J. van Wezel, J. van den Brink, and J. Zaanen · 2005
Cited alongside, same era.
Merlin-Arthur games and stoquastic complexity, 2006
S. Bravyi, A. Bessen, and B. Terhal · 2006
Cited alongside, same era.
The complexity of the local Hamiltonian problem
J. Kempe, A. Kitaev, and O. Regev · 2006
Cited alongside, same era.
XXX spin chain: from Bethe solution to open problems, 2007
V. Korepin and O. Patu · 2007
Cited alongside, same era.
Quantum computational complexity of the N-Representability Problem: QMA Complete
Y.-K. Liu, M. Christandl, and F. Verstraete · 2007
Cited alongside, same era.
Later among the works it cites.
Characterization of universal two-qubit Hamiltonians
A. Childs, D. Leung, L. Mancinska, and M. Ozols · 2011
Later among the works it cites.
Topological order at nonzero temperature
M. Hastings · 2011
Later among the works it cites.
Quantum annealing with manufactured spins
M. Johnson, M. Amin, S. Gildert, T. Lanting, F. Hamze, N. Dickson, R. Harris, A. Berkley, J. Johansson, P. Bunyk, E. Chapple, C. Enderud, J. Hilton, K. Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. Thom, E. Tolkacheva, C. Truncik, S. Uchaikin, J. Wang, B. Wilson, and G. Rose · 2011
Later among the works it cites.
Modern Quantum Mechanics
J. Sakurai and J. Napolitano · 2011
Later among the works it cites.
Complexity of commuting Hamiltonians on a square lattice of qubits
N. Schuch · 2011
Later among the works it cites.
The k k -local Pauli Commuting Hamiltonians problem is in P, 2012
J. Yan and D. Bacon · 2012
Later among the works it cites.
Quantum 3-SAT is QMA 1 -complete
D. Gosset and D. Nagaj · 2013
Closest in time.
A. Bookatz · 2014
Closest in time.
Monte Carlo simulation of stoquastic Hamiltonians, 2014
S. Bravyi · 2014
Closest in time.
On complexity of the quantum Ising model, 2014
S. Bravyi and M. Hastings · 2014
Closest in time.
Perturbative gadgets without strong interactions, 2014
Y. Cao and D. Nagaj · 2014
Closest in time.
The Bose-Hubbard model is QMA-complete
A. Childs, D. Gosset, and Z. Webb · 2014
Closest in time.
Simple universal models capture all spin physics, 2014
G. de las Cuevas and T. Cubitt · 2014
Closest in time.
Complexity of the XY antiferromagnet at fixed magnetization, 2015
A. Childs, D. Gosset, and Z. Webb · 2015
Closest in time.
The complexity of antiferromagnetic interactions and 2D lattices, 2015
S. Piddock and A. Montanaro · 2015
Closest in time.