{
  "annotation_id": "0e9d69e5-a0cf-4146-a267-cfb547046ffa",
  "date_created": "2026-03-02T18:02:20.028000Z",
  "date_modified": "2026-03-02T18:02:20.028000Z",
  "file_hash": "8dc7060040c2ed9528f638abb1406c951adbc454b4dc6ff1193465b30726989c",
  "private": false,
  "record": {
    "abstract": "Quantum algorithm can find target item in a database faster than any\nclassical. One can trade accuracy for speed and find a part of the database (a\nblock) containing the target item even faster: this is partial search. One can\nthink of partial search in following terms: an exact address of the target item\nis given by a sequence of many bites, but we want to find only several first\nbites of the address. We consider different partial search algorithms\nconsisting of a sequence of global and local searches and suggest the optimal\none. Global search consists of the standard Grover iterations for the whole\ndatabase. Local search consists of Grover iterations in each individual block\nmade simultaneously in all blocks. Efficiency of an algorithm is measured by\nnumber of queries to the oracle.",
    "arxiv_id": "quant-ph/0510179",
    "authors": [
      "Vladimir Korepin",
      "Jinfeng Liao"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s11128-006-0024-3",
    "journal_ref": "Quantum Information Processing, ISSN: 1570-0755 (Paper) 1573-1332\n  , 2006",
    "title": "Quest for Fast Partial Search Algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0510179"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ca5463b5-6046-4809-b081-bcc648de5594",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}