Entangled Simultaneity Versus Classical Interactivity in Communication Complexity

In 1999 Raz demonstrated a partial function that had an efficient quantum two-way communication protocol but no efficient classical two-way protocol and asked, whether there existed a function with an efficient quantum one-way protocol, but still no efficient classical two-way protocol. In 2010 Klartag and Regev demonstrated such a function and asked, whether there existed a function with an efficient quantum simultaneous-messages protocol, but still no efficient classical two-way protocol. In this work we answer the latter question affirmatively and present a partial function Shape, which can be computed by a protocol sending entangled simultaneous messages of poly-logarithmic size, and whose classical two-way complexity is lower bounded by a polynomial.

[1]  Ronald de Wolf,et al.  Simultaneous Communication Protocols with Quantum and Classical Messages , 2008, Chic. J. Theor. Comput. Sci..

[2]  Ran Raz,et al.  Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography , 2008, SIAM J. Comput..

[3]  Nathan Linial,et al.  The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[4]  Ziv Bar-Yossef,et al.  Exponential separation of quantum and classical one-way communication complexity , 2004, STOC '04.

[5]  A. Bonami.  Étude des coefficients de Fourier des fonctions de $L^p(G)$ , 1970 .

[6]  Dmitry Gavinsky.  Classical Interaction Cannot Replace Quantum Nonlocality , 2009, 0901.0956.

[7]  W. Beckner.  Inequalities in Fourier analysis , 1975 .

[8]  Ran Raz,et al.  Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography , 2008, SIAM J. Comput..

[9]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[10]  Bo'az Klartag,et al.  Quantum one-way communication can be exponentially stronger than classical communication , 2011, STOC '11.

[11]  Nicolas Gisin,et al.  Quantum communication , 2017, 2017 Optical Fiber Communications Conference and Exhibition (OFC).

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

[13]  Alex Samorodnitsky,et al.  On the Entropy of a Noisy Function , 2015, IEEE Transactions on Information Theory.

[14]  Dmitry Gavinsky,et al.  Classical interaction cannot replace a quantum message , 2007, STOC.

[15]  R. Cleve,et al.  Quantum fingerprinting. , 2001, Physical review letters.

[16]  Ran Raz,et al.  Exponential separation of quantum and classical communication complexity , 1999, STOC '99.

[17]  Scott Aaronson,et al.  Limitations of quantum advice and one-way communication , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..