Computer Science – Computational Complexity
Scientific paper
2010-09-19
Computer Science
Computational Complexity
Scientific paper
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.
Klartag Bo'az
Regev Oded
No associations
LandOfFree
Quantum One-Way Communication is Exponentially Stronger Than Classical Communication does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Quantum One-Way Communication is Exponentially Stronger Than Classical Communication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum One-Way Communication is Exponentially Stronger Than Classical Communication will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-408803