Entangled simultaneity versus classical interactivity in communication complexity

DOI10.1145/2897518.2897545zbMath1373.68226arXiv1602.05059OpenAlexW2274974221MaRDI QIDQ5361887

Dmitry Gavinsky

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.05059

zbMATH Keywords

quantum communication complexitymodel separation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness ⋮ Query-to-Communication Lifting for BPP ⋮ Quantum versus randomized communication complexity, with efficient players

This page was built for publication: Entangled simultaneity versus classical interactivity in communication complexity