Experimental parity-time symmetry quantum walks on a directed graph

Abstract

Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of nodes in networks represented by graphs. Employing QW in centrality ranking is advantageous comparing to certain widely used classical algorithms (e.g. PageRank) because QW approach can lift the vertex rank degeneracy in certain graphs. 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 both a three-vertex and four-vertex directed graphs with parity-time (PT) symmetric quantum walks. To achieve this, we use high-dimensional photonic quantum states, optical circuitries consisting of multiple concatenated interferometers and dimension dependent loss. Importantly, we demonstrate the advantage of QW approach experimentally by breaking the vertex rank degeneracy in a four-vertex graph. Our work shows that PT-symmetric quantum walks may be useful for realizing advanced algorithm in a quantum network.

References in corpus (12)

• Integrated Photonic Quantum Technologies
• Universal computation by quantum walk
• Quantum walks of correlated particles
• Quantum Walk in Position Space with Single Optically Trapped Atoms
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Universal computation by multi-particle quantum walk
• Strongly Correlated Quantum Walks in Optical Lattices
• A wavelength-tunable fiber-coupled source of narrowband entangled photons
• A 2D Quantum Walk Simulation of Two-Particle Dynamics
• Discrete single-photon quantum walks with tunable decoherence
• Three-dimensional entanglement on a silicon chip
• Centrality measure based on continuous-time quantum walks and experimental realization

Cited by in corpus (6)

• Review on Quantum Walk Computing: Theory, Implementation, and Application
• Ultra-long quantum walks via spin-orbit photonics
• Extending Quantum Probability from Real Axis to Complex Plane
• Estimating Gibbs partition function with quantumClifford sampling
• Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs
• Quantum hub and authority centrality measures for directed networks based on continuous-time quantum walks