Experimental Parity-Time Symmetric Quantum Walks for Centrality Ranking on Directed Graphs

Using quantum walks (QWs) to rank the centrality of nodes in networks, represented by graphs, is advantageous compared to certain widely used classical algorithms. However, it is challenging to implement a directed graph via QW, since it corresponds to a non-Hermitian Hamiltonian and thus cannot be...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Physical review letters 2020-12, Vol.125 (24), p.240501, Article 240501
Hauptverfasser:	Wu, Tong, Izaac, J. A., Li, Zi-Xi, Wang, Kai, Chen, Zhao-Zhong, Zhu, Shining, Wang, J. B., Ma, Xiao-Song
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Graph theory Graphical representations Graphs Parity Photons Physical Sciences Physics Physics, Multidisciplinary Ranking Science & Technology
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!