Polynomial degree vs. quantum query complexity

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 230-239

  Ambainis, Andris ^a  

^a UNIVERSITY OF LATVIA   (Latvia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; POLYNOMIAL APPROXIMATION; QUANTUM THEORY;

QUANTUM ALGORITHMS; QUANTUM COMPUTING; QUANTUM QUERY COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

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

References (29)

1. S. Aaronson. Quantum lower bound for the collision problem. Proceedings of STOC'02, pp. 635-642. Also quant-ph/0111102.
2. A. Aaronson. Lower bounds for local search by quantum arguments, quant-ph/0307149.
3. A. Ambainis. A better lower bound for quantum algorithms searching an ordered list. Proceedings of FOCS'99, pp. 352-357. Also quant-ph/9902053.
4. A. Ambainis. Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences, 64:750-767, 2002. Earlier versions at STOC'00 and quant-ph/0002066.
5. A. Ambainis. Quantum lower bounds for collision and element distinctness with small range. quant-ph/0305179.
6. A. Ambainis. Quantum query algorithms and lower bounds. Proceedings of FOTFS'III, to appear. Journal version under preparation.
7. H. Barnum, M. Saks: A lower bound on the quantum query complexity of read-once functions, quant-ph/0201007.
8. H. Barnum, M. Saks, M. Szegedy. Quantum decision trees and semidefinite programming. Complexity'2003, to appear.
9. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf. Quantum lower bounds by polynomials. Journal of ACM, 48: 778-797, 2001. Earlier versions at FOCS'98 and quant-ph/9802049.
10. E. Bernstein, C. Bennett, G. Brassard, U. Vazirani. Strengths and weaknesses of quantum computing. SIAM J. Computing, 26:1510-1523, 1997. quant-ph/9701001
11. H. Buhrman, R. Cleve, and A. Wigderson Quantum vs. classical communication and computation. Proceedings of STOC'98, pp. 63-68, quant-ph/9702040
12. 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, quant-ph/0007016.
13. H. Buhrman, R. de Wolf. Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, 288: 21-43, 2002.
14. E. W. Cheney, Introduction to Approximation Theory. New York: McGraw-Hill, 1966.
15. L. Grover. A fast quantum mechanical algorithm for database search. STOC'96, pp. 212-219, quant-ph/9605043.
16. P. Hoyer, J. Neerbek, Y. Shi. Quantum lower bounds of ordered searching, sorting and element distinctness. Algorithmica, 34:429-448, 2002. Earlier versions at ICALP'01 and quant-ph/0102078.
17. P. Hoyer, M. Mosca, and R. De Wolf, Quantum Search on Bounded-Error Inputs. To appear in ICALP 03. quant-ph/0304052.
18. S. Kutin. A quantum lower bound for the collision problem, quant-ph/0304162.
19. A. Nayak, F. Wu. The quantum query complexity of approximating the median and related statistics. Proceedings of STOC'99, pp. 384-393, quant-ph/9804066.
20. N. Nisan, M. Szegedy. On the degree of Boolean functions as real polynomials. Computational Complexity, 4:301-313, 1994.
21. N. Nisan, A. Wigderson. On rank vs. communication complexity. Combinatorica, 15:557-565, 1995.
22. N. Nisan, A. Wigderson. FOCS'94.
23. A. Razborov. Quantum communication complexity of symmetric predicates, Izvestiya of the Russian Academy of Science, mathematics, 2002. quant-ph/0204025.
24. M. Saks, A. Wigderson. Probabilistic boolean decision trees and the complexity of evaluating game trees. FOCS 1986, pp. 29-38
25. M. Santha. On the Monte Carlo Boolean decision tree complexity of read-once formulae. Structures 1991, pp. 180-187
26. Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. Proceedings of FOCS'02, pp. 513-519, quant-ph/0112086.
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. Computation, 26: 1484-1509, 1997. quant-ph/9508027.
29. M. Snir. Lower bounds on probabilistic linear decision trees. Theoretical Computer Science, 38:69-82, 1985.