The power of quantum systems on a line

Communications in Mathematical Physics

Volumn 287, Issue 1, 2009, Pages 41-65

  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 Irvine   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 60449087232     PISSN: 00103616     EISSN: 14320916     Source Type: Journal    
DOI: 10.1007/s00220-008-0710-3     Document Type: Article

References (35)

1. B. Apolloni C. Carvalho D. de Falco 1988 Quantum stochastic optimization Stochastic Processes and their Applications 33 5 233 244
2. Apolloni, B., Cesa-Bianchi, N., de Falco, D.: A numerical implementation of "quantum annealing". In: Stochastic Processes, Physics and Geometry: Proceedings of the Ascona-Locarno Conference. River Edge, NJ: World Scientific. 1990, pp. 97-111
3. th Ann. IEEE, Symp on Foundations of Computer Science, Los Alamitos, CA: IEEE Comp. Soc., 2007, pp. 373-383
4. Aharonov, D., Gottesman, D., Kempe, J.: The power of quantum systems on a line. http://arXiv.org/abs/0705.4077v2 [quant-ph], 2007
5. Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. In: Proc. 45th FOCS, Los Alamitos, CA: IEEE Comp. Soc., 2004, pp. 42-51
6. F. Barahona 1982 On the computational complexity of Ising spin glass models J. Phys. A: Math. Gen. 15 3241 3253
7. K. Binder A.P. Young 1986 Spin glasses: Experimental facts, theoretical concepts, and open questions Rev. Mod. Phys. 58 801 976
8. A. Childs E. Farhi J. Preskill 2002 Robustness of adiabatic quantum computation Phys. Rev. A 65 012322
9. P. Deift M.B. Ruskai W. Spitzer 2007 Improved gap estimates for simulating quantum circuits by adiabatic evolution Quant Infor. Proc. 6 2 121 125
10. R. Feynman 1985 Quantum mechanical computers Optics News 11 11 21
11. E. Farhi J. Goldstone S. Gutmann J. Lapan A. Lundgren D. Preda 2001 A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem Science 292 5516 472 476
12. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. http://arXiv.org/list/quant-ph/0001106, 2000
13. D.S. Fisher 1995 Critical behavior of random transverse-field Ising spin chains Phys. Rev. B 51 10 6411 6461
14. Hastings, M.: Personal communication
15. Hastings, M.: An area law for one dimensional quantum systems. JSTAT. P08024 (2007)
16. Hastings, M., Terhal, B.: Personal communication
17. Irani, S.: The complexity of quantum systems on a one-dimensional chain. http://arXiv.org/abs/0705.4067v2[quant-ph], 2007
18. S.P. Jordan E. Farhi P.W. Shor 2006 Error-correcting codes for adiabatic quantum computation Phys. Rev. A 74 052322
19. Janzing, D., Wocjan, P., Zhang, S.: A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation. http://arXiv.org/abs/0710.1615v2[quant-ph], 2007
20. A. Kay 2008 The computational power of symmetric hamiltonians Phys. Rev. A. 78 012346
21. J. Kempe A. Kitaev O. Regev 2006 The complexity of the Local Hamiltonian problem SIAM J. Comp. 35 5 1070 1097
22. Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Providence, RI: Amer. Math. Soc., 2002
23. Nagaj, D.: Local Hamiltonians in Quantum Computation. PhD thesis, MIT. http://arXiv.org/abs/0808.2117v1[quant-ph], 2008
24. D. Nagaj P. Wocjan 2008 Hamiltonian quantum cellular automata in 1d Phys. Rev. A 78 032311
25. T. Osborne 2006 Efficient approximation of the dynamics of one-dimensional quantum spin systems Phys. Rev. Lett. 97 157202
26. T. Osborne 2007 Ground state of a class of noncritical one-dimensional quantum spin systems can be approximated efficiently Phys. Rev. A 75 042306
27. R. Oliveira B. Terhal 2008 The complexity of quantum spin systems on a two-dimensional square lattice Quant. Inf. Comp. 8 10 0900 0924
28. U. Schollwöck 2005 The density-matrix renormalization group Rev. Mod. Phys. 77 259 316
29. D.J. Shepherd T. Franz R.F. Werner 2006 Universally programmable quantum cellular automaton Phys. Rev. Lett. 97 020502
30. M. Suzuki 1976 Relationship between d-dimensional quantal spin systems and (d+1)-dimensional ising systems Prog. Theor. Phys. 56 5 1454 1469
31. van Emde Boas, P.: Handbook of Theoretical Computer Science. volume A, Chapter 1. Cambridge, MA: MIT Press, 1990, pp. 1-66
32. L.G. Valiant V.V. Vazirani 1986 NP is as easy as detecting unique solutions Theor. Comput. Sci. 47 3 85 93
33. Watrous, J.: On one-dimensional quantum cellular automata. In: Proc. 36th Annual IEEE Symp. on Foundations of Computer Science (FOCS), Los Alamitos, CA: IEEE Comp. Sci, 1995, pp. 528-537
34. S.R. White 1992 Density matrix formulation for quantum renormalization groups Phys. Rev. Lett. 69 2863
35. S.R. White 1993 Density-matrix algorithms for quantum renormalization groups Phys. Rev. B 48 10345