{
  "annotation_id": "abac35e6-e3da-42cb-8d94-000817028709",
  "date_created": "2026-03-02T18:01:46.203000Z",
  "date_modified": "2026-03-02T18:01:46.203000Z",
  "file_hash": "2165b730424d29465099f386ca524912fe697c8513de42b326f5ce59ee749cdf",
  "private": false,
  "record": {
    "abstract": "An algorithm for structured database searching is presented and used to solve\nthe set partition problem. O(n) oracle calls are required in order to obtain a\nsolution, but the probability that this solution is optimal decreases\nexponentially with problem size. Each oracle call is followed by a measurement,\nimplying that it is necessary to maintain quantum coherence for only one oracle\ncall at a time.",
    "arxiv_id": "quant-ph/0106152",
    "authors": [
      "Brian Murphy"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Novel Approach to Quantum Heuristics for Structured Database Search",
    "url": "https://arxiv.org/abs/quant-ph/0106152"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d266ce7f-fa7e-4582-bfcf-18ba136d520e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}