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...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| DOI: | 10.48550/arxiv.2209.07688 |