Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems

Quantum Information and Computation

Volumn 11, Issue 7-8, 2011, Pages 638-648

  Choi, Vicky ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

3SAT; Adiabatic quantum algorithms; Adiabatic quantum optimization; Exact cover; Maximum independent set; NP complete

Indexed keywords

NP-HARD; POLYNOMIALS; QUANTUM COMPUTERS; QUANTUM THEORY;

3SAT; EXACT COVERS; MAXIMUM INDEPENDENT SETS; NP COMPLETE; QUANTUM ALGORITHMS; QUANTUM OPTIMIZATION;

OPTIMIZATION;

EID: 79959302399     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. P.W. Shor (1994;1997), Algorithms for quantum computation: discrete logs and factoring, Proc. 35th FOCS; SIAM J. Comp., 26, 1484-1509.
2. M. R. Garey and D. S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman.
3. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser (2000), Quantum computation by adiabatic evolution, arXiv:quant-ph/0001106.
4. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda (2001), A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem, Science, 292(5516):472-476.
5. G.E. Santoro and E. Tosatti (2006), Optimization using quantum mechanics: quantum annealing through adiabatic evolution, J. Phys. A: Math. Gen., 39, 393-431.
6. G.E. Santoro and E. Tosatti (2008), Corrigendum: Optimization using quantum mechanics: quantum annealing through adiabatic evolution, J. Phys. A: Math. Theor., 41.
7. D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev (2004;2007), Adiabatic quantum computation is equivalent to standard quantum computation, Proc. 45th FOCS; SIAM Journal of Computing, Vol. 37, Issue 1, p. 166-194.
8. A. Mizel, D.A. Lidar, and M. Mitchell (2007), Simple Proof of Equivalence Between Adiabatic Quantum Computation and the Circuit Model, Phys. Rev. Lett., 99, 070502.
9. B. Altshuler, H. Krovi and J. Roland (2010), Anderson localization makes adiabatic quantum optimization fail, Proc Natl Acad Sci USA, 107(28): 12446-12450.
10. W. van Dam and U. Vazirani (2001), Limits on quantum adiabatic optimization, Available at http://www.cs.berkeley.edu/_vazirani/pubs/qao.ps.
11. W. van Dam, M. Mosca, and U. Vazirani (2001), How powerful is adiabatic quantum computation?, Proc. 42nd FOCS, 279-287.
12. B.W. Reichardt (2004), The quantum adiabatic optimization algorithm and local minima, Proc. 35th STOC, 502-510.
13. S. Dasgupta, C. Papadimitriou, U. Vazirani (2008), Algorihtms, McGraw Hill.
14. V. Choi (2010), Avoid first order quantum phase transition by changing problem hamiltonians, ArXiv:quant-ph/1010.1220.
15. V. Choi (2008), Minor-embedding in adiabatic quantum computation: I. The parameter setting problem, Quantum Inf. Processing, 7, 193-209.
16. A. P. Young and S. Knysh and V. N. Smelyanskiy (2009), First order phase transition in the quantum adiabatic algorithm, Phys. Rev. Lett., 104, 020502.
17. V. Choi (2011), Difierent adiabatic quantum optimization algorithms for the NP-complete exact cover problem, Proc Natl Acad Sci USA, 108(7): E19-E20.
18. E. Farhi, J. Goldstone and S. Gutmann (2002), Quantum adiabatic evolution algorithms with difierent paths, arXiv.org:quant-ph/0208135.
19. M.H.S. Amin, V. Choi (2009), First order phase transition in adiabatic quantum computation, Phys. Rev. A, 80, 062326.
20. T. Jorg, F. Krzakala, J. Kurchan and A. C. Maggs (2008), Simple glass models and their quantum annealing, Phys. Rev. Lett., 101, 147204.
21. T. Jorg, F. Krzakala, G. Semerjian and F. Zamponi (2010), First-order transitions and the performance of quantum algorithms in random optimization problems, Phys. Rev. Lett., 104, 207206.
22. Marko Znidaric and Martin Horvat (2006), Exponential complexity of an adiabatic algorithm for an NP-complete problem, Phys. Rev. A, 73, 022329.
23. E. Farhi, J. Goldstone, S. Gutmann, and D. Nagaj (2005), How to make the quantum adiabatic algorithm fail, International Journal of Quantum Information, 6(3):503-516.
24. E. Farhi, J. Goldstone, D. Gosset, S. Gutmann, P. Shor (2009), Unstructured randomness, small gaps and localization, arXiv:quant-ph/1010.0009.
25. E. Farhi, J. Goldstone, D. Gosset, S. Gutmann, H. B. Meyer and P. Shor (2011), Quantum adiabatic algorithms, small gaps, and difierent paths, Quantum Information and Computation, 11(3), 0181-0214.