Quantum versus Randomized Communication Complexity, with Efficient Players

We study a new type of separation between quantum and classical communication complexity which is obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented by small quantum circuits with oracle access to their inputs. More precisely, we give an explicit partial Boolean function that can be computed in the quantum-simultaneous-with-entanglement model of communication, however, every interactive randomized protocol is of exponentially larger cost. Furthermore, all the parties in the quantum protocol can be implemented by quantum circuits of small size with blackbox access to the inputs. Our result qualitatively matches the strongest known separation between quantum and classical communication complexity and is obtained using a quantum protocol where all parties are efficient.

[1]  Ran Raz,et al.  Fourier analysis for probabilistic communication complexity , 1995, computational complexity.

[2]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

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

[4]  Shachar Lovett,et al.  Pseudorandom Generators from Polarizing Random Walks , 2018, Electron. Colloquium Comput. Complex..

[5]  Shachar Lovett,et al.  Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates , 2018, Electron. Colloquium Comput. Complex..

[6]  Ran Raz,et al.  Oracle separation of BQP and PH , 2019, Electron. Colloquium Comput. Complex..

[7]  Toniann Pitassi,et al.  Query-to-Communication Lifting for BPP , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[8]  Andris Ambainis,et al.  Forrelation: A Problem That Optimally Separates Quantum from Classical Computing , 2018, SIAM J. Comput..

[9]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[10]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[11]  Shachar Lovett,et al.  Structure of Protocols for XOR Functions , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[12]  Dmitry Gavinsky,et al.  Entangled Simultaneity Versus Classical Interactivity in Communication Complexity , 2016, IEEE Transactions on Information Theory.

[13]  Peter W. Shor,et al.  Polynominal time algorithms for discrete logarithms and factoring on a quantum computer , 1994, ANTS.

[14]  Ziv Bar-Yossef,et al.  Exponential Separation of Quantum and Classical One-Way Communication Complexity , 2008, SIAM J. Comput..

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

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

[17]  Or Meir,et al.  Query-to-communication lifting for BPP using inner product , 2019, ICALP.