Quantum walk is fundamental to designing many quantum algorithms. Here we consider the effects of quantum coherence and quantum entanglement for the quantum walk search on the complete bipartite graph. First, we numerically show the complementary relationship between the success probability and the two quantum resources (quantum coherence and quantum entanglement). We also provide theoretical analysis in the asymptotic scenarios. At last, we discuss the role played by generalized depolarizing noises and find that it would influence the dynamics of success probability and quantum coherence sharply, which is demonstrated by theoretical derivation and numerical simulation.
We investigate the behavior of coherence in scattering quantum walk search on complete graph under the condition that the total number of vertices of the graph is significantly larger than the marked number of vertices we are searching, N ≫ v. We find that the consumption of coherence represents the increase of the success probability for the searching, also it is related to the efficiency of the algorithm in oracle queries. If no coherence is consumed or an incoherent state is utilized, the algorithm will behave as the classical blind search, implying that coherence is responsible for the speed-up in this quantum algorithm over its classical counterpart. The effect of noises, in particular of photon loss and random phase shifts, on the performance of algorithm is studied. Two types of noise are considered because they arise in the optical network used for experimental realization of scattering quantum walk. It is found that photon loss will reduce the coherence and random phase shifts will hinder the interference between the edge states, both leading to lower success probability compared with the noise-free case. We then conclude that coherence plays an essential role and is responsible for the speed-up in this quantum algorithm.
Quantum algorithms have demonstrated provable speedups over classical counterparts, yet establishing a comprehensive theoretical framework to understand the quantum advantage remains a core challenge. In this work, we decode the quantum search advantage by investigating the critical role of quantum state properties in random-walk-based algorithms. We propose three distinct variants of quantum random-walk search algorithms and derive exact analytical expressions for their success probabilities. These probabilities are fundamentally determined by specific initial state properties: the coherence fraction governs the first algorithm's performance, while entanglement and coherence dominate the outcomes of the second and third algorithms, respectively. We show that increased coherence fraction enhances success probability, but greater entanglement and coherence reduce it in the latter two cases. These findings reveal fundamental insights into harnessing quantum properties for advantage and guide algorithm design. Our searches achieve Grover-like speedups and show significant potential for quantum-enhanced machine learning.
Under the condition
N≫v, we study the behavior of coherence in scattering quantum walk search and show the connection between it and the probability of success. We find that the consumption of coherence is highly related to the increase of the probability of success. We also find that the consumption of coherence is related to the efficiency of this algorithm. The more efficient the algorithm is, the more coherence is consumed. If no coherence is consumed, the efficiency of the algorithm will be the same as classical one, which implies coherence may be respond for the speeding up over classical one in this quantum algorithm. Moreover, we study the probability of success in the case of an incoherent initial state and find that when
N is large enough it will not change with time. It could be concluded that this quantum search algorithm loses its power with an incoherent initial state. This further shows that coherence plays an essential role in this algorithm.
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of
N vertices for one of
k marked vertices with different initial states. We prove an intriguing dependence on the number of marked and unmarked vertices in each partite set. For example, when the graph is irregular and the initial state is the typical uniform superposition over the vertices, then the success probability can vary greatly from one time step to the next, even alternating between 0 and 1, so the precise time at which measurement occurs is crucial. When the initial state is a uniform superposition over the edges, however, the success probability evolves smoothly. As another example, if the complete bipartite graph is regular, then the two initial states are equivalent. Then if two marked vertices are in the same partite set, the success probability reaches
1/2, but if they are in different partite sets, it instead reaches 1. This differs from the complete graph, which is the quantum walk formulation of Grover's algorithm, where the success probability with two marked vertices is
8/9. This reveals a contrast to the continuous-time quantum walk, whose evolution is governed by Schr\"odinger's equation, which asymptotically searches the regular complete bipartite graph with any arrangement of marked vertices in the same manner as the complete graph.
Quantum walks constitute a rich area of quantum information science, where multipartite entanglement plays a central role in the dynamics and scalability of quantum advantage over classical simulators. In this work, we study the multipartite entanglement of quantum walks in optical settings. We present methods for computing a geometric measure of entanglement for arbitrary partitions of a single-walker quantum walk and for analyzing the entanglement in multi-walker scenarios. These techniques are used for numerical studies on the entanglement dynamics of quantum walks in large systems and under various initial conditions. For a given bipartition, based on the coin degrees of freedom, we derive exact expressions describing the complete entanglement dynamics for arbitrary localized initial conditions. We use these expressions for analytic statements about the asymptotic behavior of the system. Furthermore, we demonstrate the emergence of entanglement typicality in statistical ensembles of random optical networks.