Fetching the paper…
Reading the bibliography…
An algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems.
On the computational complexity of the Ising spin glass models
F. Barahona · 1982
Earlier work this paper cites.
Quantum mechanical computers
R. Feynman · 1982
Earlier work this paper cites.
Optimization by simulated annealing
S. Kirkpatrick et al · 1983
Earlier work this paper cites.
The complexity of boolean functions
I. Wegener · 1987
Earlier work this paper cites.
Quantum annealing of a disordered magnet
J. Brooke, D. Bitko, T.F. Rosenbaum, and G. Aeppli · 1999
Earlier work this paper cites.
Discrete mathematics and its applications
K. Rosen · 1999
Earlier work this paper cites.
Quantum adiabatic evolution algorithms with different paths
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser · 2000
Earlier work this paper cites.
Classical and quantum computation
A. Kitaev, A. Shen, and M. Vyalyi · 2002
Earlier work this paper cites.
Quantum computation by adiabatic evolution
E. Farhi, J. Goldstone, and S. Gutmann · 2002
Cited alongside, same era.
Pseudo-boolean optimization
E. Boros and P.L. Hammer · 2002
Cited alongside, same era.
3- local Hamiltonian
Julia Kempe and Oded Regev · 2003
Cited alongside, same era.
Demonstration of conditional gate operation using superconducting charge qubits
T. Yamamoto et al · 2003
Cited alongside, same era.
Coherent quantum dynamics of a superconducting flux qubit
I. Chiorescu, Y. Nakamura, C.J.P.M. Harmans, and J.E. Mooij · 2003
Cited alongside, same era.
Two slightly-entangled NP
Roman Orus · 2005
Cited alongside, same era.
The complexity of the local Hamiltonian
N-representability is QMA
Y. Liu, M. Christandl, and F. Verstraete · 2006
Later among the works it cites.
Adiabatic quantum computation is equivalent to standard quantum computation
D. Aharonov et al · 2007
Later among the works it cites.
A new construction for a QMA
D. Nagaj and S. Mozes · 2007
Later among the works it cites.
Realizable hamiltonians for universal adiabatic quantum computers
J.D. Biamonte and P.J. Love · 2007
Later among the works it cites.
The power of quantum systems on a line
D. Aharonov, D. Gottesman, and J. Kempe · 2007
Later among the works it cites.
The complexity of quantum systems on a one-dimensional chain
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. Kempe, A. Kitaev, and O. Regev · 2006
Cited alongside, same era.
The complexity of quantum spin systems on a two-dimensional square lattice
R. Oliveira and B. Terhal · 2006
Cited alongside, same era.
S. Irani · 2007
Later among the works it cites.
Sign and magnitude tunable coupler for superconducting flux qubits
R. Harris et al · 2007
Later among the works it cites.