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 accomplished by conventional QW. Here we report the realizations of centrality rankings of a three-, a four-, and a nine-vertex directed graph with parity-time (PT) symmetric quantum walks by using highdimensional photonic quantum states, multiple concatenated interferometers, and dimension dependent loss to achieve these. We demonstrate the advantage of the QW approach experimentally by breaking the vertex rank degeneracy in a four-vertex graph. Furthermore, we extend our experiment from single-photon to two-photon Fock states as inputs and realize the centrality ranking of a nine-vertex graph. Our work shows that a PT symmetric multiphoton quantum walk paves the way for realizing advanced algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.