Universal 2-local Hamiltonian Quantum Computing

M. A. Nielsen, I. L. Chuang, Quantum Information and Computation, Cambridge University Press, Cambridge, UK, 2000

2000

Earlier work this paper cites.

H. J. Briegel, R. Raussendorf, A One-Way Quantum Computer, Phys. Rev. Lett. 86, 5188 (2001)

2001

Earlier work this paper cites.

E. Farhi et al., A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem, Science 292, 472 (2001)

2001

Earlier work this paper cites.

Classical and quantum computation, volume 47 of Graduate Studies in Mathematics

A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi · 2002

Earlier work this paper cites.

A. Yu. Kitaev, Fault-tolerant quantum computation by anyons, Annals Phys. 303, pp.2-30 (2003),

2003

Earlier work this paper cites.

J. Kempe, A. Kitaev, O. Regev, The complexity of the local Hamiltonian problem, Proc. 24th FSTTCS, pp.372-383 (2004)

2004

Earlier work this paper cites.

R. Feynman, Quantum mechanical computers, Opt. News, vol. 11, pp. 11–46 (1985), D. de Falco, D. Tamascelli, Grover’s algorithm on a Feynman computer, J. Phys. A: Math. Gen. 37, 909-930 (2004)

2004

Earlier work this paper cites.

A. M. Childs, D. W. Leung, and M. A. Nielsen, Unified derivations of measurement-based schemes for quantum computation, Phys. Rev. A 71, 032318 (2005)

2005

Earlier work this paper cites.

D. Janzing and P. Wocjan, Ergodic quantum computing, Quantum Inf. Process. 4, 129 (2005)

2005

Cited alongside, same era.

The complexity of the local Hamiltonian problem

J. Kempe, A. Kitaev, and O. Regev · 2006

Cited alongside, same era.

S. Bravyi, Efficient algorithm for a quantum analogue of 2-SAT, quant-ph/0602108 (2006)

2006

Cited alongside, same era.

Adiabatic quantum computation is equivalent to standard quantum computation

D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev · 2007

Cited alongside, same era.

New construction for a QMA complete three-local Hamiltonian

D. Nagaj and S. Mozes · 2007

Cited alongside, same era.

D. Aharonov, D. Gottesman, S. Irani, J. Kempe, The power of quantum systems on a line, Proc. 48th IEEE FOCS, 373-383 (2007)

2007

D. Nagaj and P. Wocjan, Hamiltonian Quantum Cellular Automata in 1D, Phys. Rev. A 78, 032311 (2008), K. G. H. Vollbrecht and J. I. Cirac, Quantum Simulators, continuous-time automata, and translationally invariant system, Phys. Rev. Lett. 100, 010501 (2008), B. Chase, A. Landahl, Universal quantum walks and adiabatic algorithms by 1D Hamiltonians, arXiv:0802.1207 (2008), A. Kay, The Computational Power of Translationally Invariant Hamiltonians, Phys. Rev. A 78, 012346 (2008)

Original

2008

Later among the works it cites.

L. Eldar, O. Regev, Quantum SAT for a Qutrit-Cinquit Pair is QMA 1 -Complete, ICALP 2008, L. Aceto et al. (Eds), Part I, LNCS 5125, pp. 881-892, Springer-Verlag Berlin, Heidelberg (2008), L. Eldar, P. Love, D. Nagaj, O. Regev, in preparation

2008

Later among the works it cites.

The complexity of quantum spin systems on a two-dimensional square lattice

R. Oliveira and B. M. Terhal · 2008

Later among the works it cites.

A. Childs, Universal Computation by Quantum Walk, Phys. Rev. Lett. 102, 180501 (2009)

2009

Later among the works it cites.