Physical Review Letters · 2020 · 26 citations · 48 references
ComputingComputer SciencePhysicsPhotonicsQuantum ComputingQuantum MechanicsGraph TheoryQuantum AlgorithmsQuantum ComputationCentralityCentrality RankingDirected GraphsPagerank CentralityQuantum Algorithms For Information ProcessingQuantum NetworksQuantum Walk AlgorithmsQuantum Walks
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 high-dimensional 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.
48
Experimental realization of any discrete unitary operator
Michael Reck, Anton Zeilinger, H. J. Bernstein et al. · Physical Review Letters · 1994 · 2.1K citations · Full text
Natural Sciences, Physics, Optics +15
Yakir Aharonov, L. Davidovich, N. Zagury · Physical Review A · 1993 · 1.6K citations
Integrated photonic quantum technologies
Nature Photonics · 2019 · 1.4K citations · Full text
Quantum random walks: An introductory overview
Contemporary Physics · 2003 · 1.4K citations · Full text