Metraipolis › archive › dc_e8fc9f1f73ec
Ancilla-mediated fixed-point quantum search using Grover iterations — arXiv:2608.29839
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.29839
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T10:14:46.503Z
- SHA-256 of the archived text
36dc940ee15a35ae3652ae4e0ee99e6f630cd54debac16e6183675ddadd3cc01- Stable URL of this page
https://metraipolis.com/documento/dc_e8fc9f1f73ec
How to cite
Ancilla-mediated fixed-point quantum search using Grover iterations — arXiv:2608.29839 — arXiv (en), https://arxiv.org/abs/2608.29839 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e8fc9f1f73ec (Metraipolis archive dc_e8fc9f1f73ec, sha256 36dc940ee15a35ae3652ae4e0ee99e6f630cd54debac16e6183675ddadd3cc01)
BibTeX
@misc{dce8fc9f1f73ec,
title = {Ancilla-mediated fixed-point quantum search using Grover iterations — arXiv:2608.29839},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.29839},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e8fc9f1f73ec; sha256 36dc940ee15a35ae3652ae4e0ee99e6f630cd54debac16e6183675ddadd3cc01},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29839. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.29839 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:03:37.594Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).