Nested quantum search and NP-hard problems

Applicable Algebra in Engineering, Communications and Computing

Volumn 10, Issue 4, 2000, Pages 311-338

  Cerf, Nicolas J ^a,b   Grover, Lov K ^c   Williams, Colin P ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; ITERATIVE METHODS;

COMBINATORIAL SEARCH PROBLEMS; CONSTRAINT SATISFACTION PROBLEMS; QUANTUM ALGORITHMS;

QUANTUM THEORY;

EID: 0033737178     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000050134     Document Type: Article

References (24)

1. Bennett, C. H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and Weaknesses of Quantum Computing, SIAM Journal on Computing 26, 1510 (1997); also in Los-Alamos e-print quant-ph/9701001
2. Biron, D., Biham, O., Biham, E., Grassl, M., Lidar, D. A.: Generalized Grover search algorithm for arbitrary initial amplitude distribution, Los-Alamos e-print quant-ph/9801066
3. Boyer, M., Brassard, G., Hoyer, P., Tapp, A.: Tight bounds on quantum searching, In: Proc. 4th Workshop on Physics and Computation, edited by T. Toffoli, M. Biafore, and J. Leao, (New England Complex Systems Institute, Boston, 1996), p. 36; also in Los-Alamos e-print quant-ph/9605034
4. Brassard, G., Hoyer, P., Tapp, A.: Quantum counting, Los-Alamos e-print quant-ph/9805082
5. Cheeseman, P., Kanefsky, B., Taylor, W. M.: Where the really hard problems are, In: Proc. of International Joint Conference on Artificial Intelligence (IJCAI'91), Sydney, pp. 331-337, Los Altos, CA: Morgan Kauffman, 1991
6. Farhi, E., Gutmann, S.: Quantum mechanical square root speedup in a structured search problem, Los-Alamos e-print quant-ph/9711035
7. Farhi, E., Gutmann, S.: Quantum computation and decision trees, Phys. Rev. A 58, 915 (1998)
8. Hogg, T.: Highly structured searches with quantum computers, Phys. Rev. Lett. 80, 2473 (1998)
9. Garey, M. R., Johnson, D. S.: Computers and Intractability: a guide to the theory of NP-hardness, San Francisco: Freeman 1979
10. Lenstra, A., Lenstra, H.: The development of the Number Field Sieve, Lectures Notes in Mathematics 1554, New York: Springer 1993
11. Gingrich, R., Williams, C. P., Cerf, N. J.: Generalized Quantum Search with Parallelism. Los-Alamos e-print quant-ph/9904049, to appear in Phys. Rev. A (2000)
12. Grover, L. K.: A fast quantum mechanical algorithm for database search, In: Proc. 28th Annual Symposium on the Theory of Computing, pp. 212-219, New York: ACM Press 1996
13. Grover, L. K.: Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79, 325 (1997)
14. Grover, L. K.: Quantum search on structured problems. Proc. 1st NASA Int. Conf. on Quantum Computing and Quantum Communications; also in Los-Alamos e-print quant-ph/9802035
15. Grover, L. K.: Quantum computers can search rapidly by using almost any transformation, Phys. Rev. Lett. 80, 4329 (1998)
16. Hogg, T.: A framework for structured quantum search. Physica D 120, 102 (1998)
17. Jozsa, R.: Searching in Grover's Algorithm, Los-Alamos e-print quant-ph/9901021
18. Kirkpatrick, S., Selman, B.: Critical behavior in the satisfiability of random boolean expressions, Science 264, 1297 (1994)
19. Shor, P. W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Proc. 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser, pp. 124-134, New York: IEEE Computer Society Press, 1994
20. Shor, P. W.: SIAM Journal on Computing 26, 1484 (1997)
21. Williams, C. P., Hogg, T.: Using deep structure to locate hard problems. In: Proc. 10th National Conf. on Artificial Intelligence (AAAI'92), pp. 472-477, Menlo Park, CA: AAAI Press, 1992
22. Williams, C. P., Hogg, T.: Extending deep structure, In: Proc. 11th National Conf. on Artificial Intelligence (AAAI'93), pp. 152-157, Menlo Park, CA: AAAI Press, 1993
23. Williams, C. P., Hogg, T.: Expected Gains from Parallelizing Constraint Solving for Hard Problems, In: Proc. 12th National Conf. on Artificial Intelligence (AAAI'94), pp. 1310-1315, Menlo Park, CA: AAAI Press, 1994
24. Zalka, C.: Grover's quantum searching algorithm is optimal. Los-Alamos e-print quant-ph/9711070