Quantum walk algorithm for element distinctness

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 22-31

  Ambainis, Andris ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; MATRIX ALGEBRA; QUERY LANGUAGES; SET THEORY;

QUANTUM ALGORITHMS; QUANTUM COMPUTING; QUANTUM SEARCH; QUANTUM WALKS;

QUANTUM THEORY;

EID: 17744377810     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. S. Aaronson. Quantum lower bound for the collision problem. Proceedings of STOC'02, pp. 635-642.
2. S. Aaronson, A. Ambainis. Quantum search of spatial structures. Proceedings of FOCS'03, pp. 200-209.
3. D. Aharonov. Quantum computation - a review. Annual Review of Computational Physics(ed. Dietrich Stauffer), vol. VI, World Scientific, 1998.
4. A. Ambainis. Quantum lower bounds for collision and element distinctness with small range, quant-ph/0305179.
5. A. Ambainis. Quantum walks and their algorithmic applications. International Journal of Quantum Information, 1:507-518 (2003).
6. A. Ambainis. Quantum query algorithms and lower bounds. Proceedings of FOTFS'III, to appear. Journal version under preparation.
7. A. Ambainis, J. Kempe, A. Rivosh. Coins make quantum walks faster, quant-ph/0402107.
8. P. Beame, M. Saks, X. Sun, E. Vee. Time-space tradeoff lower bounds for randomized computation of decision problems. Journal of the ACM, 50: 154-195, 2003. Also FOCS'00.
9. P. Benioff. Space searches with a quantum robot. Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Mathematics Series, 2002. Also quant-ph/0003006.
10. H. Buhrman, C. Durr, M. Heiligman, P. Hoyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. Proceedings of Complexity'01, pp. 131-137,
11. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation, Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Mathematics Series, 2002.
12. G. Brassard, P. Høyer, and A. Tapp. Quantum crypt-analysis of hash and claw-free functions. Proceedings of LATIN'98, Lecture Notes in Computer Science, 1380:163-169, 1998.
13. H. Buhrman, R. de Wolf. Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, 288:21-43, 2002.
14. A. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, D. Spielman Exponential algorithmic speedup by quantum walk. Proceedings of STOC'03, pp. 59-68.
15. A. Childs, J. Eisenberg. Quantum algorithms for subset finding. quant-ph/0311038.
16. A. Childs, E. Farhi, S. Gutmann. An example of the difference between quantum and classical random walks. Journal of Quantum Information Processing, 1:35, 2002.
17. A. Childs, J. Goldstone. Spatial search by quantum walk, quant-ph/0306054.
18. A. Childs, J. Goldstone. Spatial search and the Dirac equation, quant-ph/0405120.
19. E. Farhi, S. Gutmann. Quantum computation and decision trees. Physical Review A, 58:915-928, 1998.
20. D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky. A lower bound for randomized algebraic decision trees. Proceedings of STOC'96, pp. 612-619.
21. L. Grover. A fast quantum mechanical algorithm for database search. Proceedings of STOC'96, pp. 212-219.
22. R. Horn, C. Johnson Matrix Analysis, Cambridge University Press, 1985.
23. J. Kempe. Quantum random walks hit exponentially faster Proceedings of RANDOM'03, Lecture Notes in Computer Science, 2764:354-369, 2003.
24. J. Kempe. Quantum random walks - an introductory overview, Contemporary Physics, 44:307-327, 2003.
25. S. Kutin. A quantum lower bound for the collision problem, quant-ph/0304162.
26. 1.3) quantum algorithm for the triangle problem, quant-ph/0310134.
27. N. Shenvi, J. Kempe, K. Whaley. Quantum random-walk search algorithm, Physical Review A, 67:052307, 2003.
28. Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. Proceedings of FOCS '02, pp. 513-519.
29. M. Szegedy. Spectra of Quantized Walks and a √δ∈ rule, quant-ph/0401053.
30. A. Yao. Near-optimal time-space tradeoff for element distinctness. Proceedings of FOCS'88, pp. 91-97.