{
  "annotation_id": "a087b397-8269-4858-81bb-f64211a2372d",
  "date_created": "2026-03-02T18:02:31.149000Z",
  "date_modified": "2026-03-02T18:02:31.149000Z",
  "file_hash": "3be9e2a72c9e41d0d416c2a61c1e81c53ede5ffc1a675cdd730f43f5d23a843b",
  "private": false,
  "record": {
    "abstract": "We consider a database separated into blocks. Blocks containing target items\nare called target blocks. Blocks without target items are called non-target\nblocks. We consider a case, when each target block has the same number of\ntarget items. We present a fast quantum algorithm, which finds one of the\ntarget blocks. Our algorithm is based on Grover-Radhakrishnan algorithm of\npartial search. We minimize the number of queries to the oracle.",
    "arxiv_id": "quant-ph/0608106",
    "authors": [
      "Byung-Soo Choi",
      "Vladimir Korepin"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Quantum Information Processing, vol 6, Number 4, page 37, 2007",
    "title": "Quantum Partial Search of a Database with Several Target Items",
    "url": "https://arxiv.org/abs/quant-ph/0608106"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8360d293-7fc5-4b25-aa64-dbff57b096d9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}