Abstract
We study a new type of separations between quantum and classical communication complexity, separations that are 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. Our main result qualitatively matches the strongest known separation between quantum and classical communication complexity Gavinsky (2016) and is obtained using a quantum protocol where all parties are efficient. More precisely, we give an explicit partial Boolean function f over inputs of length N, such that:
-
(1)
f can be computed by a simultaneous-message quantum protocol with communication complexity polylog(N) (where at the beginning of the protocol Alice and Bob also have polylog(N) entangled EPR pairs).
-
(2)
Any classical randomized protocol for f, with any number of rounds, has communication complexity at least \(\tilde{\Omega}\left(N^{1/4}\right)\).
-
(3)
All parties in the quantum protocol of Item (1) (Alice, Bob and the referee) can be implemented by quantum circuits of size polylog(N) (where Alice and Bob have oracle access to their inputs).
Items (1), (2) qualitatively match the strongest known separation between quantum and classical communication complexity, proved by Gavinsky (2016). Item (3) is new. (Our result is incomparable to the one of Gavinsky. While he obtained a quantitatively better lower bound of \(\Omega\left(N^{1/2}\right)\) in the classical case, the referee in his quantum protocol is inefficient).
Exponential separations of quantum and classical communication complexity have been studied in numerous previous works, but to the best of our knowledge the efficiency of the parties in the quantum protocol has not been addressed, and in most previous separations the quantum parties seem to be inefficient. The only separations that we know of that have efficient quantum parties are the recent separations that are based on lifting Göös et al. (2017), Chattopadhyay et al. (2019a). However, these separations seem to require quantum protocols with at least two rounds of communication, so they imply a separation of two-way quantum and classical communication complexity, but they do not give the stronger separations of simultaneous-message quantum communication complexity vs. two-way classical communication complexity (or even one-way quantum communication complexity vs. two-way classical communication complexity).
Our proof technique is completely new, in the context of communication complexity, and is based on techniques from Raz & Tal (2019). Our function f is based on a lift of the forrelation problem, using xor as a gadget.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Scott Aaronson (2010). BQP and the Polynomial Hierarchy. In Proceedings of the 42nd ACM Symposium on Theory of Computing, Cambridge, Massachusetts, USA, 5–8 June 2010, 141–150. ACM.
Scott Aaronson (2010). BQP and the Polynomial Hierarchy. In Proceedings of the 42nd ACM Symposium on Theory of Computing, Cambridge, Massachusetts, USA, 5–8 June 2010, 141–150. ACM. Scott Aaronson & Andris Ambainis (2015). Forrelation: A Problem that Optimally Separates Quantum from Classical Computing. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, Portland, OR, USA, June 14–17, 2015, 307–316. ACM.
Ziv Bar-Yossef, T. S. Jayram & Iordanis Kerenidis (2004). Exponential Separation of Quantum and Classical One-way Communication Complexity. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13–16, 2004, 128–137. ACM.
Harry Buhrman, Richard Cleve & Avi Wigderson (1998). Quantum vs. Classical Communication and Computation. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23–26, 1998, 63–68. ACM.
Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir & Toniann Pitassi (2019a). Query-To-Communication Lifting for BPP Using Inner Product. In 46th International Colloquium on Automata, Languages, and Programming, July 9–12, 2019, Patras, Greece, volume 132 of LIPIcs, 35:1–35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini & Shachar Lovett (2018). Pseudorandom Generators from Polarizing Random Walks. In 33rd Computational Complexity Conference, June 22–24, 2018, San Diego, CA, USA, volume 102 of LIPIcs, 1:1–1:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett & Avishay Tal (2019b). Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. In 10th Innovations in Theoretical Computer Science Conference, January 10–12, 2019, San Diego, California, USA, volume 124 of LIPIcs, 22:1–22:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Dmitry Gavinsky (2016). Entangled Simultaneity versus Classical Interactivity in Communication Complexity. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, Cambridge, MA, USA, June 18–21, 2016, 877–884. ACM.
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz & Ronald de Wolf (2007). Exponential Separations for One-way Quantum Communication Complexity, with applications to cryptography. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11–13, 2007, 516–525. ACM.
Mika Göös, Toniann Pitassi & Thomas Watson (2017). Query-to- Communication Lifting for BPP. In 58th IEEE Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, October 15–17, 2017, 132–143. IEEE Computer Society.
Hamed Hatami, Kaave Hosseini & Shachar Lovett (2016). Structure of Protocols for XOR Functions. In IEEE 57th Annual Symposium on Foundations of Computer Science, 9–11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, 282–288. IEEE Computer Society.
Ryan O’Donnell (2014). Analysis of Boolean Functions. Cambridge University Press 2014. ISBN 978-1-10-703832-5, pp. I–XX, 1–423.
Ran Raz (1995). Fourier Analysis for Probabilistic Communication Complexity. Comput. Complex. 5(3/4), 205–221.
Ran Raz (1999). Exponential Separation of Quantum and Classical Communication Complexity. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, May 1–4, 1999, Atlanta, Georgia, USA, 358–367. ACM.
Ran Raz & Avishay Tal (2019). Oracle Separation of BQP and PH. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, USA, June 23–26, 2019, 13–23. ACM.
Oded Regev & Bo’az Klartag (2011). Quantum One-way Communication can be Exponentially Stronger than Classical Communication. In Proceedings of the 43rd ACM Symposium on Theory of Computing, San Jose, CA, USA, 6–8 June 2011, 31–40. ACM.
Acknowledgements
The first two authors are supported by the Simons Collaboration on Algorithms and Geometry, by a Simons Investigator Award, by the National Science Foundation Grants No. CCF-1714779 and 2007462. The third author is partially supported by a Motwani Postdoctoral Fellowship and by NSF Grant CCF-1763311.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Girish, U., Raz, R. & Tal, A. Quantum versus Randomized Communication Complexity, with Efficient Players. comput. complex. 31, 17 (2022). https://doi.org/10.1007/s00037-022-00232-7
Received:
Published:
DOI: https://doi.org/10.1007/s00037-022-00232-7