Searching for an unknown marked vertex on a given graph (also known as spatial search) is an extensively discussed topic in the area of quantum algorithms, with a plethora of results based on different quantum walk models and targeting various types of graphs. Most of these algorithms have a non-zero probability of failure. In recent years, there have been some efforts to design quantum spatial search algorithms with 100\% success probability. However, these works either only work for very special graphs or only for the case where there is only one marked vertex. In this work, we propose a different and elegant approach to quantum spatial search, obtaining deterministic quantum search algorithms that can find a marked vertex with certainty on any Laplacian integral graph with any predetermined proportion of marked vertices. Thus, this work discovers the largest class of graphs so far that allow deterministic quantum search, making it easy to design deterministic quantum search algorithms for many graphs, including the different graphs discussed in previous works, in a unified framework.
Li et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: