Classical and quantum fingerprinting with shared randomness and one-sided error

Authors:
Rolf T. Horn;A. J. Scott;Jonathan Walgate;Richard Cleve;A. I. Lvovsky;Barry C. Sanders
Affiliations:
Institute for Quantum Information Science, University of Calgary, Calgary, Alberta, Canada;Institute for Quantum Information Science, University of Calgary, Calgary, Alberta, Canada;Institute for Quantum Information Science, University of Calgary, Calgary, Alberta, Canada;Institute for Quantum Information Science, University of Calgary, Calgary, Alberta, Canada and Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario, Canada;Institute for Quantum Information Science, University of Calgary, Calgary, Alberta, Canada;Institute for Quantum Information Science, University of Calgary, Calgary, Alberta, Canada
Venue:
Quantum Information & Computation
Year:
2005

Citing 6
Cited 1

Private vs. common random bits in communication complexity

Information Processing Letters
Public vs. private coin flips in one round communication games (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity

Communication complexity
On the power of quantum fingerprinting

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some complexity questions related to distributive computing(Preliminary Report)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Optimal fingerprinting strategies with one-sided error

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Within the simultaneous message passing model of communication complexity, under a public-coin assumption, we derive the minimum achievable worst-case error probability of a classical fingerprinting protocol with one-sided error. We then present entanglement-assisted quantum fingerprinting protocols attaining worst-case error probabilities that breach this bound.