skip to main content
research-article

All Classical Adversary Methods Are Equivalent for Total Functions

Authors Info & Claims
Published:28 January 2021Publication History
Skip Abstract Section

Abstract

We show that all known classical adversary lower bounds on randomized query complexity are equivalent for total functions and are equal to the fractional block sensitivity fbs(f). That includes the Kolmogorov complexity bound of Laplante and Magniez and the earlier relational adversary bound of Aaronson. This equivalence also implies that for total functions, the relational adversary is equivalent to a simpler lower bound, which we call rank-1 relational adversary. For partial functions, we show unbounded separations between fbs(f) and other adversary bounds, as well as between the adversary bounds themselves.

We also show that, for partial functions, fractional block sensitivity cannot give lower bounds larger than √ n ⋅ bs(f), where n is the number of variables and bs(f) is the block sensitivity. Then, we exhibit a partial function f that matches this upper bound, fbs(f) = Ω (√ n ⋅ bs(f)).

References

  1. Scott Aaronson. 2006. Lower bounds for local search by quantum arguments. SIAM J. Comput. 35, 4 (2006), 804--824 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Scott Aaronson. 2008. Quantum certificate complexity. J. Comput. System Sci. 74, 3 (2008), 313--322. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, and Avishay Tal. 2020. Degree vs. Approximate Degree and Quantum Implications of Huang’s Sensitivity Theorem. arxiv:2010.12629 [quant-ph]Google ScholarGoogle Scholar
  4. Andris Ambainis. 2000. Quantum lower bounds by quantum arguments. In Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC’00). ACM, New York, NY, 636--643. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Andris Ambainis. 2003. Polynomial degree vs. quantum query complexity. In Proceedings of the 44th IEEE Symposium on Foundations of Computer Science (FOCS’03). IEEE Computer Society, Washington, DC, 230--239. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Andris Ambainis, Martins Kokainis, and Robin Kothari. 2016. Nearly optimal separations between communication (or query) complexity and partitions. In Proceedings of the 31st Conference on Computational Complexity (CCC’16). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Andris Ambainis, Krišjānis Prūsis, and Jevgēnijs Vihrovs. 2018. On block sensitivity and fractional block sensitivity. Lobachevskii J. Math. 39, 7 (2018), 967--969.Google ScholarGoogle ScholarCross RefCross Ref
  8. Shalev Ben-David and Robin Kothari. 2016. Randomized query complexity of sabotaged and composed functions. In Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP’16) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 55). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 60:1--60:14.Google ScholarGoogle Scholar
  9. Harry Buhrman and Ronald de Wolf. 2002. Complexity measures and decision tree complexity: A survey. Theor. Comput. Sci. 288, 1 (2002), 21--43. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Justin Gilmer, Michael Saks, and Srikanth Srinivasan. 2016. Composition limits and separating examples for some Boolean function complexity measures. Combinatorica 36, 3 (2016), 265--311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Peter Hoyer, Troy Lee, and Robert Spalek. 2007. Negative weights make adversaries stronger. In Proceedings of the 39th ACM Symposium on Theory of Computing (STOC’07). ACM, New York, NY, 526--535. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Peter Høyer, Jan Neerbek, and Yaoyun Shi. 2001. Quantum complexities of ordered searching, sorting, and element distinctness. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP’01). Springer-Verlag, London, UK, 346--357. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Hao Huang. 2019. Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture. Ann. Math. 190 (11 2019), 949--955.Google ScholarGoogle Scholar
  14. Rahul Jain and Hartmut Klauck. 2010. The partition bound for classical communication complexity and query complexity. In Proceedings of the IEEE 25th Conference on Computational Complexity (CCC’10). IEEE Computer Society, Washington, DC, 247--258. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Raghav Kulkarni and Avishay Tal. 2016. On fractional block sensitivity. Chicago J. Theor. Comput. Sci. 8 (2016), 1--16.Google ScholarGoogle ScholarCross RefCross Ref
  16. Sophie Laplante and Frédéric Magniez. 2004. Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. In Proceedings of the 19th IEEE Conference on Computational Complexity (CCC’04). IEEE Computer Society, Washington, DC, 294--304. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Ming Li and Paul M. B. Vitnyi. 2008. An Introduction to Kolmogorov Complexity and Its Applications (3rd ed.). Springer Publishing Company, Incorporated. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Noam Nisan. 1989. CREW PRAMs and decision trees. In Proceedings of the 21st ACM Symposium on Theory of Computing (STOC’89). ACM, New York, NY, 327--335. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Noam Nisan and Mario Szegedy. 1994. On the degree of Boolean functions as real polynomials. Comput. Complex. 4, 4 (1994), 301--313. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Ben W. Reichardt. 2009. Span programs and quantum query complexity: The general adversary bound is nearly tight for every Boolean function. In Proceedings of the 50th IEEE Symposium on Foundations of Computer Science (FOCS’09). IEEE Computer Society, Washington, DC, 544--551. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Robert Špalek and Mario Szegedy. 2006. All quantum adversary methods are equivalent. Theor. Comput. 2, 1 (2006), 1--18.Google ScholarGoogle ScholarCross RefCross Ref
  22. Avishay Tal. 2013. Properties and applications of Boolean function composition. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science (ITCS’13). ACM, New York, NY, 441--454. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Andrew Chi-Chin Yao. 1977. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th Symposium on Foundations of Computer Science. 222--227. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. All Classical Adversary Methods Are Equivalent for Total Functions

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)13
        • Downloads (Last 6 weeks)1

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!