Corpus ID: 58812

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
27 Citations
A Note on Shared Randomness and Shared Entanglement in Communication
  • 3
  • PDF
The communication complexity of the Hamming distance problem
  • 53
  • PDF
Quantum and randomized communication complexity of XOR functions in the SMP model
  • Y. Liu, S. Zhang
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2013
  • 13
Quantum sketching protocols for Hamming distance and beyond
  • 2
  • PDF
Tight bounds on the randomized communication complexity of symmetric XOR functions in one-way and SMP models
  • 9
Bounded-error quantum state identification and exponential separations in communication complexity
  • 40
  • PDF
On the communication complexity of XOR functions
  • 49
  • PDF
Classical and quantum fingerprinting with shared randomness and one-sided error
  • 6
  • PDF
...
1
2
3
...

References

SHOWING 1-10 OF 23 REFERENCES
Exponential separation of quantum and classical one-way communication complexity
  • 120
  • PDF
On quantum and probabilistic communication: Las Vegas and one-way protocols
  • H. Klauck
  • Mathematics, Computer Science
  • STOC '00
  • 2000
  • 81
Randomized simultaneous messages: solution of a problem of Yao in communication complexity
  • L. Babai, P. G. Kimmel
  • 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)
  • 68
Quantum communication and complexity
  • R. Wolf
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2002
  • 88
On the power of quantum fingerprinting
  • A. Yao
  • Mathematics, Computer Science
  • STOC '03
  • 2003
  • 50
  • Highly Influential
  • PDF
A note on the power of quantum fingerprinting
  • 3
  • Highly Influential
  • PDF
Optimal lower bounds for quantum automata and random access codes
  • A. Nayak
  • Mathematics, Computer Science
  • 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
  • 279
  • PDF
Quantum fingerprinting.
  • 558
  • PDF
...
1
2
3
...