Bare quantum simultaneity versus classical interactivity in communication complexity
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F21%3A00545830" target="_blank" >RIV/67985840:_____/21:00545830 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1109/TIT.2021.3050528" target="_blank" >https://doi.org/10.1109/TIT.2021.3050528</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TIT.2021.3050528" target="_blank" >10.1109/TIT.2021.3050528</a>
Alternative languages
Result language
angličtina
Original language name
Bare quantum simultaneity versus classical interactivity in communication complexity
Original language description
A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.
Czech name
—
Czech description
—
Classification
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)
Result continuities
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
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Transactions on Information Theory
ISSN
0018-9448
e-ISSN
1557-9654
Volume of the periodical
67
Issue of the periodical within the volume
10
Country of publishing house
US - UNITED STATES
Number of pages
23
Pages from-to
6583-6605
UT code for WoS article
000696077200023
EID of the result in the Scopus database
2-s2.0-85099594953