Quantum Communication Complexity
Hartmut Klauck
TL;DR
This survey reviews recent advances in quantum communication complexity, highlighting its connections to classical methods, lower bounds, one-way communication, and practical applications.
Contribution
It compiles and discusses recent key results in quantum communication complexity, emphasizing its relation to classical approaches and potential applications.
Findings
Quantum communication can outperform classical methods in certain problems.
Lower bound techniques are crucial for understanding quantum communication limits.
Applications of quantum communication complexity include cryptography and distributed computing.
Abstract
This paper surveys the field of quantum communication complexity. Some interesting recent results are collected concerning relations to classical communication, lower bound methods, one-way communication, and applications of quantum communication complexity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications