computational complexity

, Volume 23, Issue 2, pp 305–322 | Cite as

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

  • Andris Ambainis
  • Ronald de Wolf


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.


Quantum computing quantum algorithms Boolean functions polynomial approximations computational complexity 

Subject classification

68Q12 68Q17 41A10 06E30 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aaronson S., Shi Y. (2004) Quantum Lower Bounds for the Collision and the Element Distinctness Problems. Journal of the ACM 51(4): 595–605CrossRefzbMATHMathSciNetGoogle Scholar
  2. 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.Google Scholar
  3. 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.Google Scholar
  4. 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.Google Scholar
  5. R. Beigel (1993). The Polynomial Method in Circuit Complexity. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference, 82–95.Google Scholar
  6. E. Bernstein & U. Vazirani (1997). Quantum Complexity Theory. SIAM Journal on Computing 26(5), 1411–1473. Earlier version in STOC’93.Google Scholar
  7. 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.Google Scholar
  8. 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.Google Scholar
  9. H. Buhrman & R. de Wolf (2002). Complexity Measures and Decision Tree Complexity: A Survey. Theoretical Computer Science 288(1), 21–43.Google Scholar
  10. R. de Wolf (2008). A Brief Introduction to Fourier Analysis on the Boolean Cube. Theory of Computing ToC Library, Graduate Surveys 1.Google Scholar
  11. 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.Google Scholar
  12. A. Drucker & R. de Wolf (2011). Quantum proofs for classical theorems. Theory of Computing ToC Library, Graduate Surveys 2.Google Scholar
  13. L. K. Grover (1996). A Fast Quantum Mechanical Algorithm for Database Search. In Proceedings of 28th ACM STOC, 212–219. quant-ph/9605043.Google Scholar
  14. S. Janson (1997). Gaussian Hilbert Spaces, volume 129 of Cambridge Tracts in Mathematics. Cambridge University Press.Google Scholar
  15. 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.Google Scholar
  16. 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.Google Scholar
  17. 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.Google Scholar
  18. R. O’Donnell (2014). Analysis of Boolean functions. Cambridge University Press. Preliminary version available at
  19. Sherstov A. (2008) Communication Lower Bounds Using Dual Polynomials. Bulletin of the EATCS 95: 59–93zbMATHMathSciNetGoogle Scholar
  20. 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.Google Scholar
  21. 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.Google Scholar

Copyright information

© Springer Basel 2014

Authors and Affiliations

  1. 1.Faculty of ComputingUniversity of LatviaRigaLatvia
  2. 2.CWI and University of AmsterdamAmsterdamThe Netherlands

Personalised recommendations