Arkadev Chattopadhyay
Skip Abstract Section
Abstract
We construct a simple and total Boolean function F = f ○ XOR on 2n variables that has only O(√n) spectral norm, O(n2) approximate rank, and O(n2.5) approximate nonnegative rank. We show it has polynomially large randomized bounded-error communication complexity of Ω(√n). This yields the first exponential gap between the logarithm of the approximate rank and randomized communication complexity for total functions. Thus, F witnesses a refutation of the log-approximate-rank conjecture that was posed by Lee and Shraibman as a very natural analogue for randomized communication of the still unresolved log-rank conjecture for deterministic communication. The best known previous gap for any total function between the two measures is a recent 4th-power separation by Göös et al.
Additionally, our function F refutes Grolmusz’s conjecture and a variant of the log-approximate-nonnegative-rank conjecture suggested recently by Kol et al., both of which are implied by the log-approximate-rank conjecture. The complement of F has exponentially large approximate nonnegative rank. This answers a question of Lee [32], showing that approximate nonnegative rank can be exponentially larger than approximate rank. The inner function F also falsifies a conjecture about parity measures of Boolean functions made by Tsang et al. The latter conjecture implied the log-rank conjecture for XOR functions.
We are pleased to note that shortly after we published our results, two independent groups of researchers, Anshu et al. and Sinha and de Wolf, used our function F to prove that the quantum-log-rank conjecture is also false by showing that F has Ω(n1/6) quantum communication complexity.
- Scott Aaronson, Shalev Ben-David, and Robin Kothari. 2016. Separations in query complexity using cheat sheets. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC’16). 863--876.Google Scholar
Digital Library
- Anil Ada, Omar Fawzi, and Hamed Hatami. 2012. Spectral norm of symmetric functions. In Proceedings of the15th International Workshop on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX’12) and the 16th International Workshop on Randomization and Computation (RANDOM’12).338--349.Google Scholar
- Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, and Troy Lee. 2017. Separating quantum communication and approximate rank. In Proceedings of the 32nd Computational Complexity Conference (CCC’17). Article 24, 33 pages.Google ScholarDigital Library
- Anurag Anshu, Naresh Goud Boddu, and Dave Touchette. 2019. Quantum log-approximate-rank conjecture is also false. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS’19). IEEE, Los Alamitos, CA, 982--994. DOI:https://doi.org/10.1109/FOCS.2019.00063Google ScholarCross Ref
- Boaz Barak, Mark Braverman, Xi Chen, and Anup Rao. 2013. How to compress interactive communication. SIAM Journal on Computing 42, 3 (2013), 1327--1363.Google ScholarCross Ref
- Mark Braverman, Anat Ganor, Gillat Kol, and Ran Raz. 2018. A candidate for a strong separation of information and communication. In Proceedings of the 9th Innovations in Theoretical Computer Science Conference (ITCS’18). Article 11, 13 pages.Google Scholar
- Mark Braverman and Anup Rao. 2011. Information equals amortized communication. In Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS’11). 748--757.Google ScholarDigital Library
- Jehoshua Bruck and Roman Smolensky. 1990. Polynomial threshold functions, AC0 functions and spectral norms (extended abstract). In Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS’90), Vol. II. 632--641.Google Scholar
- Harry Buhrman, Richard Cleve, and Avi Wigderson. 1998. Quantum vs. classical communication and computation. In Proceedings of the 30th Annual ACM SIGACT Symposium on Theory of Computing (STOC’98). 63--68.Google ScholarDigital Library
- Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, and Sagnik Mukhopadhyay. 2017. Simulation theorems via pseudorandom properties. arXiv:1704.06807.Google Scholar
- Arkadev Chattopadhyay, Nikhil Mande, and Suhail Sherif. 2018. The Log-Approximate-Rank Conjecture Is False. ECCC Report TR18-176. Electronic Colloquium on Computational Complexity. https://eccc.weizmann.ac.il/report/2018/176.Google Scholar
- Andrzej Ehrenfeucht and David Haussler. 1989. Learning decision trees from random examples. Information and Computation 82, 3 (1989), 231--246.Google ScholarDigital Library
- Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf. 2015. Exponential lower bounds for polytopes in combinatorial optimization. Journal of the ACM 62, 2 (2015), Article 17, 23 pages.Google ScholarDigital Library
- Anna Gál and Ridwan Syed. 2019. Upper Bounds on Communication in Terms of Approximate Rank. ECCC Report TR 19-006. Electronic Colloquium on Computational Complexity. https://eccc.weizmann.ac.il/report/2019/006.Google Scholar
- Anat Ganor, Gillat Kol, and Ran Raz. 2016. Exponential separation of information and communication for Boolean functions. Journal of the ACM 63, 5 (2016), Article 46, 31 pages. DOI:https://doi.org/10.1145/2907939Google ScholarDigital Library
- Dmitry Gavinsky. 2016. Entangled simultaneity versus classical interactivity in communication complexity. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing (STOC’16). 877--884.Google ScholarDigital Library
- Dmitry Gavinsky and Shachar Lovett. 2014. En route to the log-rank conjecture: New reductions and equivalent formulations. In Proceedings of the 41st International Colloquium (ICALP’14), Part I. 514--524.Google ScholarCross Ref
- Mika Göös, T. S. Jayram, Toniann Pitassi, and Thomas Watson. 2017. Randomized communication vs. partition number. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP’17). Article 52, 15 pages.Google Scholar
- Mika Göös, Toniann Pitassi, and Thomas Watson. 2015. Deterministic communication vs. partition number. In Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS’15).1077--1088.Google ScholarDigital Library
- Mika Göös, Toniann Pitassi, and Thomas Watson. 2017. Query-to-communication lifting for BPP. In Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science (FOCS’17). 132--143.Google ScholarCross Ref
- Ben Green and Tom Sanders. 2008. Boolean functions with small spectral norm. Geometric and Functional Analysis 18 (2008), 144--162.Google ScholarCross Ref
- Vince Grolmusz. 1997. On the power of circuits with gates of low L1 norms. Theoretical Computer Science 188, 1--2 (1997), 117--128.Google ScholarDigital Library
- Hamed Hatami, Kaave Hosseini, and Shachar Lovett. 2018. Structure of protocols for XOR functions. SIAM Journal on Computing 47, 1 (2018), 208--217.Google ScholarCross Ref
- Wassily Hoeffding. 1963. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58, 301 (1963), 13--30.Google ScholarCross Ref
- Rahul Jain and Hartmut Klauck. 2010. The partition bound for classical communication complexity and query complexity. In Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC’10). 247--258.Google ScholarDigital Library
- Bala Kalyanasundaram and Georg Schnitger. 1992. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics 5, 4 (1992), 545--557.Google ScholarDigital Library
- Hartmut Klauck. 2003. Rectangle size bounds and threshold covers in communication complexity. In Proceedings of the 18th Annual IEEE Conference on Computational Complexity (CCC’03). 118--134.Google ScholarCross Ref
- Gillat Kol, Shay Moran, Amir Shpilka, and Amir Yehudayoff. 2014. Approximate nonnegative rank is equivalent to the smooth rectangle bound. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP’14), Part I. 701--712.Google ScholarCross Ref
- Pravesh K. Kothari, Raghu Meka, and Prasad Raghavendra. 2017. Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (STOC’17). 590--603.Google ScholarDigital Library
- Matthias Krause. 1996. Geometric arguments yield better bounds for threshold circuits and distributed computing. Theoretical Computer Science 156, 1--2 (1996), 99--117.Google ScholarDigital Library
- Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press.Google ScholarDigital Library
- Troy Lee. 2012. Some Open Problems Around Nonnegative Rank. Retrieved May 27, 2020 from http://research.cs.rutgers.edu/∼troyjlee/open_problems.pdf.Google Scholar
- Troy Lee and Adi Shraibman. 2009. Lower bounds in communication complexity. Foundations and Trends in Theoretical Computer Science 3, 4 (2009), 263--398.Google ScholarDigital Library
- H. W. Lenstra, M. R. Best, and Peter van Emde Boas. 1974. A Sharpened Version of the Aanderaa-Rosenberg Conjecture. Report 30/74. Mathematisch Centrum Amsterdam.Google Scholar
- László Lovász. 1990. Communication complexity: A survey. In Paths, Flows, and VLSI-Layout, B. Korte, L. Lovász, H. Prömel, and A. Schrijver (Eds.). Springer-Verlag, 235--265.Google Scholar
- László Lovász and Michael E. Saks. 1988. Lattices, Möbius functions and communication complexity. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS’88). 81--90.Google Scholar
- Shachar Lovett. 2014. Recent advances on the log-rank conjecture in communication complexity. Bulletin of the EATCS 112 (2014), 1--19.Google Scholar
- Shachar Lovett. 2016. Communication is bounded by root of rank. Journal of the ACM 63, 1 (2016), Article 1, 19 pages. DOI:https://doi.org/10.1145/2724704Google ScholarDigital Library
- Ashley Montanaro and Tobias Osborne. 2009. On the communication complexity of XOR functions. arXiv:0909.3392.Google Scholar
- Ilan Newman. 1991. Private vs. common random bits in communication complexity. Information Processing Letters 39, 2 (1991), 67--71.Google ScholarDigital Library
- Ryan O’Donnell, John Wright, Yu Zhao, Xiaorui Sun, and Li-Yang Tan. 2014. A composition theorem for parity kill number. In Proceedings of the IEEE 29th Conference on Computational Complexity (CCC’14). 144--154.Google ScholarDigital Library
- Ramamohan Paturi and Janos Simon. 1986. Probabilistic communication complexity. Journal of Computer and System Sciences 33, 1 (1986), 106--123.Google ScholarDigital Library
- Ariel D. Procaccia. 2008. A note on the query complexity of the Condorcet winner problem. Information Processing Letters 108, 6 (2008), 390--393. DOI:https://doi.org/10.1016/j.ipl.2008.07.012Google ScholarDigital Library
- Alexander A. Razborov. 1992. On the distributional complexity of disjointness. Theoretical Computer Science 106 (1992), 385--390.Google ScholarDigital Library
- Alexander A. Razborov. 2003. Quantum communication complexity of symmetric predicates. Izvestia: Mathematics 67, 1 (2003), 145--159.Google Scholar
- Tom Sanders. 2018. Boolean functions with small spectral norm, revisited. arXiv:1804.04050.Google Scholar
- Amir Shpilka, Avishay Tal, and Ben Lee Volk. 2017. On the structure of Boolean functions with small spectral norm. Computational Complexity 26, 1 (2017), 229--273.Google ScholarDigital Library
- Adi Shraibman. 2019. The corruption bound, log-rank, and communication complexity. Information Processing Letters 141 (2019), 16--21.Google ScholarCross Ref
- Makrand Sinha and Ronald de Wolf. 2019. Exponential separation between quantum communication and logarithm of approximate rank. In Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science (FOCS’19). IEEE, Los Alamitos, CA, 996--981. DOI:https://doi.org/10.1109/FOCS.2019.00062Google ScholarCross Ref
- Xiaoming Sun, Andrew Chi-Chih Yao, and Shengyu Zhang. 2004. Graph properties and circular functions: How low can quantum query complexity go? In Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC’04). 286--293. DOI:https://doi.org/10.1109/CCC.2004.1313851Google Scholar
- Hing Yin Tsang, Chung Hoi Wong, Ning Xie, and Shengyu Zhang. 2013. Fourier sparsity, spectral norm, and the log-rank conjecture. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS’13). 658--667.Google ScholarDigital Library
- Hing Yin Tsang, Ning Xie, and Shengyu Zhang. 2016. Fourier sparsity of GF(2) polynomials. In Proceedings of the 11th International Computer Science Symposium in Russia (CSR’16). 409--424.Google ScholarDigital Library
- Ronald de Wolf. 2018. Private communication.Google Scholar
- Mihalis Yannakakis. 1991. Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences 43, 3 (1991), 441--466.Google ScholarCross Ref
- Andrew Chi-Chih Yao. 1979. Some complexity questions related to distributive computing (preliminary report). In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC’79). 209--213.Google Scholar
- Shengyu Zhang. 2014. Efficient quantum protocols for XOR functions. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’14). 1878--1885.Google ScholarCross Ref
- Zhiqiang Zhang and Yaoyun Shi. 2009. Communication complexities of symmetric XOR functions. Quantum Information 8 Computation 9, 3 (2009), 255--263.Google Scholar
Index Terms
- The Log-Approximate-Rank Conjecture Is False
Recommendations
The log-approximate-rank conjecture is false
STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of ComputingWe construct a simple and total XOR function F on 2n variables that has only O(√n) spectral norm, O(n2) approximate rank and O(n2.5) approximate nonnegative rank. We show it has polynomially large randomized bounded-error communication complexity of Ω(√...
The Log-Rank conjecture and low degree polynomials
We formulate several questions concerning the intersections of sets of Boolean roots of low degree polynomials. Two of these questions we show to be equivalent to the Log-Rank Conjecture from communication complexity. We further exhibit a slightly ...
A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications
STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of ComputingWe introduce a new topological argument based on the Borsuk-Ulam theorem to prove a lower bound on sign-rank.
This result implies the strongest possible separation between randomized and unbounded-error communication complexity. More precisely, we ...
Comments