Quantum Fingerprinting
Top Cited Papers
- 26 September 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 87 (16) , 167902
- https://doi.org/10.1103/physrevlett.87.167902
Abstract
Classical fingerprinting associates with each string a shorter string (its fingerprint), such that any two distinct strings can be distinguished with small error by comparing their fingerprints alone. The fingerprints cannot be made exponentially smaller than the original strings unless the parties preparing the fingerprints have access to correlated random sources. We show that fingerprints consisting of quantum information can be made exponentially smaller than the original strings without any correlations or entanglement between the parties. This implies an exponential quantum/classical gap for the equality problem in the simultaneous message passing model of communication complexity.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Cost of Exactly Simulating Quantum Entanglement with Classical CommunicationPhysical Review Letters, 1999
- Stabilization of Quantum Computations by SymmetrizationSIAM Journal on Computing, 1997
- Communication ComplexityPublished by Elsevier ,1997
- Communication complexity in a 3-computer modelAlgorithmica, 1996
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphsIEEE Transactions on Information Theory, 1992
- Forbidden intersectionsTransactions of the American Mathematical Society, 1987
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972
- Detection theory and quantum mechanicsInformation and Control, 1967