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.Comment: 10 pages, 1 figur