Random Restrictions of Bounded Low Degree Polynomials Are Juntas

Author Sreejata Kishor Bhattacharya



PDF
Thumbnail PDF

File

LIPIcs.ITCS.2025.17.pdf
  • Filesize: 0.77 MB
  • 21 pages

Document Identifiers

Author Details

Sreejata Kishor Bhattacharya
  • School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India

Acknowledgements

I want to thank Francisco Escudero Gutierrez for pointing out typos and a small mistake in a previous version of this paper.

Cite As Get BibTex

Sreejata Kishor Bhattacharya. Random Restrictions of Bounded Low Degree Polynomials Are Juntas. In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 325, pp. 17:1-17:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ITCS.2025.17

Abstract

We study the effects of random restrictions on low degree functions that are bounded on every point of the Boolean cube. Our main result shows that, with high probability, the restricted function can be approximated by a junta of arity that is just polynomial in the original degree. More precisely, let f: {± 1}ⁿ → [0,1] be a degree d polynomial (d ≥ 2) and let ρ denote a random restriction with survival probability O(log(d)/d). Then, with probability at least 1-d^{-Ω(1)}, there exists a function g: {± 1}ⁿ → [0,1] depending on at most d^O(1) coordinates such that ||f_{ρ}-g||_2^2 ≤ d^{-1-Ω(1)}. 
Our result has the following consequence for the well known, outstanding conjecture of Aaronson and Ambainis. The Aaronson-Ambainis conjecture was formulated to show that the acceptance probability of a quantum query algorithm can be well approximated almost everywhere by a classical query algorithm with a polynomial blow-up: it speculates that a polynomal f: {± 1}ⁿ → [0,1] with degree d has a coordinate with influence ≥ poly(1/d, Var[f]). Our result shows that this is true for a non-negligible fraction of random restrictions of f assuming Var[f] is not too low. 
Our work combines the ideas of Dinur, Friedgut, Kindler and O'Donnell [Dinur et al., 2006] with an approximation theoretic result, first reported in the recent work of Filmus, Hatami, Keller and Lifshitz [Yuval Filmus and Hamed Hatami, 2014].

Subject Classification

ACM Subject Classification
  • Theory of computation → Quantum query complexity
Keywords
  • Analysis of Boolean Functions
  • Quantum Query Algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Scott Aaronson and Andris Ambainis. Forrelation: A problem that optimally separates quantum from classical computing. Electron. Colloquium Comput. Complex., TR14-155, 2014. URL: https://eccc.weizmann.ac.il/report/2014/155.
  2. Scott Aaronson and Andris Ambainis. The need for structure in quantum speedups. Theory Comput., 10:133-166, 2014. URL: https://doi.org/10.4086/TOC.2014.V010A006.
  3. Nikhil Bansal, Makrand Sinha, and Ronald de Wolf. Influence in completely bounded block-multilinear forms and classical simulation of quantum algorithms. In Shachar Lovett, editor, 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA, volume 234 of LIPIcs, pages 28:1-28:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPICS.CCC.2022.28.
  4. Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf. Quantum lower bounds by polynomials. In 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pages 352-361. IEEE Computer Society, 1998. URL: https://doi.org/10.1109/SFCS.1998.743485.
  5. Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, and Alan R. Woods. Exponential lower bounds for the pigeonhole principle. In S. Rao Kosaraju, Mike Fellows, Avi Wigderson, and John A. Ellis, editors, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pages 200-220. ACM, 1992. URL: https://doi.org/10.1145/129712.129733.
  6. Ethan Bernstein and Umesh V. Vazirani. Quantum complexity theory. SIAM J. Comput., 26(5):1411-1473, 1997. URL: https://doi.org/10.1137/S0097539796300921.
  7. Irit Dinur, Ehud Friedgut, Guy Kindler, and Ryan O'Donnell. On the fourier tails of bounded functions over the discrete cube. In Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC '06, pages 437-446, New York, NY, USA, 2006. Association for Computing Machinery. URL: https://doi.org/10.1145/1132516.1132580.
  8. Yuval Filmus and Hamed Hatami. Bounds on the sum of L1 influences. CoRR, abs/1404.3396, 2014. URL: https://arxiv.org/abs/1404.3396.
  9. Merrick L. Furst, James B. Saxe, and Michael Sipser. Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory, 17(1):13-27, 1984. URL: https://doi.org/10.1007/BF01744431.
  10. Johan Håstad. Almost optimal lower bounds for small depth circuits. In Juris Hartmanis, editor, Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 28-30, 1986, Berkeley, California, USA, pages 6-20. ACM, 1986. URL: https://doi.org/10.1145/12130.12132.
  11. Johan Håstad. On small-depth frege proofs for PHP. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pages 37-49. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00010.
  12. Russell Impagliazzo, Raghu Meka, and David Zuckerman. Pseudorandomness from shrinkage. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 111-119. IEEE Computer Society, 2012. URL: https://doi.org/10.1109/FOCS.2012.78.
  13. Nathan Keller and Ohad Klein. Quantum speedups need structure, 2019. URL: https://arxiv.org/abs/1911.03748.
  14. Michel Ledoux and Michel Talagrand. Probability in Banach Spaces. Springer Berlin Heidelberg, 1991. URL: https://doi.org/10.1007/978-3-642-20212-4.
  15. Shachar Lovett and Jiapeng Zhang. Fractional Certificates for Bounded Functions. In Yael Tauman Kalai, editor, 14th Innovations in Theoretical Computer Science Conference (ITCS 2023), volume 251 of Leibniz International Proceedings in Informatics (LIPIcs), pages 84:1-84:13, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ITCS.2023.84.
  16. Ashley Montanaro. Some applications of hypercontractive inequalities in quantum information theory. Journal of Mathematical Physics, 53(12), December 2012. URL: https://doi.org/10.1063/1.4769269.
  17. Ryan O'Donnell. Analysis of boolean functions, 2021. URL: https://arxiv.org/abs/2105.10386.
  18. Ryan O'Donnell, Michael E. Saks, Oded Schramm, and Rocco A. Servedio. Every decision tree has an influential variable. CoRR, abs/cs/0508071, 2005. URL: https://arxiv.org/abs/cs/0508071.
  19. Ryan O'Donnell and Yu Zhao. Polynomial bounds for decoupling, with applications. CoRR, abs/1512.01603, 2015. URL: https://arxiv.org/abs/1512.01603.
  20. Theodore J. Rivlin. Chebyshev polynomials - From approximation theory to algebra and number theory: 2nd edition. John Wiley & Sons Limited, 1990. Google Scholar
  21. Benjamin Rossman, Rocco A. Servedio, and Li-Yang Tan. An average-case depth hierarchy theorem for boolean circuits. In Venkatesan Guruswami, editor, IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 1030-1048. IEEE Computer Society, 2015. URL: https://doi.org/10.1109/FOCS.2015.67.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail