{
  "annotation_id": "13af6ec5-913e-48da-b7df-5de2a5b8cffc",
  "date_created": "2026-03-02T18:01:49.511000Z",
  "date_modified": "2026-03-02T18:01:49.511000Z",
  "file_hash": "1d1ecf89558641a716f96ee1de0ff4eec225dc70c7a3cffa42d6fc6c3d4c68c4",
  "private": false,
  "record": {
    "abstract": "This work considers a generalization of Grover\u0027s search problem, viz., to\nfind any one element in a set of acceptable choices which constitute a fraction\nf of the total number of choices in an unsorted data base. An infinite family\nof sure-success quantum algorithms are introduced here to solve this problem,\neach member for a different range of f. The nth member of this family involves\nn queries of the data base, and so the lowest few members of this family should\nbe very convenient algorithms within their ranges of validity. The even member\n{A}_{2n} of the family covers ever larger range of f for larger n, which is\nexpected to become the full range 0 \u003c= f \u003c= 1 in the limit n --\u003einfinity.",
    "arxiv_id": "quant-ph/0201049",
    "authors": [
      "Chia-Ren Hu"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.66.042301",
    "title": "A family of sure-success quantum algorithms for solving a generalized   Grover search problem",
    "url": "https://arxiv.org/abs/quant-ph/0201049"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "1170ae43-318c-448c-9f57-ca36e8f2eb64",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}