Adiabatic quantum computing for random satisfiability problems

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 67, Issue 2, 2003, Pages

  Hogg, Tad ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; COMPUTER SIMULATION; COSTS; ENERGY GAP; HAMILTONIANS; HEURISTIC METHODS; PROBABILITY;

QUANTUM COMPUTING; RANDOM SATISFIABILITY PROBLEMS;

QUANTUM THEORY;

EID: 0037627497     PISSN: 10502947     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. D. Deutsch, Proc. R. Soc. London, Ser. A 400, 97 (1985).
2. D. P. DiVincenzo, Science 270, 255 (1995).
3. R. P. Feynman, Feynman Lectures on Computation (Addison-Wesley, Reading, MA, 1996).
4. A. Steane, Rep. Prog. Phys. 61, 117 (1998).
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
6. C. H. Bennett, E. Bernstein, G. Brassard, and U. V. Vazirani, SIAM J. Comput. 26, 1510 (1997).
7. E. Farhi et al., Science 292, 472 (2001).
8. V. N. Smelyanskiy, U. V. Toussaint, and D. A. Timucin, e-print quant-ph/0112143.
9. G. E. Santoro et al., Science 295, 2427 (2002).
10. P. Cheeseman, B. Kanefsky, and W. M. Taylor, in Proceedings of IJCAI91, edited by J. Mylopoulos and R. Reiter (Morgan Kaufmann, San Mateo, CA, 1991), pp. 331-337.
11. S. Kirkpatrick and B. Selman, Science 264, 1297 (1994).
12. Frontiers in Problem Solving: Phase Transitions and Complexity, edited by T. Hogg, B. A. Huberman, and C. P. Williams, special issue of Artif. Intell. 81, (1996).
13. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Nature (London) 400, 133 (1999).
14. E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Technical Report No. MIT-CTP-2936, MIT, 2000 (unpublished).
15. W. van Dam, M. Mosca, and U. Vazirani, In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS2001), edited by M. Naor (IEEE, New York, 2001), pp. 279-287.
16. T. Hogg, Phys. Rev. A 61, 052311 (2000).
17. T. Hogg, e-print quant-ph/0104048.
18. G. W. Snedecor and W. G. Cochran, Statistical Methods, 6th ed. (Iowa State University Press, Ames, IA, 1967).
19. R. B. Lehoucq, D. C. Sorensen, and C. Yang, ARPACK User's Guide: Solution of Large-Scale Eigenvalue Problems with Implicitly Restarted Arnoldi Methods (SIAM, Philadelphia, PA, 1998).
20. B. Selman, H. Levesque, and D. Mitchell, in Proceedings of the 10th National Conference on Artificial Intelligence (AAAI92), edited by P. Rosenbloom and P. Szolovits (AAAI Press, Menlo Park, CA, 1992), pp. 440-446.
21. J. Frank, P. Cheeseman, and J. Stutz, J. Artif. Intell. Res. 7, 249 (1997).
22. J. Roland and N. J. Cerf, Phys. Rev. A 65, 042308 (2002).
23. S. F. Edwards and R. C. Jones, J. Phys. A 9, 1595 (1976).
24. Z. Furedi and K. Komlos, Combinatorica 1, 233 (1981).
25. J. K. L. MacDonald, Phys. Rev. 43, 830 (1933).
26. P.-O. Lowdin, Phys. Rev. 139, A357 (1965).
27. L. K. Grover, Phys. Rev. Lett. 79, 325 (1997).
28. M. Boyer, G. Brassard, P. Hoyer, and A. Tapp, in Proceedings of the Workshop on Physics and Computation (PhysComp96), edited by T. Toffoli et al. (New England Complex Systems Institute, Cambridge, MA, 1996), pp. 36-43.
29. G. Brassard, P. Hoyer, and A. Tapp, in Proceedings of 25th International Colloquium on Automata, Languages, and Programming (ICALP98), edited by K. Larsen (Springer, Berlin, 1998), pp. 820-831.
30. S. M. Maurer, T. Hogg, and B. A. Huberman, Phys. Rev. Lett. 87, 257901 (2001).