{
  "annotation_id": "1a16e273-fa63-4808-bc53-52bbab4c9388",
  "date_created": "2026-03-02T18:01:42.069000Z",
  "date_modified": "2026-03-02T18:01:42.069000Z",
  "file_hash": "b0022f820ddbfbcb9da05edeee0d24ec8dee10e6dc088afcbd4240cb6db149f0",
  "private": false,
  "record": {
    "abstract": "Classical fingerprinting associates with each string a shorter string (its\nfingerprint), such that, with high probability, any two distinct strings can be\ndistinguished by comparing their fingerprints alone. The fingerprints can be\nexponentially smaller than the original strings if the parties preparing the\nfingerprints share a random key, but not if they only have access to\nuncorrelated random sources. In this paper we show that fingerprints consisting\nof quantum information can be made exponentially smaller than the original\nstrings without any correlations or entanglement between the parties: we give a\nscheme where the quantum fingerprints are exponentially shorter than the\noriginal strings and we give a test that distinguishes any two unknown quantum\nfingerprints with high probability. Our scheme implies an exponential\nquantum/classical gap for the equality problem in the simultaneous message\npassing model of communication complexity. We optimize several aspects of our\nscheme.",
    "arxiv_id": "quant-ph/0102001",
    "authors": [
      "Harry Buhrman",
      "Richard Cleve",
      "John Watrous",
      "Ronald de Wolf"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.87.167902",
    "title": "Quantum fingerprinting",
    "url": "https://arxiv.org/abs/quant-ph/0102001"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8f5e8c33-d5db-4a6a-8365-23d268530ed1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}