Quantum Communication Cannot Simulate a Public Coin
@article{Gavinsky2004QuantumCC, title={Quantum Communication Cannot Simulate a Public Coin}, author={Dmitry Gavinsky and J. Kempe and R. Wolf}, journal={ArXiv}, year={2004}, volume={quant-ph/0411051} }
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large class of efficient classical public-coin protocols can be turned into efficient quantum protocols without public coin. This raises the question whether this can be done always, i.e. whether quantum communication can always replace a public coin in the SMP model. We answer this question in the negative, exhibiting a… Expand
Topics from this paper
27 Citations
A Note on Shared Randomness and Shared Entanglement in Communication
- Mathematics, Computer Science
- ArXiv
- 2005
- 3
- PDF
The communication complexity of the Hamming distance problem
- Mathematics, Computer Science
- Inf. Process. Lett.
- 2006
- 53
- PDF
Quantum and randomized communication complexity of XOR functions in the SMP model
- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 2013
- 13
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models
- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2011
- 9
Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models
- Mathematics, Computer Science
- TAMC
- 2011
- 10
- PDF
Bounded-error quantum state identification and exponential separations in communication complexity
- Mathematics, Physics
- STOC '06
- 2006
- 40
- PDF
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems
- Mathematics, Computer Science
- ISAAC
- 2006
- 1
- PDF
Classical and quantum fingerprinting with shared randomness and one-sided error
- Computer Science, Physics
- Quantum Inf. Comput.
- 2005
- 6
- PDF
References
SHOWING 1-10 OF 23 REFERENCES
Exponential separation of quantum and classical one-way communication complexity
- Mathematics, Computer Science
- STOC '04
- 2004
- 120
- PDF
On quantum and probabilistic communication: Las Vegas and one-way protocols
- Mathematics, Computer Science
- STOC '00
- 2000
- 81
Randomized simultaneous messages: solution of a problem of Yao in communication complexity
- Computer Science
- Proceedings of Computational Complexity. Twelfth Annual IEEE Conference
- 1997
- 71
- PDF
Public vs. private coin flips in one round communication games (extended abstract)
- Mathematics, Computer Science
- STOC '96
- 1996
- 68
On the power of quantum fingerprinting
- Mathematics, Computer Science
- STOC '03
- 2003
- 50
- Highly Influential
- PDF
Optimal lower bounds for quantum automata and random access codes
- Mathematics, Computer Science
- 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
- 1999
- 279
- PDF
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
- Computer Science
- FSTTCS
- 2001
- 92