Adiabatic quantum computation is equivalent to standard quantum computation

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

Volumn , Issue , 2004, Pages 42-51

  Aharonov, Dorit ^a,g   Van Dam, Wim ^b   Kempe, Julia ^c,g   Landau, Zeph ^d   Lloyd, Seth ^e   Regev, Oded ^f  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c CNRS   (France)

^d CITY COLLEGE OF NEW YORK   (United States)

^e Massachusetts Institute of Technology Cambridge   (United States)

^f TEL AVIV UNIVERSITY   (Israel)

^g UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADIABATIC QUANTUM COMPUTATION; ADIABATIC SIMULATION; COMPUTATIONAL MODELS; QUANTUM CIRCUITS;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; HAMILTONIANS; OPTIMIZATION; STANDARDS;

QUANTUM THEORY;

EID: 17744390031     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. D. Aharonov and A. Ta-Shma. Adiabatic quantum state generation and statistical zero-knowledge. In Proc. 35th STOC, pages 20-29, 2003.
2. R. Bhatia. Matrix Analysis. Number 169 in Graduate Texts in Mathematics. Springer-Verlag, New York, 1997.
3. A. Childs, E. Farhi, and J. Preskill. Robustness of adiabatic quantum computation. Phys. Rev. A, 65:012322, 2002.
4. W. van Dam, M. Mosca, and U. Vazirani. How powerful is adiabatic quantum computation? In Proc. 42nd FOCS, pages 279-287, 2001.
5. W. van Dam and U. Vazirani. More on the power of adiabatic computation. Unpublished, 2001.
6. E. Farhi, J. Goldstone, and S. Gutmann. Quantum adiabatic evolution algorithms versus simulated annealing. Technical report, lanl-arXive quant-ph/0201031, 2002.
7. E. Farhi, J. Goldstone, and S. Gutmann. Quantum adiabatic evolution algorithms with different paths. Technical report, lanl-arXive quant-ph/0208135, 2002.
8. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda. A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem. Science, 292(5516):472-476, 2001.
9. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser. Quantum computation by adiabatic evolution. Technical report, lanl-arXive quant-ph/0001106, 2000.
10. J. Friedman. Expanding Graphs. Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1993.
11. L. Grover. Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Letters, 79:325, 1997.
12. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985.
13. J. A. Jones, V. Vedral, A. Ekert, and G. Castagnoli. Geometric quantum computation with NMR. Nature, 403:869-871, 2000.
14. T. Kato. On the adiabatic theorem of quantum mechanics. J. Phys. Soc. Jap., 5:435-439, 1951.
15. J. Kempe and O. Regev. 3-local Hamiltonian is QMA-complete. Quantum Inf. Comput., 3(3):258-264, 2003.
16. A. Kitaev, A. Shen, and M. Vyalyi. Classical and Quantum Computation. Number 47 in Graduate Series in Mathematics. AMS, Providence, RI, 2002.
17. A. Y. Kitaev. Fault-tolerant quantum computation by anyons. Ann. Physics, 303(1):2-30, 2003.
18. L. Lovász. Random walks on graphs: a survey. In Combinatorics, Paul Erdo″s is eighty, Vol. 2 (Keszthely, 1993), volume 2 of Bolyai Soc. Math. Stud., pages 353-397. János Bolyai Math. Soc., Budapest, 1996.
19. A. Messiah. Quantum Mechanics. John Wiley & Sons, New York, 1958.
20. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, UK, 2000.
21. J. Pachos and P. Zanardi. Quantum holonomies for quantum computing. Int.J.Mod.Phys. B, 15:1257-1286, 2001.
22. C. Papadimitriou. Computational Complexity. Addison Wesley, Reading, Massachusetts, 1994.
23. B. Reichardt. The quantum adiabatic optimization algorithm and local minima. In Proc. 36th STOC, pages 502-510, 2004.
24. J. Roland and N. Cerf. Quantum search by local adiabatic evolution. Phys. Rev. A, 65:042308, 2002.
25. G. Santoro, R. Martonak, E. Tosatti, and R. Car. Theory of quantum annealing of an Ising spin glass. Science, 295:2427-30, 2002.
26. A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing Markov chains (extended abstract). In Graph-theoretic concepts in computer science (Staffelstein, 1987), volume 314 of Lecture Notes in Comput. Sci., pages 134-148. Springer, Berlin, 1988.
27. W. Spitzer and S. Starr. Improved bounds on the spectral gap above frustration-free ground states of quantum spin chains. Lett. Math. Phys., 63(2): 165-177, 2003.