Dmitry Gavinsky
ABSTRACT
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.
- S. Aaronson. Limitations of Quantum Advice and One-Way Communication. Proceedings of the 19th IEEE Conference on Computational Complexity, pages 320–332, 2004. Google Scholar
Digital Library
- A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani. Dense Quantum Coding and Quantum Finite Automata. Journal of the ACM 49(4), pages 496–511, 2002. Google ScholarDigital Library
- Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis. Exponential Separation of Quantum and Classical One-Way Communication Complexity. Proceedings of 36th Symposium on Theory of Computing, pages 128–137, 2004. Google ScholarDigital Library
- W. Beckner. Inequalities in Fourier Analysis. Annals of Mathematics 102, pages 159–182, 1975.Google Scholar
- A. Bonami. Etude des coefficients de Fourier des fonctions de Lp(G). Annales de lˆ a ˘ A ´ ZInstitute Fourier 20(2), pages 335–402, 1970.Google Scholar
- H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum Fingerprinting. Physical Review Letters 87(16), 167902, 2001.Google ScholarCross Ref
- D. Gavinsky. Classical Interaction Cannot Replace a Quantum Message. Proceedings of the 40th Symposium on Theory of Computing, pages 95–102, 2008. Google ScholarDigital Library
- D. Gavinsky. Classical Interaction Cannot Replace Quantum Nonlocality. 12th Workshop on Quantum Information Processing, 2009.Google Scholar
- D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf. Exponential Separations for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM Journal on Computing 38(5), pages 1695–1708, 2008. Google ScholarDigital Library
- D. Gavinsky, O. Regev, and R. de Wolf. Simultaneous Communication Protocols with Quantum and Classical Messages. Chicago Journal of Theoretical Computer Science, 7, 2008.Google Scholar
- J. Kahn, G. Kalai, and N. Linial. The Influence of Variables on Boolean Functions. Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 68–80, 1988. Google ScholarDigital Library
- B. Klartag and O. Regev. Quantum One-Way Communication Can Be Exponentially Stronger than Classical Communication. Proceedings of the 43st Symposium on Theory of Computing, pages 31–40, 2011. Google ScholarDigital Library
- I. Kremer. Quantum Communication. Master’s thesis, 1995.Google Scholar
- E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997. Google ScholarDigital Library
- R. Raz. Exponential Separation of Quantum and Classical Communication Complexity. Proceedings of the 31st Symposium on Theory of Computing, pages 358–367, 1999. Google ScholarDigital Library
- A. Samorodnitsky. On the Entropy of a Noisy Function. http: // arxiv. org/ abs/ 1508. 01464, 2015.Google Scholar
Index Terms
- Entangled simultaneity versus classical interactivity in communication complexity
Recommendations
Bare Quantum simultaneity versus classical interactivity in communication complexity
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of ComputingA relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.
Entangled Simultaneity Versus Classical Interactivity in Communication Complexity
In 1999 Raz demonstrated a partial function that had an efficient <italic>quantum two-way</italic> communication protocol but no efficient <italic>classical two-way</italic> protocol and asked whether there existed a function with an efficient <italic>...
Exponential separation of quantum communication and classical information
STOC 2017: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of ComputingWe exhibit a Boolean function for which the quantum communication complexity is exponentially larger than the classical information complexity. An exponential separation in the other direction was already known from the work of Kerenidis et. al. [SICOMP ...
Comments