Quantum optimization

Information sciences

Volumn 128, Issue 3, 2000, Pages 181-197

  Hogg, Tad ^a   Portnov, Dmitriy ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; PROBLEM SOLVING; TRAVELING SALESMAN PROBLEM;

QUANTUM ALGORITHMS;

QUANTUM THEORY;

EID: 0034301165     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(00)00052-9     Document Type: Article

References (29)

1. M. Boyer, G. Brassard, P. Hoyer, A. Tapp, Tight bounds on quantum searching, in: T. Toffoli, et al. (Eds.), Proceedings of the Workshop on Physics and Computation (PhysComp96), New England Complex Systems Institute, Cambridge, MA, 1996, pp. 36-43.
2. G. Brassard, P. Hoyer, A. Tapp, Quantum counting. in: K. Larsen (Ed.), Proceedings of the 25th International Colloquium on Automata, Languages, and Programming (ICALP98), Springer, Berlin, 1998, pp. 820-831. Los Alamos preprint quant-ph/9805082.
3. N.J. Cerf, L.K. Grover, C.P. Williams, Nested quantum search and NP-complete problems, in: Applicable Algebra in Engineering, Communication and Computing, Springer, Berlin, 1998. Los Alamos preprint quant-ph/9806078.
4. Cerny V. Quantum computers and intractable (NP-complete) computing problems. Phys. Rev. A. 48:1993;116-119.
5. P. Cheeseman, B. Kanefsky, W.M. Taylor, Where the really hard problems are, in: J. Mylopoulos, R. Reiter (Eds.), Proceedings of IJCAI91, Morgan Kaufmann, San Mateo, CA, 1991, pp. 331-337.
6. Deutsch D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. Lond. A. 400:1985;97-117.
7. DiVincenzo D.P. Quantum computation. Science. 270:1995;255-261.
8. Freuder E.C., Wallace R.J. Partial constraint satisfaction. Arti. Intell. 58:1992;21-70.
9. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
10. I.P. Gent, E. MacIntyre, P. Prosser, T. Walsh, The scaling of search cost, in: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI97), AAAI Press, Menlo Park, CA, 1997, pp. 315-320.
11. L.K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 78 (1997) 325-328. Los Alamos preprint quant-ph/9706033.
12. Grover L.K. Quantum search on structured problems. Chaos, Solitons, and Fractals. 10:1999;1695-1705.
13. T. Hogg, Highly structured searches with quantum computers, Phys. Rev. Lett. 80 (1998) 2473-2476. Preprint at publish.aps.org/eprint/gateway/eplist/aps1997oct30_002.
14. T. Hogg, Single-step quantum search using problem structure, 1998. Los Alamos preprint quant-ph/9812049.
15. T. Hogg, Quantum search heuristics, Phys. Rev. A 61 (052311) (2000). Preprint at publish.aps.org/eprint/gateway/eplist/aps1999oct19_002.
16. T. Hogg, B.A. Huberman, C.P. Williams (Eds.), Frontiers in Problem Solving: Phase Transitions and Complexity (special issue of Artificial Intelligence), vol. 81, Elsevier, Amsterdam, 1996.
17. T. Hogg, C. Mochon, E. Rieffel, W. Polak, Tools for quantum algorithms, Int. J. Modern Phys. C 10 (1999) 1347-1361. Los Alamos preprint quant-ph/9811073.
18. Hopfield J.J., Tank D.W. Neural computation of decisions in optimization problems. Biol. Cybern. 52:1985;141-152.
19. Karp R.M. A patching algorithm for the non-symmetric traveling-salesman problem. SIAM J. Comput. 8:1979;561-573.
20. Kirkpatrick S., Gelatt C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;671-680.
21. Kirkpatrick S., Selman B. Critical behavior in the satisfiability of random Boolean expressions. Science. 264:1994;1297-1301.
22. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B. The Traveling Salesman Problem. 1985;Wiley, New York.
23. Miller D.L., Pekny J.F. Exact solution of large asymmetric traveling salesman problems. Science. 251(4995):1991;754-761.
24. Nijenhuis A., Wilf H.S. Combinatorial Algorithms for Computers and Calculators. second ed. 1978;Academic Press, New York.
25. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI92), AAAI Press, Menlo Park, CA, 1992, pp. 440-446.
26. Snedecor G.W., Cochran W.G. Statistical Methods. sixth ed. 1967;Iowa State University Press, Ames, Iowa.
27. L. Spector, H. Barnum, H.J. Bernstein, N. Swamy, Finding a better-than-classical quantum AND/OR algorithm using genetic programming, in: P. Angeline, (Ed.), Proceedings of the 1999 Congress on Evolutionary Computing, IEEE, Washington, DC, 1999.
28. W. Zhang, Depth-first branch-and-bound versus local search: A case study, in: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI2000), AAAI, 2000, pp. 930-935.
29. Zhang W., Korf R.E. A study of complexity transitions on the asymmetric traveling salesman problem. Arti. Intell. 81:1996;223-239.