{
  "annotation_id": "10030916-3de8-4a0c-8de3-444844b2793e",
  "date_created": "2026-03-02T18:02:41.300000Z",
  "date_modified": "2026-03-02T18:02:41.300000Z",
  "file_hash": "5c53698cd153bb77cdff4be70f763212cce3d0ec76956b425fc18e6b5677398b",
  "private": false,
  "record": {
    "abstract": "This paper shows how a basic property of unitary transformations can be used\nfor meaningful computations. This approach immediately leads to search-type\napplications, where it improves the number of steps by a square-root - a simple\nminded search that takes N steps, can be improved to O(sqrt(N)) steps. The\nquantum search algorithm is one of several immediate consequences of this\nframework. Several novel search-related applications are presented.",
    "arxiv_id": "quant-ph/9802035",
    "authors": [
      "Lov K. Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/S0960-0779(98)00217-3",
    "title": "Quantum search on structured problems",
    "url": "https://arxiv.org/abs/quant-ph/9802035"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "91678ace-001d-4c4c-aff7-23b18c1cb154",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}