Recognition: unknown
Classical and quantum fingerprinting with shared randomness and one-sided error
classification
🪐 quant-ph
keywords
errorfingerprintingclassicalone-sidedquantumworst-caseachievableassumption
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.