Quantum lower bounds for the collision and the element distinctness problems

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 513-519

  Shi, Yaoyun ^a  

^a University of Michigan   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; PROBLEM SOLVING; QUANTUM CRYPTOGRAPHY; QUANTUM THEORY; QUERY LANGUAGES;

ELEMENT DISTINCTNESS PROBLEM; QUANTUM ALGORITHM; QUANTUM COMPUTING; QUANTUM LOWER BOUNDS;

BOUNDARY CONDITIONS;

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

References (25)

1. S. Aaronson. Quantum lower bound for the collision problem. In Proceedings of the Thirty-Fourth Annual ACM Symposium on the Theory of Computing, pages 635-642, Montral, Qubec, Canada, May 2002.
2. Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, May 1996.
3. A. Ambainis. A better lower bound for quantum algorithms searching an ordered list. In 40th Symposium on Foundations of Computer Science (FOCS), pages 352-357, New York, NY, USA, Oct. 1999. IEEE Computer Society.
4. A. Ambainis. Quantum lower bounds by quantum arguments. In Proceedings of the Thirty-second Annual ACM Symposium on the Theory of Computing, pages 636-643, Portland, Oregon, May 2000.
5. A. Ambainis. Quantum query algorithms and lower bounds. In Proceedings of Foundations of the Formal Sciences III, September 2001.
6. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. In 39th Annual Symposium on Foundations of Computer Science, pages 352-361, Los Alamitos, CA, Nov. 1998. IEEE
7. M. Ben-Or. Lower bounds for algebraic computation trees. In Proceedings of the Fifteenth Annual ACM Symposium on the Theory of Computing, pages 80-86, Boston, Massachusetts, Apr. 1983.
8. C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani. Strengths and weaknesses of quantum computing. SIAM J. Comput., 26(5): 1510-1523, Oct. 1997.
9. G. Brassard, P. Høyer, and A. Tapp. Quantum algorithm for the collision problem. ACM SIGACT News, 28: 14-19, 1997. Preprint: quant-ph/9705002.
10. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. In Proceedings of Sixteenth IEEE conference on Computational Complexity, 2001.
11. R. A. DeVore and G. G. Lorentz. Constructive approximation. Springer-Verlag, Berlin, 1993.
12. 2 on linear search programs for the knapsack problem. J. Comput. Syst. Sci., 16.413-417, 1978.
13. M. Grigni, L. Schulman, M. Vazirani, and U. Vazirani. Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In Proceedings of Thirty-Third Annual ACM Symposium on Theory of Computing, 2001.
14. D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky. A lower bound for randomized algebraic decision trees. In ACM Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, May 1996. pages 612-619.
15. L. K. Grover. A fast quantum mechanical algorithm for database search. In ACM Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, May 1996. pages 212-219.
16. P. Høyer, J. Neerbek, and J. Shi. Quantum complexities of ordered searching, sorting, and element distinctness. In Proceedings of 28th International Colloquium on Automata, Languages, and Programming, 2001.
17. M. Minsky and S. Papert. Perceptrons. MIT Press, Cambridge, MA, 1969.
18. N. Nisan and M. Szegedy. On the degree of Boolean functions as real polynomials. In Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, pages 462-467, Victoria, British Columbia, Canada, 4-6 May 1992.
19. R. Paturi. On the degree of polynomials that approximate symmetric Boolean functions (preliminary version). In Proceedings of the Twenty-Fourth Annual ACM Symposium on the Theory of Computing, pages 468-474. Victoria, British Columboia, Canada, May 1992.
20. Y. Shi. Approximating linear restrictions of Boolean functions. Manuscript, 2001.
21. P. W. Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings: 35th Annual Symposium on Foundations of Computer Science, November 20-22, 1994, Santa Fe, New Mexico, pages 124-134. IEEE Computer Society Press, 1994.
22. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26(5): 1484-1509, Oct. 1997.
23. D. R. Simon. On the power of quantum computation. SIAM Journal on Computing, 26(5): 1474-1483, Oct. 1997.
24. J. M. Steele and A. C.- C. Yao. Lower bounds for algebraic decision trees. J. Algorithms, 3(1): 1-8, 1982.
25. A. C.- C. Yao. Personal communication, 1999.