Quantum Versus Classical Simultaneity in Communication Complexity
Quantum Versus Classical Simultaneity in Communication Complexity
复制标题
通信复杂性中的量子与经典同时性
DOI:
10.1109/tit.2019.2918453
复制
发表时间:
2017
影响因子:
2.5
通讯作者:
Dmitry Gavinsky
中科院分区:
文献类型:
--
作者:
Dmitry Gavinsky
This paper addresses two problems in the context of two-party communication complexity of functions. First, it concludes the line of research which can be viewed as demonstrating qualitative advantage of quantum communication in the three most common communication “layouts”: two-way interactive communication, one-way communication and simultaneous message passing (SMP). I demonstrate a functional problem <inline-formula> <tex-math notation="LaTeX">$ { \widetilde {cEq}_{T}}$ </tex-math></inline-formula>, whose communication complexity is <inline-formula> <tex-math notation="LaTeX">$O\left ({(\log n)^{2}}\right )$ </tex-math></inline-formula> in the quantum version of the SMP and <inline-formula> <tex-math notation="LaTeX">$\tilde \Omega \left ({ \sqrt {n}}\right )$ </tex-math></inline-formula> in the classical (randomized) version of SMP. Second, this paper contributes to understanding the power of the weakest commonly studied regime of quantum communication–SMP with quantum messages and without shared randomness (the latter restriction can be viewed as a somewhat artificial way of making the quantum model “as weak as possible”). Our function <inline-formula> <tex-math notation="LaTeX">$ { \widetilde {cEq}_{T}}$ </tex-math></inline-formula> has an efficient solution in this regime as well, which means that even lacking shared randomness, quantum SMP can be exponentially stronger than its classical counterpart with shared randomness.