paper

Revisiting fixed-point quantum search: proof of the quasi-Chebyshev lemma

arXiv:2403.02057 · doi:10.1007/s11704-025-50626-3

Abstract

The original Grover's algorithm suffers from the souffle problem, which means that the success probability of quantum search decreases dramatically if the iteration time is too small or too large from the right time. To overcome the souffle problem, the fixed-point quantum search with an optimal number of queries was proposed [Phys. Rev. Lett. 113, 210501 (2014)], which always finds a marked state with a high probability when a lower bound of the proportion of marked states is given. The fixed-point quantum search relies on a key lemma regarding the explicit formula of recursive quasi-Chebyshev polynomials, but its proof is not given explicitly. In this work, we give a detailed proof of this lemma, thus providing a sound foundation for the correctness of the fixed-point quantum search. This lemma may be of independent interest as well, since it expands the mathematical form of the recursive relation of Chebyshev polynomials of the first kind, and it also constitutes a key component in overcoming the souffle problem of quantum walk-based search algorithms, for example, robust quantum walk search on complete bipartite graphs [Phys. Rev. A 106, 052207 (2022)]. The lemma is also central to a recently proposed quantum algorithm named quantum phase discrimination, which has become a fundamental subroutine in quantum search on graphs [arxiv: 2504.15194]. Hopefully, more applications of the lemma will be found in the future.

arXiv commentThe article has been accepted by Frontiers of Computer Science (FCS), with the DOI: {10.1007/s11704-025-50626-3}

References in corpus (13)