Skip to main content
Log in

How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Ω(log n), and that this bound is achieved for some functions. In this paper, we study the case of approximate degree and bounded-error quantum query complexity. We show that for these measures, the correct lower bound is Ω(log n/ log  log n), and we exhibit quantum algorithms for two functions where this bound is achieved.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aaronson S., Shi Y. (2004) Quantum Lower Bounds for the Collision and the Element Distinctness Problems. Journal of the ACM 51(4): 595–605

    Article  MATH  MathSciNet  Google Scholar 

  • A. Ambainis (2006). Polynomial degree vs. quantum query complexity. Journal of Computer and System Sciences 72(2), 220–238. Earlier version in FOCS’03. quant-ph/0305028.

  • A. Ambainis, A. Bačkurs, J. Smotrovs & R. de Wolf (2013). Optimal quantum query bounds for almost all Boolean functions. In Proceedings of 30th Annual Symposium on Theoretical Aspects of Computer Science (STACS’13), 446–453. quant-ph/1208.1122.

  • R. Beals, H. Buhrman, R. Cleve, M. Mosca & R. de Wolf (2001). Quantum Lower Bounds by Polynomials. Journal of the ACM 48(4), 778–797. Earlier version in FOCS’98. quant-ph/9802049.

  • R. Beigel (1993). The Polynomial Method in Circuit Complexity. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference, 82–95.

  • E. Bernstein & U. Vazirani (1997). Quantum Complexity Theory. SIAM Journal on Computing 26(5), 1411–1473. Earlier version in STOC’93.

  • G. Brassard, P. Høyer, M. Mosca & A. Tapp (2002). Quantum Amplitude Amplification and Estimation. In Quantum Computation and Quantum Information: A Millennium Volume, volume 305 of AMS Contemporary Mathematics Series, 53–74. quant-ph/0005055.

  • H. Buhrman & R. de Wolf (2001). Communication Complexity Lower Bounds by Polynomials. In Proceedings of 16th IEEE Conference on Computational Complexity, 120–130. Cs.CC/9910010.

  • H. Buhrman & R. de Wolf (2002). Complexity Measures and Decision Tree Complexity: A Survey. Theoretical Computer Science 288(1), 21–43.

  • R. de Wolf (2008). A Brief Introduction to Fourier Analysis on the Boolean Cube. Theory of Computing ToC Library, Graduate Surveys 1.

  • I. Dinur, E. Friedgut, G. Kindler & R. O’Donnell (2007). On the Fourier tails of bounded functions over the discrete cube. Israel Journal of Mathematics 160(1), 389–412. Earlier version in STOC’06.

  • A. Drucker & R. de Wolf (2011). Quantum proofs for classical theorems. Theory of Computing ToC Library, Graduate Surveys 2.

  • L. K. Grover (1996). A Fast Quantum Mechanical Algorithm for Database Search. In Proceedings of 28th ACM STOC, 212–219. quant-ph/9605043.

  • S. Janson (1997). Gaussian Hilbert Spaces, volume 129 of Cambridge Tracts in Mathematics. Cambridge University Press.

  • H. Klauck, R. Špalek & R. de Wolf (2007). Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM Journal on Computing 36(5), 1472–1493. Earlier version in FOCS’04. quant-ph/0402123.

  • N. Nisan & M. Szegedy (1994). On the Degree of Boolean functions as Real Polynomials. Computational Complexity 4(4), 301–313. Earlier version in STOC’92.

  • R. O’Donnell (2008). Some Topics in Analysis of Boolean Functions. Technical report, ECCC Report TR08–055. Paper for an invited talk at STOC’08.

  • R. O’Donnell (2014). Analysis of Boolean functions. Cambridge University Press. Preliminary version available at http://analysisofbooleanfunctions.org/.

  • Sherstov A. (2008) Communication Lower Bounds Using Dual Polynomials. Bulletin of the EATCS 95: 59–93

    MATH  MathSciNet  Google Scholar 

  • H. U. Simon (1983). A Tight Ω(loglog n)-bound on the Time for Parallel RAM’s to Compute Non-Degenerate Boolean Functions. In Symposium on Foundations of Computation Theory, volume 158 of Lecture Notes in Computer Science, 439–444. Springer.

  • W. van Dam (1998). Quantum Oracle Interrogation: Getting all information for almost half the price. In Proceedings of 39th IEEE FOCS, 362–367. quant-ph/9805006.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ronald de Wolf.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ambainis, A., de Wolf, R. How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?. comput. complex. 23, 305–322 (2014). https://doi.org/10.1007/s00037-014-0083-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-014-0083-2

Keywords

Subject classification

Navigation