Limitations of some simple adiabatic quantum agorithms

International Journal of Quantum Information

Volumn 6, Issue 3, 2008, Pages 419-426

  Ioannou, Lawrence M ^a   Mosca, Michelle ^b,c  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF WATERLOO   (Canada)

^c PERIMETER INSTITUTE FOR THEORETICAL PHYSICS   (Canada)

Author keywords

Adiabatic; Bounds; Quantum

Indexed keywords

QUANTUM THEORY;

ADIABATIC; BOUNDS; EIGENSPACES; OPTIMALITY PROOF; QUANTUM; QUANTUM ALGORITHMS; RUNNING TIME; SEARCH ALGORITHMS;

HAMILTONIANS;

EID: 45849120176     PISSN: 02197499     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219749908003724     Document Type: Article

References (17)

1. E. Farhi, J. Goldstone, S. Gutmann and M. Sipser, Quantum computation by Adiabatic evolution, http://subsubsection.lanl.gov/abs/quant-ph/0001106 (2000).
2. A. Messiah, Quantum Mechanics, Vol. 2 (Wiley, New York, 1976).
3. W. van Dam and U. Vazirani, Presented at QIP 2002, Yorktown Heights, NY (2002).
4. E. Farhi, J. Goldstone and S. Gutmann, A numerical study of the performance of a quantum Adiabatic evolution algorithm for satisfiability, quant-ph/0007071 (2000).
5. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren and D. Prada, A quantum Adiabatic evolution algorithm applied to random instances of an NP-complete problem, Science 292 (2001) 472.
6. E. Farhi, J. Goldstone and S. Gutmann, Quantum Adiabatic evolution algorithms with different paths, MIT Report No. MIT-CTP-3297 [quant-ph/ 0208135], (2002).
7. T. Hogg, Adiabatic quantum computing for random satisfiability problems, Phys. Rev. A 67 (2003) 022314.
8. D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd and O. Regev, in Proc. 45th Ann. IEEE Symp. Foundations of Computer Science (FOCS'04 San Diego, CA, 9-11 June (IEEE Computer Society, Washington DC, 2004), pp. 42-51.
9. E. Farhi, J. Goldstone, S. Gutmann and D. Nagaj, How to make the quantum Adiabatic algorithm fail, quant-ph/0512159.
10. Z. Wei and M. Ying, Quantum adiabatic evolutions that can't be used to design efficient algorithms, quant-ph/0604077 (2006).
11. M. Znidaric and M. Horvat, Exponential complexity of an adiabatic algorithm for an NP-complete problem, Phys. Rev. A. 73 (2006) 022329.
12. W. van Dam, M. Mosca and U. Vazirani, How powerful is adiabatic quantum computation?, in Proc. 42nd Ann. Symp. Foundations of Computer Science (FOCS'01), Las Vegas, USA (2001), pp. 279-287.
13. J. Roland and N. Cerf, Quantum search by local adiabatic evolution, Phys. Rev. A 65 (2002) 042308.
14. J. Roland and N. Cerf, Computers, Phys. Rev. A 60(3) (1999) 1956-1965.
15. E. Farhi and S. Gutmann, An analog analogue of a digital quantum computation, Phys. Rev. A 57 (1998) 2403.
16. M. R. Garey and D. S. Johnson, Computers and Intractability (A Guide to the Theory of NP-Completeness) (W.H. Freeman and Company, New York, 1979).
17. L. M. Ioannou, Continuous-time quantum algorithms: Searching and adiabatic computation, Master's thesis, University of Waterloo, http://etheses.uwaterloo.ca (2002).