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

Simple item page
dc.creatorHorn, Rolf T.
dc.creatorScott, A. J.
dc.creatorWalgate, Jonathan
dc.creatorCleve, Richard
dc.creatorLvovsky, A. I.
dc.creatorSanders, Barry C.
dc.date2005-01-05
dc.date2005-05-30
dc.date.accessioned2026-07-07T06:26:39Z
dc.date.available2026-07-07T06:26:39Z
dc.descriptionWithin 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.
dc.description10 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/quant-ph/0501021
dc.identifierhttp://arxiv.org/abs/quant-ph/0501021
dc.identifierQuantum Inf. Comput. 5, 258 (2005)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/97173
dc.subjectQuantum Physics
dc.titleClassical and quantum fingerprinting with shared randomness and one-sided error
dc.typetext

Files

Collections

arXiv