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

Bo'az Klartag; Oded Regev

doi:https://doi.org/10.1145/1993636.1993642

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

Bo'az Klartag, Oded Regev

School of Mathematical Sciences

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 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	https://doi.org/10.1145/1993636.1993642
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

Access to Document

https://doi.org/10.1145/1993636.1993642License: Unspecified

Cite this

@inproceedings{b4011d3656d94ca6b907b5dded9bfc11,

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",

note = "We thank Dmitry Gavinsky, Mehdi Mhalla, and Ronald de Wolf for comments on an earlier draft. First author Supported in part by the Israel Science Foundation and by a Marie Curie Reintegration Grant from the Commission of the European Communities. Second author Supported by the Israel Science Foundation, by the Wolfson Family Charitable Trust, and by a European Research Council (ERC) Starting Grant. Part of the work done while a DIGITEO visitor in LRI, Orsay.; 43rd ACM Symposium on Theory of Computing ; Conference date: 06-06-2011 Through 08-06-2011",

year = "2011",

month = jul,

day = "4",

doi = "https://doi.org/10.1145/1993636.1993642",

language = "الإنجليزيّة",

isbn = "9781450306911",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery (ACM)",

pages = "31--40",

booktitle = "STOC'11",

address = "الولايات المتّحدة",

}

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. Proceedings of the Annual ACM Symposium on Theory of Computing, Association for Computing Machinery (ACM), pp. 31-40, 43rd ACM Symposium on Theory of Computing, San Jose, California, United States, 6/06/11. 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. Association for Computing Machinery (ACM), 2011. p. 31-40 (Proceedings of the Annual ACM Symposium on Theory of Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Klartag, Bo'az

AU - Regev, Oded

N1 - Conference code: 43rd

PY - 2011/7/4

Y1 - 2011/7/4

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

U2 - https://doi.org/10.1145/1993636.1993642

DO - https://doi.org/10.1145/1993636.1993642

M3 - منشور من مؤتمر

SN - 9781450306911

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 31

EP - 40

BT - STOC'11

PB - Association for Computing Machinery (ACM)

T2 - 43rd ACM Symposium on Theory of Computing

Y2 - 6 June 2011 through 8 June 2011

ER -

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

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this