{
  "annotation_id": "931b2304-2fe7-400f-97f3-569cc8f8c6e5",
  "date_created": "2026-03-02T18:02:31.252000Z",
  "date_modified": "2026-03-02T18:02:31.252000Z",
  "file_hash": "90736ee07af5423da19de981c63474b7ef26de142173865ac38ad0a5196dbd4d",
  "private": false,
  "record": {
    "abstract": "Searching and sorting used as a subroutine in many important algorithms.\nQuantum algorithm can find a target item in a database faster than any\nclassical algorithm. One can trade accuracy for speed and find a part of the\ndatabase (a block) containing the target item even faster, this is partial\nsearch. An example is the following: exact address of the target item is given\nby a sequence of many bits, but we need to know only some of them. More\ngenerally partial search considers the following problem: a database is\nseparated into several blocks. We want to find a block with the target item,\nnot the target item itself. In this paper we reformulate quantum partial search\nalgorithm in terms of group theory.",
    "arxiv_id": "quant-ph/0609205",
    "authors": [
      "Vladimir E. Korepin",
      "Brenno C. Vallilo"
    ],
    "categories": [
      "quant-ph",
      "cs.DS",
      "math.GR"
    ],
    "doi": "10.1143/PTP.116.783",
    "journal_ref": "Prog. Theor. Phys. Vol. 116, No. 5 (2006), p. 783",
    "title": "Group Theoretical Formulation of Quantum Partial Search Algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0609205"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "eeac30c8-8545-4341-b0a7-a58125bb8bcb",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}