The power of quantum systems on a line

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 373-383

  Aharonov, Dorit ^a   Gottesman, Daniel ^b   Irani, Sandy ^c   Kempe, Julia ^d  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; FOUNDATIONS; GROUND STATE; NUCLEAR PROPULSION; ONE DIMENSIONAL; QUANTUM COMPUTERS; QUANTUM ELECTRONICS; QUANTUM OPTICS; QUANTUM THEORY; SPIN GLASS;

(2+1)-DIMENSIONAL; ADIABATIC QUANTUM COMPUTATION (AQC); EXPONENTIAL TIME; GROUND-STATE ENERGIES; NEAREST NEIGHBOR (NN); ONE-DIMENSIONAL; ONE-DIMENSIONAL (1D) SYSTEM; QUANTUM PARTICLES; QUANTUM SYSTEMS; STRENGTH (IGC: D5/D6);

COMPUTER SYSTEMS;

EID: 46749142548     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389508     Document Type: Conference Paper

References (21)

1. D. Aharonov, D. Gottesman, and J. Kempe. The power of quantum systems on a line, 2007. arXiv:0705.4077 [quant-ph].
2. D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev. Adiabatic quantum computation is equivalent to standard quantum computation. In Proc. 45th FOCS, pages 42-51. IEEE, 2004.
3. F. Barahona. On the computational complexity of Ising spin glass models. Jour. of Phys. A: Math. and Gen., 15:3241-3253, 1982.
4. K. Binder and A. P. Young. Spin glasses: Experimental facts, theoretical concepts, and open questions. Rev. Mod. Phys., 58:801-976, 1986.
5. A. Childs, E. Farhi, and J. Preskill. Robustness of adiabatic quantum computation. Phys. Rev. A, 65:012322, 2002.
6. Percy Deift, Mary Beth Ruskai, and Wolfgang Spitzer. Improved gap estimates for simulating quantum circuits by adiabatic evolution. Quantum Information Processing, 6(2):121-125, 2007.
7. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. Quantum computation by adiabatic evolution, 2000. arXiv:quant-ph/0001106.
8. M. Hastings. An area law for one dimensional quantum systems, 2007. arXiv:0705.2024v2 [quant-ph].
9. M. Hastings and B. Terhal. personal communication.
10. M. Hastings and Xiao-Gang Wen. Quasi-adiabatic continuation of quantum states: The stability of topological ground state degeneracy and emergent gauge invariance. Phys. Rev. B, 72:045141, 2005. cond-mat/0503554.
11. S. Irani. The complexity of quantum systems on a one-dimensional chain, 2007. arXiv:0705.4067v1 [quant-ph].
12. Stephen P. Jordan, Edward Farhi, and Peter W. Shor. Error-correcting codes for adiabatic quantum computation. Phys. Rev. A, 74:052322, 2006.
13. J. Kempe, A. Kitaev, and O. Regev. The complexity of the Local Hamiltonian problem. SIAM Journal of Computing, 35(5):1070-1097, 2006.
14. A.Y. Kitaev, A.H. Shen, and M.N. Vyalyi. Classical and Quantum Computation. AMS, Providence, RI, 2002.
15. T. Osborne. Efficient approximation of the dynamics of one-dimensional quantum spin systems. Phys. Rev. Lett., 97:157202, 2006.
16. T. Osborne. Ground state of a class of noncritical one-dimensional quantum spin systems can be approximated efficiently. Phys. Rev. A, 75:042306, 2007.
17. R. Oliveira and B. Terhal. The complexity of quantum spin systems on a two-dimensional square lattice, 2005. quant-ph/0504050.
18. U. Schollwöck. The density-matrix renormalization group. Rev. Mod. Phys., 77:259-316, 2005.
19. D. J. Shepherd, T. Franz, and R. F. Werner. Universally programmable quantum cellular automaton. Phys. Rev. Lett., 97:020502, 2006.
20. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theor. Comput. Sci., 47(3):85-93, 1986.
21. J. Watrous. On one-dimensional quantum cellular automata. In Proc. 36th FOCS, pages 528-537, 1995.