Polynomial degree and lower bounds in quantum complexity: Collision and element distinctness with small range

Theory of Computing

Volumn 1, Issue , 2005, Pages 37-46

  Ambainis, Andris ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Complexity of Boolean functions; Element distinctness; Polynomials method; Quantum computation; Quantum lower bounds; Quantum query algorithms

Indexed keywords

QUANTUM COMPUTERS;

ELEMENT DISTINCTNESS; GENERAL METHOD; LOWER BOUNDS; POLYNOMIAL DEGREE; QUANTUM COMPLEXITY; QUANTUM LOWER BOUNDS; QUANTUM QUERIES; QUANTUM QUERY ALGORITHM;

POLYNOMIALS;

EID: 85032889592     PISSN: None     EISSN: 15572862     Source Type: Journal    
DOI: 10.4086/toc.2005.v001a003     Document Type: Article

References (22)

1. S. AARONSON: Quantum lower bound for the collision problem. In Proceedings of STOC’02, pp. 635-642, 2002. [STOC:509907.509999, arXiv:quant-ph/0111102]. 1, 2.2, 4, 2
2. S. AARONSON and Y. SHI: Quantum lower bounds for the collision and the element distinctness problems. Journal of ACM, 51(4):595-605, 2004. Earlier versions in [1] and [22]. [JACM:1008731.1008735]. 1, 2.2, 2.3, 2.2, 3, 4
3. A. AMBAINIS: Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences, 64:750-767, 2002. [JCSS:10.1006/jcss.2002.1826, arXiv:quant-ph/0002066]. 3.3
4. A. AMBAINIS: Polynomial degree vs. quantum query complexity. In Proceedings of FOCS’03, pp. 230-239, 2003. [FOCS:10.1109/SFCS.2003.1238197, arXiv:quant-ph/0305028]. 3.3
5. A. AMBAINIS: Quantum walk algorithm for element distinctness. In Proceedings of FOCS’04, pp. 22-31, 2004. [FOCS:10.1109/FOCS.2004.54, arXiv:quant-ph/0311001]. 1
6. R. BEALS, H. BUHRMAN, R. CLEVE, M. MOSCA, and R. DE WOLF: Quantum lower bounds by polynomials. Journal of ACM, 48:778-797, 2001. Earlier version at FOCS’98. [JACM:502090.502097, arXiv:quant-ph/9802049]. 1
7. G. BRASSARD, P. HØYER, and A. TAPP: Quantum algorithm for the collision problem. SIGACT News, 28:14-19, 1997. [arXiv:quant-ph/9705002]. 1
8. G. BRASSARD, P. HØYER, and A. TAPP: Quantum counting. In Proceedings of ICALP’98, pp. 820-831, 1998. [ICALP:ap2mrf08d8gcqppe, arXiv:quant-ph/9805082]. 1
9. H. BUHRMAN, R. CLEVE, and A. WIGDERSON: Quantum vs. classical communication and computation. In Proceedings of STOC’98, pp. 63-68, 1998. [STOC:276698.276713]. 3.3
10. H. BUHRMAN and R. DE WOLF: Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, 288:21-43, 2002. [TCS:10.1016/S0304-3975(01)00144-X]. 1
11. H. BUHRMAN, C. DURR, M. HEILIGMAN, P. HØYER, F. MAGNIEZ, M. SANTHA, and R. DE WOLF: Quantum algorithms for element distinctness. In 16th IEEE Annual Conference on Computational Complexity (CCC’01), pp. 131-137, 2001. [CCC:10.1109/CCC.2001.933880, arXiv:quant-ph/0007016]. 1
12. H. BUHRMAN and R. ŠPALEK: Quantum verification of matrix products. [arXiv:quant-ph/0409035]. 1
13. nd edition. The MIT Press and McGraw-Hill Book Company, 2001. 1
14. L. GROVER: A fast quantum mechanical algorithm for database search. In Proceedings of STOC’96, pp. 212-219, 1996. [STOC:237814.237866, arXiv:quant-ph/9605043]. 1
15. L. GROVER: A framework for fast quantum mechanical algorithms. In Proceedings of STOC’98, pp. 53-62, 1998. [STOC:276698.276712, arXiv:quant-ph/9711043]. 1
16. P. HOYER, J. NEERBEK, and Y. SHI: Quantum lower bounds of ordered searching, sorting and element distinctness. Algorithmica, 34:429-448, 2002. Earlier version at ICALP’01. [Algorithmica:25gl9elr5rxr3q6a, arXiv:quant-ph/0102078]. 1, 2.2
17. S. KUTIN: Quantum lower bound for the collision problem. Theory of Computing, 1(2):29-36, 2005. [ToC:v001/a002, arXiv:quant-ph/0304162]. 1
18. F. MAGNIEZ, M. SANTHA, and M. SZEGEDY: Quantum algorithms for the triangle problem. In Proceedings of SODA’05, 2005. [arXiv:quant-ph/0310134]. 1
19. A. NAYAK and F. WU: The quantum query complexity of approximating the median and related statistics. In Proceedings of STOC’99, pp. 384-393, 1999. [STOC:301250.301349, arXiv:quant-ph/9804066]. 1
20. N. NISAN and M. SZEGEDY: On the degree of boolean functions as real polynomials. Computational Complexity, 4:301-313, 1994. 1
21. Y. SHI: Approximating linear restrictions of boolean functions. Manuscript. 1, 3.3
22. Y. SHI: Quantum lower bounds for the collision and the element distinctness problems. In Proceedings of FOCS’02, pp. 513-519, 2002. [FOCS:10.1109/SFCS.2002.1181975, arXiv:quantph/0112086]. 2.3, 2.2, 2