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

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Ide, Yusuke, Narimatsu, Akihiro
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 16.09.2022
Subjects
Mathematical analysis
Search algorithms
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2331-8422