{
  "annotation_id": "24758628-b7c8-49a9-b043-352a758c0c21",
  "date_created": "2026-03-02T18:02:13.828000Z",
  "date_modified": "2026-03-02T18:02:13.828000Z",
  "file_hash": "f81ff7f15914f05c6ce407b1b9da4489a0b1ec567fbf2c783ee0aee47787d5d0",
  "private": false,
  "record": {
    "abstract": "Within the simultaneous message passing model of communication complexity,\nunder a public-coin assumption, we derive the minimum achievable worst-case\nerror probability of a classical fingerprinting protocol with one-sided error.\nWe then present entanglement-assisted quantum fingerprinting protocols\nattaining worst-case error probabilities that breach this bound.",
    "arxiv_id": "quant-ph/0501021",
    "authors": [
      "Rolf T. Horn",
      "A. J. Scott",
      "Jonathan Walgate",
      "Richard Cleve",
      "A. I. Lvovsky",
      "Barry C. Sanders"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Quantum Inf. Comput. 5, 258 (2005)",
    "title": "Classical and quantum fingerprinting with shared randomness and   one-sided error",
    "url": "https://arxiv.org/abs/quant-ph/0501021"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a0ee621a-e597-482a-8c47-a86abe5a702c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}