Arrow Research search
Back to STOC

STOC 2020

Bare quantum simultaneity versus classical interactivity in communication complexity

Conference Paper Session 3B: Quantum (Inspired) Computation Algorithms and Complexity ยท Theoretical Computer Science

Abstract

A relational bipartite communication problem is presented that has an efficient quantum simultaneous-messages protocol, but no efficient classical two-way protocol.

Authors

Keywords

  • communication complexity models
  • quantum communication complexity

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
1000366318053685825