{
  "abstract": "Grover's quantum search algorithm provides a fundamental quadratic speedup for unstructured datasets, reducing query complexity from $\\mathcal{O}(N)$ to $\\mathcal{O}(\\sqrt{N})$. However, the algorithm's reliance on precise iteration counts leads to the ``soufflé problem,'' where over-rotation results in a sharp decline in success probability. This limitation is particularly restrictive when the number of solution states, $M$, is unknown. In this work, we present an ancilla-mediated fixed-point quantum search algorithm that achieves robust convergence by mapping the solution amplitude to a dedicated ancilla qubit. Unlike existing phase-matching fixed-point methods, our approach utilizes Grover's real-plane reflections, thereby maintaining the intuitive geometric architecture of the original algorithm. We demonstrate that this method achieves a success probability of at least $92.6\\%$ with a query complexity of approximately $\\mathcal{O}(\\sqrt{N/M})$, effectively bridging the gap between standard amplitude amplification and robust fixed-point convergence.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2608.29839",
  "author_total": 3,
  "authors": [
    {
      "name": "Yash Prabhat"
    },
    {
      "name": "Snigdha Thakur"
    },
    {
      "name": "Ankur Raina"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/1vb4kqamthjqp.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2608.29839",
  "fulltext_url": null,
  "id": "1vb4kqamthjqp",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2608.29839",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7204931979",
  "pdf_url": "https://arxiv.org/pdf/2608.29839",
  "pmcid": null,
  "pmid": null,
  "published": "2026-08-30",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/1vb4kqamthjqp.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:41Z",
      "native_id": "2608.29839",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2608.29839"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Ancilla-mediated fixed-point quantum search using Grover iterations",
  "title_text": "Ancilla-mediated fixed-point quantum search using Grover iterations",
  "type": "preprint",
  "updated_at": "2026-10-30T12:17:41Z",
  "url": "https://research.draconitic.com/paper/1vb4kqamthjqp",
  "venue": "arXiv",
  "versions": []
}