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_____%2F20%3A00525399" target="_blank" >RIV/67985840:_____/20:00525399 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1145/3357713.3384243" target="_blank" >http://dx.doi.org/10.1145/3357713.3384243</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3357713.3384243" target="_blank" >10.1145/3357713.3384243</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
D - Article in proceedings
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
2020
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
Article name in the collection
STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
ISBN
978-1-4503-6979-4
ISSN
—
e-ISSN
—
Number of pages
11
Pages from-to
401-411
Publisher name
Association for Computing Machinery
Place of publication
New York
Event location
Chicago
Event date
Jun 22, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000614624700032