A note on the power of quantum fingerprinting
Alexander Golynski, Pranab Sen

TL;DR
This paper enhances the understanding of quantum fingerprinting by improving and extending Yao's work on simulating classical protocols with quantum ones without shared resources.
Contribution
It introduces new methods to simulate classical public coin protocols using quantum protocols without shared entanglement, advancing quantum communication theory.
Findings
Quantum fingerprinting can simulate classical protocols more efficiently.
The paper demonstrates protocols with no shared resources outperform previous models.
It broadens the theoretical foundation of quantum communication complexity.
Abstract
In this short note, we improve and extend Yao's paper "On the power of quantum fingerprinting" about simulating a classical public coin simultaneous message protocol by a quantum simultaneous message protocol with no shared resource.
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
