{
  "annotation_id": "a8b9000c-5e3b-45f4-b9df-d1a1e9f456a2",
  "date_created": "2026-03-02T18:02:17.210000Z",
  "date_modified": "2026-03-02T18:02:17.210000Z",
  "file_hash": "8f95d8a4aa22159213874699fecddd26464e0a23e6cbdd568b30fcc8ff74cbe7",
  "private": false,
  "record": {
    "abstract": "Quantum Grover search algorithm can find a target item in a database faster\nthan any classical algorithm. One can trade accuracy for speed and find a part\nof the database (a block) containing the target item even faster, this is\npartial search. A partial search algorithm was recently suggested by Grover and\nRadhakrishnan. Here we optimize it. Efficiency of the search algorithm is\nmeasured by number of queries to the oracle. The author suggests new version of\nGrover-Radhakrishnan algorithm which uses minimal number of queries to the\noracle. The algorithm can run on the same hardware which is used for the usual\nGrover algorithm.",
    "arxiv_id": "quant-ph/0503238",
    "authors": [
      "Vladimir Korepin"
    ],
    "categories": [
      "quant-ph",
      "cs.DS"
    ],
    "doi": "10.1088/0305-4470/38/44/L02",
    "journal_ref": "Journal of Physics A: Math. Gen. vol 38, pages L731-L738, 2005",
    "title": "Optimization of Partial Search",
    "url": "https://arxiv.org/abs/quant-ph/0503238"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "293d7613-81b5-4c09-9d9b-481a8b1d8f4a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}