Quantum Log-Approximate-Rank Conjecture is Also False

In a recent breakthrough result, Chattopadhyay, Mande and Sherif [ECCC TR18-17] showed an exponential separation between the log approximate rank and randomized communication complexity of a total function f, hence refuting the log approximate rank conjecture of Lee and Shraibman [2009]. We provide an alternate proof of their randomized communication complexity lower bound using the information complexity approach. Using the intuition developed there, we derive a polynomially-related quantum communication complexity lower bound using the quantum information complexity approach, thus providing an exponential separation between the log approximate rank and quantum communication complexity of f. Previously, the best known separation between these two measures was (almost) quadratic, due to Anshu, Ben-David, Garg, Jain, Kothari and Lee [CCC, 2017]. This settles one of the main question left open by Chattopadhyay, Mande and Sherif, and refutes the quantum log approximate rank conjecture of Lee and Shraibman [2009]. Along the way, we develop a Shearer-type protocol embedding for product input distributions that might be of independent interest.

[1]  Dave Touchette,et al.  Augmented Index and Quantum Streaming Algorithms for DYCK(2) , 2016, CCC.

[2]  Jaikumar Radhakrishnan,et al.  A lower bound for the bounded round quantum communication complexity of set disjointness , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[3]  Arkadev Chattopadhyay,et al.  The log-approximate-rank conjecture is false , 2018, Electron. Colloquium Comput. Complex..

[4]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[5]  Dave Touchette,et al.  Quantum Information Complexity , 2015, STOC.

[6]  G. Lindblad.  Completely positive maps and entropy inequalities , 1975 .

[7]  Ran Raz,et al.  Exponential Separation of Information and Communication for Boolean Functions , 2015, STOC.

[8]  Jeroen van de Graaf,et al.  Cryptographic Distinguishability Measures for Quantum-Mechanical States , 1997, IEEE Trans. Inf. Theory.

[9]  D. Bures.  An extension of Kakutani’s theorem on infinite product measures to the tensor product of semifinite *-algebras , 1969 .

[10]  Jaikumar Radhakrishnan,et al.  A Direct Sum Theorem in Communication Complexity via Message Compression , 2003, ICALP.

[11]  Hartmut Klauck,et al.  Interaction in Quantum Communication , 2006, IEEE Transactions on Information Theory.

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

[13]  Troy Lee,et al.  An Approximation Algorithm for Approximation Rank , 2008, 2009 24th Annual IEEE Conference on Computational Complexity.

[14]  Jaikumar Radhakrishnan,et al.  Prior entanglement, message compression and privacy in quantum communication , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[15]  Schumacher,et al.  Noncommuting mixed states cannot be broadcast. , 1995, Physical review letters.

[16]  Rahul Jain,et al.  The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited , 2010, IEEE Transactions on Information Theory.

[17]  Dave Touchette,et al.  The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting , 2017, ITCS.

[18]  Iordanis Kerenidis,et al.  Information cost of quantum communication protocols , 2016, Quantum Inf. Comput..

[19]  R. Schumann.  Quantum Information Theory , 2000, quant-ph/0010060.

[20]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[21]  Xi Chen,et al.  How to compress interactive communication , 2010, STOC '10.

[22]  Dave Touchette,et al.  Exponential separation of quantum communication and classical information , 2016, STOC.

[23]  Troy Lee,et al.  Separations in Communication Complexity Using Cheat Sheets and Information Complexity , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[24]  Anup Rao,et al.  Simplified Separation of Information and Communication , 2015, Electron. Colloquium Comput. Complex..

[25]  Rahul Jain,et al.  Separating Quantum Communication and Approximate Rank , 2017, Computational Complexity Conference.

[26]  John Watrous,et al.  The Theory of Quantum Information , 2018 .

[27]  Michael E. Saks,et al.  Lattices, mobius functions and communications complexity , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[28]  Andrew Chi-Chih Yao,et al.  Informational complexity and the direct sum problem for simultaneous message complexity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[29]  Ronald de Wolf,et al.  Exponential Separation between Quantum Communication and Logarithm of Approximate Rank , 2018, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).