Perfect state transfer, equitable partition and continuous-time quantum walk based search
摘要
In this paper, we consider a continuous-time quantum walk based search algorithm. We discuss equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the running time of the search algorithm. In addition, we gave some examples of graphs that we can calculate the success probability and the running time.