Quantum walk algorithm for element distinctness

SIAM Journal on Computing

Volumn 37, Issue 1, 2007, Pages 210-239

  Ambainis, Andris ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Element distinctness; Quantum computing; Quantum query algorithms

Indexed keywords

PROBLEM SOLVING; QUANTUM COMPUTERS; QUERY PROCESSING;

ELEMENT DISTINCTNESS; QUANTUM QUERY ALGORITHMS;

ALGORITHMS;

EID: 34548457765     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705447311     Document Type: Conference Paper

References (38)

1. S. AARONSON AND Y. SHI, Quantum lower bounds for the collision and the element distinctness problems, J. ACM, 51 (2004), pp. 595-605.
2. S. AARONSON AND A. AMBAINIS, Quantum search of spatial structures, Theory Comput., 1 (2005), pp. 47-79. Preliminary version in Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, 2003, pp. 200-209.
3. D. AHARONOV, Quantum computation - a review, in Annual Reviews of Computational Physics, vol. VI, D. Stauffer, ed., World Scientific, River Edge, NJ, 1999, pp. 259-346.
4. N. ALON, L. BABAI, AND A. ITAI, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1986), pp. 567-583.
5. A. AMBAINIS, Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range, Theory Comput., 1 (2005), pp. 37-46.
6. A. AMBAINIS, Quantum walks and their algorithmic applications, Int. J. Quantum Inform., 1 (2003), pp. 507-518.
7. A. AMBAINIS, Quantum query algorithms and lower bounds, in Classical and New Paradigms of Computation and Their Complexity Hierarchies, Trends Log. Stud. Log. Libr. 23, Kluwer, Dordrecht, The Netherlands, 2004, pp. 15-32.
8. A. AMBAINIS, J. KEMPE, AND A. RIVOSH, Coins make quantum walks faster, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp. 1099-1108.
9. A. BARENCO, C. BENNETT, R. CLEVE, D. DIVINCENZO, N. MARGOLUS, P. SHOR, T. SLEATOR, J. SMOLIN, AND H. WEINFURTER, Elementary gates for quantum computation, Phys. Rev. A, 52 (1995), pp. 3457-3467.
10. P. BEAME, M. SAKS, X. SUN, AND E. VEE, Time-space trade-off lower bounds for randomized computation of decision problems, J. ACM, 50 (2003), pp. 154-195. Preliminary version in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 169-179.
11. P. BENIOFF, Space Searches with a Quantum Robot, in Quantum Computation and Information: A Millennium Volume, Contemp. Math. 305, AMS, Providence, RI, 2002, pp. 1-12.
12. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIRANI, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26 (1997), pp. 1510-1523.
13. E. BERNSTEIN AND U. VAZIRANI, Quantum Complexity Theory, SIAM J. Comput., 26 (1997), pp. 1411-1473.
14. H. BUHRMAN, C. DÜRR, M. HEILIGMAN, P. HOYER, F. MAGNIEZ, M. SANTHA, AND R. DE WOLF, Quantum algorithms for element distinctness, SIAM J. Comput., 34 (2005), pp. 1324-1330.
15. H. BUHRMAN AND R. ŠPALEK, Quantum verification of matrix products, in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2006, pp. 880-889.
16. G. BRASSARD, P. HøYER, M. MOSCA, AND A. TAPP, Quantum amplitude amplification and estimation, in Quantum Computation and Information: A Millennium Volume, Contemp. Math. 305, AMS, Providence, RI, 2002, pp. 53-74.
17. G. BRASSARD, P. HøYER, AND A. TAPP, Quantum cryptanalysis of hash and claw-free functions, in Proceedings of LATIN '98, Lecture Notes in Comput. Sci. 1380, Springer, Berlin, 1998, pp. 163-169.
18. H. BUHRMAN AND R. DE WOLF, Complexity measures and decision tree complexity: A survey, Theoret. Comput. Sci., 288 (2002), pp. 21-43.
19. A. CHILDS, R. CLEVE, E. DEOTTO, E. FARHI, S. GUTMANN, AND D. SPIELMAN, Exponential algorithmic speedup by quantum walk, in Proceedings of the 35th Annual Symposium on Theory of Computing, ACM, New York, 2003, pp. 59-68.
20. A. CHILDS AND J. EISENBERG, Quantum algorithms for subset finding, Quantum Inform. Comput., 5 (2005), pp. 593-604.
21. A. CHILDS, E. FARHI, AND S. GUTMANN, An example of the difference between quantum and classical random walks, J. Quantum Inform. Process., 1 (2002), p. 35.
22. A. CHILDS AND J. GOLDSTONE, Spatial search by quantum walk, Phys. Rev. A, 70 (2004), article 022314.
23. A. CHILDS AND J. GOLDSTONE, Spatial search and the Dirac equation, Phys. Rev. A, 70 (2004), article 023122.
24. E. FARHI AND S. GUTMANN, Quantum computation and decision trees, Phys. Rev. A, 58 (1998), pp. 915-928.
25. D. GRIGORIEV, M. KARPINSKI, F. MEYER AUF DER HEIDE, AND R. SMOLENSKY, A lower bound for randomized algebraic decision trees, in Proceedings of the 28th Annual Symposium on Theory of Computing, ACM, New York, 1996, pp. 612-619.
26. L. GROVER, A fast quantum mechanical algorithm for database search, in Proceedings of the 28th Annual Symposium on Theory of Computing, ACM, New York, 1996, pp. 212-219.
27. R. HORN AND C. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
28. T. ITOH, T. NAGATANI, AND J. TARUI, Explicit construction of k-wise nearly random permutations by Feistel transform, in Workshop on Randomness and Computation, Sendai, Japan, 2005, pp. 15-16.
29. J. KEMPE, Quantum random walks hit exponentially faster, in Proceedings of RANDOM '03, Lecture Notes in Comput. Sci. 2764, Springer-Verlag, New York, 2003, pp. 354-369.
30. J. KEMPE, Quantum random walks-An introductory overview, Contemp. Phys., 44 (2003), pp. 307-327.
31. S. KUTIN, A quantum lower bound for the collision problem, Theory Comput., 1 (2005), pp. 29-36.
32. F. MAGNIEZ, M. SANTHA, AND M. SZEGEDY, Quantum algorithms for the triangle problem, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2005, pp. 1109-1117.
33. M. MITZENMACHER AND E. UPFAL, Probability and Computing. Randomized Algorithms and Probabilistic Analysis, Cambridge University Press, Cambridge, UK, 2005.
34. A. PANCONESI AND A. SRINIVASAN, Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds, SIAM J. Comput., 26 (1997), pp. 350-368.
35. W. PUGH, Skip lists: A probabilistic alternative to balanced trees, Comm. ACM, 33 (1990), pp. 668-676.
36. N. SHENVI, J. KEMPE, AND K. WHALEY, Quantum random-walk search algorithm, Phys. Rev. A, 67 (2003), pp. 052307.
37. M. SZEGEDY, Quantum speed-up of Markov chain based algorithms, in Proceedings of the 45th Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2004, pp. 32-41. Preliminary version appeared as Tech. report quant-ph/0401053, available online at http://arxiv.org/abs/quant-ph/0401053.
38. A. YAO, Near-optimal time-space tradeoff for element distinctness, in Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1988, pp. 91-97.