Abstract
In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating only O(log n) qubits, but for which any classical (randomized, bounded-error) protocol requires poly(n) bits of communication. That quantum protocol requires two rounds of communication. Ever since Raz's paper it was open whether the same exponential separation can be achieved with a quantum protocol that uses only one round of communication. Here we settle this question in the affirmative.
Original language | English |
---|---|
Title of host publication | STOC'11 |
Subtitle of host publication | Proceedings of the 43rd ACM Symposium on Theory of Computing |
Publisher | Association for Computing Machinery (ACM) |
Pages | 31-40 |
Number of pages | 10 |
ISBN (Print) | 9781450306911 |
DOIs | |
State | Published - 4 Jul 2011 |
Event | 43rd ACM Symposium on Theory of Computing - San Jose, CA, San Jose, United States Duration: 6 Jun 2011 → 8 Jun 2011 Conference number: 43rd |
Publication series
Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|
ISSN (Print) | 0737-8017 |
Conference
Conference | 43rd ACM Symposium on Theory of Computing |
---|---|
Abbreviated title | STOC 11 |
Country/Territory | United States |
City | San Jose |
Period | 6/06/11 → 8/06/11 |
Keywords
- communication complexity
- hypercontractive inequality
- sampling
- sphere
All Science Journal Classification (ASJC) codes
- Software