Polynomial degree vs. quantum query complexity

Journal of Computer and System Sciences

Volumn 72, Issue 2, 2006, Pages 220-238

  Ambainis, Andris ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Polynomial degree of Boolean functions; Quantum lower bounds; Quantum query complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; QUANTUM THEORY; QUERY LANGUAGES;

POLYNOMIAL DEGREE OF BOOLEAN FUNCTIONS; QUANTUM LOWER BOUNDS; QUANTUM QUERY COMPLEXITY;

POLYNOMIALS;

EID: 32844471194     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.06.006     Document Type: Article

References (32)

1. A. Aaronson, Lower bounds for local search by quantum arguments, Proceedings of STOC'04, 2004, pp. 465-474, also quant-ph/0307149.
2. S. Aaronson, and Y. Shi Quantum lower bounds for the collision and the element distinctness problems J. ACM 51 2004 595 605
3. A. Ambainis Quantum lower bounds by quantum arguments J. Comput. System Sci. 64 2002 750 767 earlier versions at STOC'00 and quant-ph/0002066
4. A. Ambainis, Polynomial degree and lower bounds in quantum complexity: collision and element distinctness with small range, Theory of Computing 1 (2005) 37-46, als quantph/0305179.
5. A. Ambainis, Quantum query algorithms and lower bounds. Proceedings of FOTFS'III, Trends in Logic, Kluwer Academic Publishers, 23 (2004) 15-32.
6. H. Barnum, M. E. Saks, A lower bound on the quantum query complexity of read-once functions. J. Comput system Sci.69(2004) 244-258.
7. H. Barnum, M. Saks, M. Szegedy, Quantum decision trees and semidefinite programming, Complexity'03, 2003, pp. 179-193.
8. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf Quantum lower bounds by polynomials J. ACM 48 2001 778 797 earlier versions at FOCS'98 and quant-ph/9802049
9. C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani Strengths and weaknesses of quantum computing SIAM J. Comput. 26 1997 1510 1523 quant-ph/9701001
10. H. Buhrman, R. Cleve, A. Wigderson, Quantum vs. classical communication and computation, Proceedings of STOC'98, 1998, pp. 63-68, quant-ph/9702040.
11. H. Buhrman, C. Durr, M. Heiligman, P. Hoyer, F. Magniez, M. Santha, R. de Wolf, Quantum algorithms for element distinctness, Proceedings of Complexity'01, 2001, pp. 131-137, quant-ph/0007016.
12. H. Buhrman, and R. de Wolf Complexity measures and decision tree complexity: a survey Theoret. Comput. Sci. 288 2002 21 43
13. E.W. Cheney Introduction to Approximation Theory 1966 McGraw-Hill New York
14. L. Grover, A fast quantum mechanical algorithm for database search, STOC'96, 1996, pp. 212-219, quant-ph/9605043.
15. P. Hoyer, M. Mosca, R. de Wolf, Quantum search on bounded-error inputs, Proceedings of ICALP'03, Lecture Notes in Computer Science, vol. 2719, Springer, Berlin, 2003, pp. 291-299, also quant-ph/0304052.
16. P. Hoyer, J. Neerbek, and Y. Shi Quantum lower bounds of ordered searching sorting and element distinctness, Algorithmica 34 2002 429 448 earlier versions at ICALP'01 and quant-ph/0102078
17. S. Kutin, A quantum lower bound for the collision problem, with small range, Theory of Computing 1 (2005) 29-36.
18. S. Laplante, F. Magniez, Lower bounds for randomized and quantum query complexity using Kolmogorov arguments, Proceedings of Complexity'04, 2004, pp. 294-304, also quant-ph/0311189.
19. 1.3) quantum algorithm for the triangle problem, Proceedings of SODA'05, 2005, pp. 1109-1117, also quant-ph/0310134.
20. G. Midrijanis, Exact quantum query complexity for total Boolean functions, quant-ph/0403168.
21. A. Nayak, F. Wu, The quantum query complexity of approximating the median and related statistics, Proceedings of STOC'99, 1999, pp. 384-393, quant-ph/9804066.
22. N. Nisan, and M. Szegedy On the degree of Boolean functions as real polynomials Comput. Complexity 4 1994 301 313
23. N. Nisan, and A. Wigderson On rank vs. communication complexity Combinatorica 15 1995 557 565 also FOCS'94
24. A. Razborov Quantum communication complexity of symmetric predicates Izvestiya Russian Acad. Sci. Math. 67 2003 159 176 also quant-ph/0204025
25. M. Saks, A. Wigderson, Probabilistic boolean decision trees and the complexity of evaluating game trees, FOCS'86, 1986, pp. 29-38.
26. M. Santha, On the Monte Carlo Boolean decision tree complexity of read-once formulae, Structures'91, 1991, pp. 180-187.
27. Y. Shi, Approximating linear restrictions of Boolean functions, Manuscript, 2002.
28. P. Shor Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer SIAM J. Comput. 26 1997 1484 1509 quant-ph/9508027
29. M. Snir Lower bounds on probabilistic linear decision trees Theoret. Comput. Sci. 38 1985 69 82
30. R. Spalek, M. Szegedy, All quantum adversary methods are equivalent, quant-ph/0409116, 2004.
31. M. Szegedy, On the quantum query complexity of detecting triangles in graphs, quant-ph/0310107, 2003.
32. S. Zhang, On the power of Ambainis's lower bounds, Proceedings of ICALP'04, Lecture Notes in Computer Science, vol. 3142, Springer, Berlin, 2004, pp. 1238-1250, also quant-ph/0311060.