A lower bound on the quantum query complexity of read-once functions

Journal of Computer and System Sciences

Volumn 69, Issue 2, 2004, Pages 244-258

  Barnum, Howard ^a   Saks, Michael ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Decision tree complexity; Lower bounds; Quantum computation; Quantum query complexity; Query complexity; Read once functions

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; SET THEORY; TREES (MATHEMATICS); VECTORS;

DECISION TREE COMPLEXITY; LOWER BOUNDS; QUANTUM COMPUTATION; QUANTUM QUERY COMPLEXITY; QUERY COMPLEXITY; READ-ONCE FUNCTIONS;

QUERY LANGUAGES;

EID: 3342887162     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2004.02.002     Document Type: Article

References (15)

1. A. Ambainis, Quantum lower bounds by quantum arguments, Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing (STOC), 2000, pp. 636-643.
2. H. Barnum, M. Saks, M. Szegedy, Quantum decision trees and semidefinite programming, Proceedings of the 18th IEEE Annual Conference on Computational Complexity (COMPLEXITY '03), 2003, pp. 179-193.
3. R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf, Quantum lower bounds by polynomials, FOCS '98, 1998, pp. 352-361.
4. Bennett C.H., Brassard G., Bernstein E., Vazirani U. Strengths and weaknesses of quantum computing. SIAM J. Comput. 26:1997;1510-1523.
5. Buhrman H., Wolf R.de Complexity measures and decision tree complexity. Theoret. Comput. Sci. 288:2002;21-43.
6. R. Cleve, The query-complexity of order-finding, Proceedings of the 15th Annual IEEE Conference on Computational Complexity (CCC '00), 2000, pp. 54-59 (also arXiv.org e-print quant-ph/9911124).
7. L. Grover, A fast quantum mechanical algorithm for database search, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), May 1998, pp. 212-219.
8. L. Grover, How fast can a quantum computer search? 1998, arXiv.org e-print quant-ph/9809029.
9. P. H ø yer, J. Neerbek, Y. Shi, Quantum complexities of ordered searching, sorting, and element distinctness, Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP), 2001.
10. N. Nisan, M. Szegedy, On the degree of Boolean functions as real polynomials, Comput. Complexity (1994) 301-313.
11. M. Saks, A. Wigderson, Probabilistic Boolean decision trees and the complexity of evaluating game trees, Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science (FOCS), 1986, pp. 29-38.
12. M. Santha, On the Monte-Carlo Boolean decision tree complexity of read-once formulae, Proceedings of the Sixth IEEE Structure in Complexity Theory, 1991, pp. 180-187.
13. P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings of the 37th Annual Symposium on the Foundations of Computer Science, 1994, pp. 56-65.
14. Shor P.W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26:1997;1484-1509.
15. Simon D. On the power of quantum computation. SIAM J. Comput. 26:1997;1474-1483.