### 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 (US) |
---|---|

Title of host publication | STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing |

Pages | 31-40 |

Number of pages | 10 |

DOIs | |

State | Published - 2011 |

Event | 43rd ACM Symposium on Theory of Computing, STOC'11 - San Jose, CA, United States Duration: Jun 6 2011 → Jun 8 2011 |

### Other

Other | 43rd ACM Symposium on Theory of Computing, STOC'11 |
---|---|

Country | United States |

City | San Jose, CA |

Period | 6/6/11 → 6/8/11 |

### Fingerprint

### Keywords

- communication complexity
- hypercontractive inequality
- sampling
- sphere

### ASJC Scopus subject areas

- Software

### Cite this

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

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

*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

}

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 -