### 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 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

ISSN (Print) | 0737-8017 |

### 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 |

### Keywords

- communication complexity
- hypercontractive inequality
- sampling
- sphere

### ASJC Scopus subject areas

- Software

## Fingerprint Dive into the research topics of 'Quantum one-way communication can be exponentially stronger than classical communication'. Together they form a unique fingerprint.

## 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). (Proceedings of the Annual ACM Symposium on Theory of Computing). https://doi.org/10.1145/1993636.1993642