How to make the quantum adiabatic algorithm fail

International Journal of Quantum Information

Volumn 6, Issue 3, 2008, Pages 503-516

  Farthi, Edward ^a   Goldstone, Jeffrey ^a   Gutmann, Sam ^b   Nagaj, Daniel ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NORTHEASTERN UNIVERSITY   (United States)

Author keywords

Adiabatic; Bounds; Quantum

Indexed keywords

COST FUNCTIONS; QUANTUM THEORY;

ADIABATIC; BOUNDS; NONLOCAL; QUANTUM; QUANTUM ADIABATIC ALGORITHM; QUANTUM ALGORITHMS; RUNTIMES; WASH OUT;

HAMILTONIANS;

EID: 45849100859     PISSN: 02197499     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021974990800358X     Document Type: Article

References (6)

1. E. Farhi, J. Goldstone, S. Gutmann and M. Sipser, Quantum computation by Adiabatic evolution, quant-ph/0001106 (2000).
2. E. Farhi and S. Gutmann, Analog analogue of a digital quantum computation, Phys. Rev. A 57 (1998) 2403.
3. C. H. Bennett, E. Bernstein, G. Brassard and U. V. Vazirani, Strengths and weaknesses of quantum computing, SIAM J. Comput. 26 (1997) 1510-1523.
4. M. Žnidarič and M. Horvat, Exponential complexity of an Adiabatic algorithm for an NP-complete problem, Phys. Rev. A 73 (2006) 022329.
5. Z. Wei and M. Ying, Quantum adiabatic evolutions that can't be used to design efficient algorithms, quant-ph/0604077 (2006).
6. L. Ioannou and M. Mosca, Limitations of some simple adiabatic quantum algorithms, quant-ph/0702241 (2007).