{
  "annotation_id": "9b8e5789-5c90-4ea8-a4bd-8c25a778e80a",
  "date_created": "2026-03-02T18:01:56.571000Z",
  "date_modified": "2026-03-02T18:01:56.571000Z",
  "file_hash": "af8acb4069aaa74ca25ac78af7dbfa8be47438b66215f5ee4b6dcb80ec03db75",
  "private": false,
  "record": {
    "abstract": "In this work, we consider a family of sure-success quantum algorithms, which\nis grouped into even and odd members for solving a generalized Grover search\nproblem. We prove the matching conditions for both groups and give the\ncorresponding formulae for evaluating the iterations or oracle calls required\nin the search computation. We also present how to adjust the phase angles in\nthe generalized Grover operator to ensure the sure-success if minimal oracle\ncalls are demanded in the search.",
    "arxiv_id": "quant-ph/0210201",
    "authors": [
      "Jin-Yuan Hsieh",
      "Che-Ming Li",
      "Jenn-Sen Lin",
      "Der-San Chuu"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "International Journal of Quantum Information, Vol. 2, No. 3, pp.\n  285-294 (2004)",
    "title": "Formulation of a Family of Sure-Success Quantum Search Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0210201"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2716c901-1eec-46fb-ba85-b6439883a40e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}