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

Quantum Information and Computation

Volumn 8, Issue 10, 2008, Pages 0900-0924

  Oliveira, Roberto ^a   Terhal, Barbara M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYSTAL LATTICES; HAMILTONIANS; PERTURBATION TECHNIQUES; QUBITS;

ADIABATIC COMPUTATION; CIRCUIT MODELING; LOCAL INTERACTIONS; PERTURBATION METHOD; QUANTUM SPIN SYSTEMS; SQUARE LATTICES; TWO DIMENSIONAL (2 D); TWO DIMENSIONAL SQUARE LATTICE;

SPIN FLUCTUATIONS;

EID: 55049139520     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. J. Kempe, A. Kitaev, and O. Regev. The Complexity of the Local Hamiltonian Problem, SIAM Journal of Computing, 35(5): 1070-1097, 2006. Earlier version in Proc. of 24th FSTTCS.
2. A. Yu. Kitaev, A.H. Shen, and M.N. Vyalyi. Classical and Quantum Computation. Vol. 47 of Graduate Studies in Mathematics., American Mathematical Society, Providence, RI, 2002.
3. D. Aharonov and T. Naveh. Quantum NP-A Survey, 2002, http://arxiv.org/ abs/quant-ph/0210077.
4. J. Kempe and O. Regev. 3-Local Hamiltonian is QMA-complete, Quantum Information and Computation, 3(3): 258-264, 2003, http://arxiv.org/abs/quant-ph/ 0302079.
5. D. Aharonov, W. van Dam, Z. Landau, S. Lloyd, J. Kempe, and O. Regev. Universality of Adiabatic Quantum Computation, SIAM Journal of Computing, 37(1):166-194, 2007. Prelim. version in Proceedings of 45th FOCS, 2004, http://arxiv.org/abs/quant-ph/0405098.
6. A. Ambainis and O. Regev. An elementary proof of the quantum adiabatic theorem, quantph/0411152, 2004.
7. D. Janzing, P. Wocjan, and T. Beth. Identity Check is QMA-complete, 1996, http://arxiv.org/abs/quant-ph/9610012.
8. B. Nachtergaele. Quantum Spin Systems, In J.-P. Fraņ coise, G. Naber, and S.T. Tsou (Eds.), Encyclopedia of Mathematical Physics (Elsevier), pp. 295-301, 2006, http://arxiv.org/abs/math-ph/0409006.
9. M. Plischke and B. Bergersen. Equilibrium Statistical Physics, World Scientific, Singapore, 1994.
10. C. H. Papadimitriou. Computational Complexity, Addison-Wesley, 1994.
11. F. Barahona. On the computational complexity of Ising spin glass models, Jour. of Phys. A: Math. and Gen., 15:3241-3253, 1982.
12. H.A. Kramers. L' interaction entre les atomes magn'etog̀enes dans un cristal paramagn'etique, Physica, 1:182, 1934.
13. D. Aharonov, D. Gottesman, S. Irani, and J. Kempe. The power of quantum systems on a line, In Proceedings of 48th FOCS, pp. 373-383, 2007, http://arxiv.org/abs/0705.4077 and http://arxiv.org/abs/0705.4067.
14. R. Raussendorf and H. Briegel. A one-way quantum computer, Phys. Rev. Lett., 86:5188-5191, 2001, http://arxiv.org/abs/quant-ph/0010033.
15. A. Kitaev. Fault-tolerant quantum computation by anyons, http://arxiv.org/abs/quant-ph/9707021.
16. M.A. Nielsen. Cluster-state quantum computation, 2005, http://arxiv.org/abs/quant-ph/0504097.
17. C. Marriott and J. Watrous. Quantum Arthur-Merlin games, Computational Complexity, 14(2):122-152, 2005.