Quantum adiabatic algorithms, small gaps, and different paths

Quantum Information and Computation

Volumn 11, Issue 3-4, 2011, Pages 181-214

  Farhi, Edward ^a   Goldstone, Jeffrey ^a   Gosset, David ^a   Gutmann, Sam ^a,b   Meyer, Harvey B ^a,b   Shor, Peter ^a,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b CERN   (Switzerland)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXCITED STATES; GROUND STATE; MONTE CARLO METHODS; QUANTUM THEORY;

ADIABATIC PATHS; EXPONENTIAL NUMBERS; MONTE CARLO ALGORITHMS; QUANTUM ADIABATIC ALGORITHM; QUANTUM MONTE CARLO; RANDOM INSTANCE; RANDOM PATHS; SIMPLE++; SMALL GAPS; TIME QUANTUM;

HAMILTONIANS;

EID: 78651398885     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic11.3-4-1     Document Type: Article

References (22)

1. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum Computation by Adiabatic Evolution, arXiv:quant-ph/0001106, (2000).
2. 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, pp472-475, arXiv:quant-ph/0104129, (2001).
3. A. P. Young, S. Knysh, and V. N. Smelyanskiy, Size dependence of the minimum excitation gap in the Quantum Adiabatic Algorithm, Physical Review Letters, 101, p170503, arXiv:0803.3971, (2008).
4. T. Hogg, Adiabatic Quantum Computing for Random Satisfiability Problems, Physical Review A, 67, p022314, arXiv:quant-ph/0206059, (2003).
5. A.P Young, Private Communication, (2009).
6. W. van Dam, M. Mosca, and U. Vazirani, How Powerful is Adiabatic Quantum Computation?, arXiv:quant-ph/0206003, (2002).
7. W. van Dam and U. Vazirani, Limits on Quantum Adiabatic Optimization (unpublished manuscript).
8. E. Farhi, J. Goldstone, and S. Gutmann, Quantum Adiabatic Evolution Algorithms with Different Paths, arXiv:quant-ph/0208135, (2002).
9. D. Fisher, Private Communication based on references [10] and [11].
10. D. Fisher, Critical behavior of random transverse-field Ising spin chains, Phys. Rev. B, 51(10), pp6411-6461, (1995).
11. D. Fisher and A.P. Young, Distributions of gaps and end-to-end correlations in random transversefield Ising spin chains, Phys. Rev. B, 58(14), pp9131-9141, (1998).
12. B.W. Reichardt, The quantum adiabatic optimization algorithm and local minima, STOC'04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pp502-510, (ACM, 2004).
13. M. Znidaric and M. Horvat, Exponential complexity of an adiabatic algorithm for an NP-complete problem, Physical Review A, 73, p022329, arXiv:quant-ph/0509162, (2006).
14. E. Farhi, J. Goldstone, S. Gutmann, and D. Nagaj, How to Make the Quantum Adiabatic Algorithm Fail, International Journal of Quantum Information, 6, p503, arXiv:quant-ph/0512159, (2008).
15. M. H. S. Amin and V. Choi, First Order Quantum Phase Transition in Adiabatic Quantum Computation, arXiv:0904.1387, (2009).
16. Y. Fan, Adiabatic Quantum Algorithms for Boolean Satisfiability, (RSI summer project at MIT), (2009).
17. B. Altshuler, H. Krovi, and J. Roland, Adiabatic quantum optimization fails for random instances of NP-complete problems, arXiv:0908.2782, (2009).
18. Y. Matsuda, H. Nishimori, and H. G. Katzgraber, Ground-state statistics from annealing algorithms: Quantum vs classical approaches, New Journal of Physics, 11, p073021, arXiv:0808.0365, (2009).
19. F. Krzakala, A. Rosso, G. Semerjian, and F. Zamponi, On the path integral representation for quantum spin models and its application to the quantum cavity method and to Monte Carlo simulations, Physical Review B, 78, p134428, arXiv:0807.2553, (2008).
20. L. D. Landau and E. M. Lifshitz, Quantum Mechanics: Non-relativistic theory, Volume 3 in the series Course of Theoretical Physics, (Pergamon Press, 1989, c1977).
21. N. V. Prokof'ev, B. V. Svistunov, and I. S. Tupitsyn, Exact Quantum Monte Carlo Process for the Statistics of Discrete Systems, ZH.EKS.TEOR.FIZ., 64, p853, arXiv:cond-mat/9612091, (1996).
22. S. Knysh, and V. Smelyanskiy, On the relevance of avoided crossings away from quantum critical point to the complexity of quantum adiabatic algorithm, arXiv:1005.3011, (2010).