Bare quantum simultaneity versus classical interactivity in communication complexity

Number of the records: 1

1.

SYSNO ASEP	0525399
Document Type	C - Proceedings Paper (int. conf.)
R&D Document Type	Conference Paper
Title	Bare quantum simultaneity versus classical interactivity in communication complexity
Author(s)	Gavinsky, Dmitry (MU-W)_{RID, SAI, ORCID}
Source Title	STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. - New York : Association for Computing Machinery, 2020 / Makarychev K. ; Makarychev Y. ; Tulsiani M. ; Kamath G. ; Chuzhoy J. - ISBN 978-1-4503-6979-4
Pages	s. 401-411
Number of pages	11 s.
Publication form	Print - P
Action	52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020)
Event date	22.06.2020 - 26.06.2020
VEvent location	Chicago
Country	US - United States
Event type	WRD
Language	eng - English
Country	US - United States
Keywords	quantum communication complexity ; communication complexity models
Subject RIV	IN - Informatics, Computer Science
OECD category	Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
R&D Projects	GX19-27871X GA ČR - Czech Science Foundation (CSF)
Institutional support	MU-W - RVO:67985840
UT WOS	000614624700032
EID SCOPUS	85086768381
DOI	10.1145/3357713.3384243
Annotation	A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2021

Number of the records: 1