{
  "annotation_id": "3700cdae-ae3e-4a62-b72e-f4144ccc8d52",
  "date_created": "2026-03-02T18:01:52.226000Z",
  "date_modified": "2026-03-02T18:01:52.226000Z",
  "file_hash": "dadd8134f81363c388ce53a39a7ac0508f590fc609bbc3f7b692ebf8aa17080c",
  "private": false,
  "record": {
    "abstract": "We present in this work, if a set of well organized suboracles is available,\nan algorithm for multiobject search with certainty in an unsorted database of\n$N$ items. Depending on the number of the objects, the technique of phase\ntunning is included in the algorithm. If one single object is to be searched,\nthis algorithm performs a factor of two improvement over the best algorithm for\na classical sorted database. While if the number of the objects is larger than\none, the algorithm requires slightly less than $\\log_{4}N$ queries, but no\nclassical counterpart exists since the resulting state is a superposition of\nthe marked states.",
    "arxiv_id": "quant-ph/0205175",
    "authors": [
      "Jin-Yuan Hsieh",
      "Che-Ming Li",
      "Der-San Chuu"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Multi-object searching algorithm using subgrouped oracles",
    "url": "https://arxiv.org/abs/quant-ph/0205175"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "652fe88d-a613-4884-9a1e-662e4f32945b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}