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 examp...

Full description

Saved in:
Bibliographic Details
Published inQuantum Studies : Mathematics and Foundations Vol. 11; no. 2; pp. 275 - 285
Main Authors Ide, Yusuke, Narimatsu, Akihiro
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 2024
Springer Nature B.V
Subjects
History and Philosophical Foundations of Physics
Mathematical and Computational Physics
Mathematical Physics
Mathematics
Mathematics and Statistics
Quantum Physics
Regular Paper
Search algorithms
Theoretical
Perfect state transfer
Quantum walks
Equitable partition
Quantum search algorithms
05C50
81Q99
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2196-5609
2196-5617
DOI:10.1007/s40509-024-00321-y