Quantum one-way communication can be exponentially stronger than classical communication

Bo'az Klartag, Oded Regev

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationSTOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing
Pages31-40
Number of pages10
DOIs
StatePublished - 2011
Event43rd ACM Symposium on Theory of Computing, STOC'11 - San Jose, CA, United States
Duration: Jun 6 2011Jun 8 2011

Other

Other43rd ACM Symposium on Theory of Computing, STOC'11
CountryUnited States
CitySan Jose, CA
Period6/6/116/8/11

Fingerprint

Communication

Keywords

  • communication complexity
  • hypercontractive inequality
  • sampling
  • sphere

ASJC Scopus subject areas

  • Software

Cite this

Klartag, B., & Regev, O. (2011). Quantum one-way communication can be exponentially stronger than classical communication. In STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing (pp. 31-40) https://doi.org/10.1145/1993636.1993642

Quantum one-way communication can be exponentially stronger than classical communication. / Klartag, Bo'az; Regev, Oded.

STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing. 2011. p. 31-40.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Klartag, B & Regev, O 2011, Quantum one-way communication can be exponentially stronger than classical communication. in STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing. pp. 31-40, 43rd ACM Symposium on Theory of Computing, STOC'11, San Jose, CA, United States, 6/6/11. https://doi.org/10.1145/1993636.1993642
Klartag B, Regev O. Quantum one-way communication can be exponentially stronger than classical communication. In STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing. 2011. p. 31-40 https://doi.org/10.1145/1993636.1993642
Klartag, Bo'az ; Regev, Oded. / Quantum one-way communication can be exponentially stronger than classical communication. STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing. 2011. pp. 31-40
@inproceedings{545a170b2ce34e838bfde481c1ed3fef,
title = "Quantum one-way communication can be exponentially stronger than classical communication",
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.",
keywords = "communication complexity, hypercontractive inequality, sampling, sphere",
author = "Bo'az Klartag and Oded Regev",
year = "2011",
doi = "10.1145/1993636.1993642",
language = "English (US)",
isbn = "9781450306911",
pages = "31--40",
booktitle = "STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing",

}

TY - GEN

T1 - Quantum one-way communication can be exponentially stronger than classical communication

AU - Klartag, Bo'az

AU - Regev, Oded

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - communication complexity

KW - hypercontractive inequality

KW - sampling

KW - sphere

UR - http://www.scopus.com/inward/record.url?scp=79959696265&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959696265&partnerID=8YFLogxK

U2 - 10.1145/1993636.1993642

DO - 10.1145/1993636.1993642

M3 - Conference contribution

AN - SCOPUS:79959696265

SN - 9781450306911

SP - 31

EP - 40

BT - STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing

ER -