Počet záznamů: 1
Quantum versus classical simultaneity in communication complexity
- 1.
SYSNO ASEP 0509379 Druh ASEP J - Článek v odborném periodiku Zařazení RIV J - Článek v odborném periodiku Poddruh J Článek ve WOS Název Quantum versus classical simultaneity in communication complexity Tvůrce(i) Gavinsky, Dmitry (MU-W) RID, SAI, ORCID Zdroj.dok. IEEE Transactions on Information Theory. - : Institute of Electrical and Electronics Engineers - ISSN 0018-9448
Roč. 65, č. 10 (2019), s. 6466-6483Poč.str. 18 s. Jazyk dok. eng - angličtina Země vyd. US - Spojené státy americké Klíč. slova communication complexity ; quantum communication ; quantum computing Vědní obor RIV BA - Obecná matematika Obor OECD Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) CEP GX19-27871X GA ČR - Grantová agentura ČR Způsob publikování Omezený přístup Institucionální podpora MU-W - RVO:67985840 UT WOS 000487041200029 EID SCOPUS 85077399406 DOI 10.1109/TIT.2019.2918453 Anotace 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. Pracoviště Matematický ústav Kontakt Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757 Rok sběru 2020 Elektronická adresa http://dx.doi.org/10.1109/TIT.2019.2918453
Počet záznamů: 1