Quantum versus classical simultaneity in communication complexity

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F19%3A00509379" target="_blank" >RIV/67985840:_____/19:00509379 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/TIT.2019.2918453" target="_blank" >http://dx.doi.org/10.1109/TIT.2019.2918453</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TIT.2019.2918453" target="_blank" >10.1109/TIT.2019.2918453</a>

Result language
angličtina
Original language name
Quantum versus classical simultaneity in communication complexity
Original language description
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 (cEqT) over tilde, whose communication complexity is O ((log n)(2)) in the quantum version of the SMP and (Omega) over tilde(root n) 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 (cEqT) over tilde 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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GX19-27871X" target="_blank" >GX19-27871X: Efficient approximation algorithms and circuit complexity</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)