{
  "annotation_id": "d112da54-57df-41dd-ae9c-1f8bdce6958b",
  "date_created": "2026-03-02T18:02:37.499000Z",
  "date_modified": "2026-03-02T18:02:37.499000Z",
  "file_hash": "f0746ba3329dc382f6745e940e597f09b04277bda2fc32c1012aa6528141f52a",
  "private": false,
  "record": {
    "abstract": "A quantum algorithm for general combinatorial search that uses the underlying\nstructure of the search space to increase the probability of finding a solution\nis presented. This algorithm shows how coherent quantum systems can be matched\nto the underlying structure of abstract search spaces, and is analytically\nsimpler than previous structured search methods. The algorithm is evaluated\nempirically with a variety of search problems, and shown to be particularly\neffective for searches with many constraints. Furthermore, the algorithm\nprovides a simple framework for utilizing search heuristics. It also exhibits\nthe same phase transition in search difficulty as found for sophisticated\nclassical search methods, indicating it is effectively using the problem\nstructure.",
    "arxiv_id": "quant-ph/9701013",
    "authors": [
      "Tad Hogg"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/S0167-2789(98)00047-5",
    "journal_ref": "Physica D120 (1998) 102-116",
    "title": "A Framework for Structured Quantum Search",
    "url": "https://arxiv.org/abs/quant-ph/9701013"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "039c7548-f587-4e75-9866-eb8e35c6e76f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}