{
  "annotation_id": "50f3f015-d1ec-47d5-a5dd-e7b4eeec63ec",
  "date_created": "2026-03-02T18:01:42.010000Z",
  "date_modified": "2026-03-02T18:01:42.010000Z",
  "file_hash": "7ce48ed4e07c7c09791c9eefc942255356235ddf876db21223b9d17301615490",
  "private": false,
  "record": {
    "abstract": "Typical address-oriented computer memories cannot recognize incomplete or\nnoisy information. Associative (content-addressable) memories solve this\nproblem but suffer from severe capacity shortages. I propose a model of a\nquantum memory that solves both problems. The storage capacity is exponential\nin the number of qbits and thus optimal. The retrieval mechanism for incomplete\nor noisy inputs is probabilistic, with postselection of the measurement result.\nThe output is determined by a probability distribution on the memory which is\npeaked around the stored patterns closest in Hamming distance to the input.",
    "arxiv_id": "quant-ph/0012100",
    "authors": [
      "Carlo A. Trugenberger"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.87.067901",
    "title": "Probabilistic Quantum Memories",
    "url": "https://arxiv.org/abs/quant-ph/0012100"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7df45c2d-28c1-463b-ab66-9566971007f1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}