Quantum versus classical simultaneity in communication complexity

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Quantum versus classical simultaneity in communication complexity

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Quantum versus classical simultaneity in communication complexity

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GX19-27871X" target="_blank" >GX19-27871X: Efektivní aproximační algoritmy a obvodová složitost</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2019

Kód důvěrnosti údajů

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

Název periodika

IEEE Transactions on Information Theory

ISSN

0018-9448

e-ISSN

—

Svazek periodika

65

Číslo periodika v rámci svazku

10

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

18

Strana od-do

6466-6483

Kód UT WoS článku

000487041200029

EID výsledku v databázi Scopus

2-s2.0-85077399406