Nearly optimal separations between communication (or query) complexity and partitions

We show a nearly quadratic separation between deterministic communication complexity and the logarithm of the partition number, which is essentially optimal. This improves upon a recent power 1.5 separation of Goos, Pitassi, and Watson (FOCS 2015). In query complexity, we establish a nearly quadratic separation between deterministic (and even randomized) query complexity and subcube partition complexity, which is also essentially optimal. We also establish a nearly power 1.5 separation between quantum query complexity and subcube partition complexity, the first superlinear separation between the two measures. Lastly, we show a quadratic separation between quantum query complexity and one-sided subcube partition complexity. Our query complexity separations use the recent cheat sheet framework of Aaronson, Ben-David, and Kothari. Our query functions are built up in stages by alternating function composition with the cheat sheet construction. The communication complexity separation follows from "lifting" the query separation to communication complexity.

[1]  Scott Aaronson,et al.  Separations in query complexity using cheat sheets , 2015, Electron. Colloquium Comput. Complex..

[2]  Miklos Santha,et al.  Separating decision tree complexity from subcube partition complexity , 2015, APPROX-RANDOM.

[3]  Rafail Ostrovsky,et al.  The Linear-Array Conjecture in Communication Complexity Is False , 1999, Comb..

[4]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[5]  Ronald de Wolf,et al.  Query Complexity in Expectation , 2014, ICALP.

[6]  Rafail Ostrovsky,et al.  The Linear-Array Conjecture in Communication Complexity Is False , 1996, STOC '96.

[7]  Noam Nisan,et al.  CREW PRAMS and decision trees , 1989, STOC '89.

[8]  Avishay Tal,et al.  Properties and applications of boolean function composition , 2013, ITCS '13.

[9]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[10]  Zvi Galil,et al.  Lower bounds on communication complexity , 1984, STOC '84.

[11]  Ben Reichardt,et al.  Reflections for quantum query algorithms , 2010, SODA '11.

[12]  Frédéric Magniez,et al.  Lower bounds for randomized and quantum query complexity using Kolmogorov arguments , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[13]  Ashley Montanaro.  A composition theorem for decision tree complexity , 2015, Chicago J. Theor. Comput. Sci..

[14]  Hartmut Klauck,et al.  The Partition Bound for Classical Communication Complexity and Query Complexity , 2009, 2010 IEEE 25th Annual Conference on Computational Complexity.

[15]  Michael E. Saks,et al.  Composition limits and separating examples for some boolean function complexity measures , 2013, 2013 IEEE Conference on Computational Complexity.

[16]  Petr Savický.  On determinism versus unambiquous nondeterminism for decision trees , 2002, Electron. Colloquium Comput. Complex..

[17]  Toniann Pitassi,et al.  Deterministic Communication vs. Partition Number , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[18]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[19]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[20]  A. Razborov.  Communication Complexity , 2011 .

[21]  Martin Dyer,et al.  Leibniz International Proceedings in Informatics, LIPIcs , 2016, ICALP 2016.

[22]  Toniann Pitassi,et al.  Randomized Communication vs. Partition Number , 2015, Electron. Colloquium Comput. Complex..

[23]  Mika Göös,et al.  Lower Bounds for Clique vs. Independent Set , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[24]  Scott Aaronson.  Quantum certificate complexity , 2008, J. Comput. Syst. Sci..

[25]  Nisheeth K. Vishnoi,et al.  A quadratically tight partition bound for classical communication complexity and query complexity , 2014, ArXiv.

[26]  Mario Szegedy,et al.  All Quantum Adversary Methods Are Equivalent , 2005, ICALP.

[27]  Scott Aaronson,et al.  Lower bounds for local search by quantum arguments , 2003, STOC '04.

[28]  Troy Lee,et al.  Negative weights make adversaries stronger , 2007, STOC '07.

[29]  Troy Lee,et al.  Quantum Query Complexity of State Conversion , 2010, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[30]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[31]  Noam Nisan,et al.  On the degree of boolean functions as real polynomials , 1992, STOC '92.

[32]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.