Coherence as resource in scattering quantum walk search on complete graph

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 greatly larger than the marked number of vertices we are searching, $N \gg v$. We find that the consumption of coherence represents the increase of the success probability for the searching,also the consumption of coherence is related to the efficiency of the algorithm represented by oracle queries.If no coherence is consumed, the efficiency of the algorithm will be the same as the classical blind search, implying that coherence is responsible for the speed up in this quantum algorithm over its classical counterpart. In case the initial state is incoherent, still $N \gg v$ is assumed,the probability of success for searching will not change with time, indicating that this quantum search algorithm loses its power.We then conclude that the coherence plays an essential role and is responsible for the speed up in this quantum algorithm.

No reviews yet.

No comments yet.