2022/09/16 by Yusuke Ide, Ide, Yusuke, Akihiro Narimatsu +1
Computer Science · #05C50 #81Q99 #FOS: Physical sciences #Neural Networks and Reservoir Computing #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2209.07688
openalex publication_date 2022/09/16 · openalex created_date 2022/09/20 · openalex updated_date 2026/07/28
In this paper, we consider a continuous-time quantum walk based search algorithm. We introduce equitable partition of the graph and perfect state transfer on it. By these two methods, we can calculate the success probability and the finding time of the search algorithm. In addition, we gave some examples of graphs that we can calculate the success probability and the finding time.