## Abstract

We study a new type of separations between quantum and classical communication complexity, separations that are obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented by small quantum circuits, with oracle access to their inputs.Our main result qualitatively matches the strongest known separation between quantum and classical communication complexity Gavinsky (2016) and is obtained using a quantum protocol where all parties are efficient. More precisely, wegive an explicit partial Boolean function f over inputs of length N, such that:(1)f can be computed by a simultaneous-message quantum protocol with communication complexity polylog(N)(where at the beginning of the protocol Alice and Bob also have polylog(N) entangled EPR pairs).(2)Any classical randomized protocol for f, with any number of rounds, has communication complexity at least Ω ~ (N^{1 / 4}).(3)All parties in the quantum protocol of Item (1) (Alice, Bob and the referee) can be implemented by quantum circuits of size polylog(N) (where Alice and Bob have oracle access to their inputs). Items (1), (2) qualitatively match the strongest known separation between quantum and classical communication complexity, proved by Gavinsky (2016). Item (3) is new. (Our result is incomparable to the one of Gavinsky. While he obtained a quantitatively better lower bound of Ω (N^{1 / 2}) in the classical case, the referee in his quantum protocol is inefficient). Exponential separations of quantum and classical communication complexity have been studied in numerous previous works, but to the best of our knowledge the efficiency of the parties in the quantum protocol has not been addressed, and in most previous separations the quantum parties seem to be inefficient. The only separations that we know of that have efficient quantum parties are the recent separations that are based on lifting Göös et al. (2017), Chattopadhyay et al. (2019a). However, these separations seem to require quantum protocols with at least two rounds of communication, so they imply a separation of two-way quantum and classical communication complexity, but they do not give the stronger separations of simultaneous-message quantum communication complexity vs. two-way classical communication complexity (or even one-way quantum communication complexity vs. two-way classical communication complexity). Our proof technique is completely new, in the context of communication complexity, and is based on techniques from Raz & Tal (2019). Our function f is based on a lift of the forrelation problem, using xor as a gadget.

Original language | English (US) |
---|---|

Article number | 17 |

Journal | Computational Complexity |

Volume | 31 |

Issue number | 2 |

DOIs | |

State | Published - Dec 2022 |

## All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Mathematics(all)
- Computational Theory and Mathematics
- Computational Mathematics

## Keywords

- 68Q11
- 68Q12
- Communication Complexity
- ExponentialSeparation
- Quantum
- Randomized