Quantum lower bounds for the collision and the element distinctness problems

Journal of the ACM

Volumn 51, Issue 4, 2004, Pages 595-605

  Aaronson, Scott ^a,c   Shi, Yaoyun ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Collision; Element distinctness; Polynomial method; Quantum computing; Quantum lower bounds

Indexed keywords

POLYNOMIAL METHODS; QUANTUM COMPUTING; QUANTUM LOWER BOUNDS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA PRIVACY; POLYNOMIALS; PROBLEM SOLVING; SECURITY OF DATA;

QUANTUM CRYPTOGRAPHY;

EID: 4243159779     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1008731.1008735     Document Type: Article

References (26)

1. AARONSON, S. 2002. Quantum lower bound for the collision problem. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC-02). ACM, New York, 635-642.
2. AMBAINIS, A. 2000. Quantum lower bounds by quantum arguments. In Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (Portland, Ore.), ACM, New York, 636-643.
3. AMBAINIS, A. 2003a. Quantum lower bounds for collision and element distinctness with small range. Pre-print: quant-ph/0305179.
4. AMBAINIS, A. 2003b. Quantum walk algorithm for element distinctness. Pre-print: quant-ph/0311001.
5. BEALS, R., BUHRMAN, H., CLEVE, R., MOSCA, M., AND DE WOLF, R. 1998. Quantum lower bounds by polynomials. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 352-361.
6. BEN-OR, M. 1983. Lower bounds for algebraic computation trees. In Proceedings of the 15th Annual ACM Symposium on the Theory of Computing (Boston, Mass.), ACM, New York, 80-86.
7. BENNETT, C. H., BERNSTEIN, E., BRASSARD, G., AND VAZIRANI, U. 1997. Strengths and weaknesses of quantum computing. SIAM J. Comput. 26, 5 (Oct.), 1510-1523.
8. BRASSARD, G., HøYER, P., AND TAPP, A. 1998. Quantum cryptanalysis of hash and claw-free functions. In Lecture Notes in Computer Science, vol. 1380. Springer-Verlag, New York, 163-169.
9. BUHRMAN, H., DÜRR, C., HEILIGMAN, M., HøYER, P., MAGNIEZ, F., SANTHA, M., AND DE WOLF, R. 2001. Quantum algorithms for element distinctness. In Proceedings of 16th IEEE Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, Calif.,
10. DEVORE, R. A., AND LORENTZ, G. G. 1993. Constructive approximation. Springer-Verlag, Berlin, Germany.
11. 2 on linear search programs for the knapsack problem. J. Comput. Syst. Sci. 16, 413-417.
12. GRIGNI, M., SCHULMAN, L., VAZIRANI, M., AND VAZIRANI, U. 2001. Quantum mechanical algorithms for the non-Abelian hidden subgroup problem. In Proceedings of 33rd Annual ACM Symposium on Theory of Computing. ACM, New York.
13. GRIGORIEV, D., KARPINSKI, M., MEYER AUF DER HEIDE, F., AND SMOLENSKY, R. 1996. A lower bound for randomized algebraic decision trees. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, pa.), ACM, New York, 612-619.
14. GROVER, L. K. 1996. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM, Symposium on the Theory of Computing (Philadelphia, pa.), ACM, New York, 212-219.
15. HøYER, P., NEERBEK, J., AND SHI, Y. 2002. Quantum complexities of ordered searching, sorting, and element distinctness. Algorithmica 34, 4, 429-448.
16. KLAUCK, H. 2003. Quantum time-space tradeoffs for sorting. In Proceedings of the 35th ACM Symposium on Theory of Computing. ACM, New York, 69-76.
17. KUTIN, S. 2003. A quantum lower bound for the collision problem. Pre-print: quant-ph/0304162.
18. MINSKY, M., AND PAPERT, S. 1969. Perceptrons. MIT Press, Cambridge, Mass.
19. NISAN, N., AND SZEGEDY, M. 1992. On the degree of Boolean functions as real polynomials. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (Victoria, British Columbia, Canada). ACM, New York, 462-467.
20. PATURI, R. 1992. On the degree of polynomials that approximate symmetric Boolean functions (preliminary version). In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (Victoria, British Columbia, Canada). ACM, New York, 468-474.
21. SHI, Y. 2002. Quantum lower bounds on the collision and the element distinctness problems. In Proceedings of the 43st Symposium on Foundations of Computer Science (FOCS) (Vancouver, B.C., Canada). IEEE Computer Society Press, Los Alamitos, Calif., 513-519.
22. SHI, Y. 2004. Approximating linear restrictions of Boolean functions. Manuscript.
23. SHOR, P. W. 1997. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 5 (Oct.), 1484-1509.
24. SIMON, D. R. 1997. On the power of quantum computation. SIAM J. Comput. 26, 5 (Oct.), 1474-1483.
25. STEELE, J. M., AND YAO, A. C. 1982. Lower bounds for algebraic decision trees. J. Algorithms 3, 1, 1-8.
26. WATROUS, J. 2000. Succinct quantum proofs for properties of finite groups. In Proceedings of the 41st Symposium on Foundations of Computer Science (FOCS) (Redondo Beach, Calif.). IEEE Computer Society Press, Los Alamitos, Calif., 537-546.