[12a-N202-1~8] 3.12 Nanoscale optical science and near-field optics

[12a-N202-8] The Shortest Pathfinding by a Quantum Walk

〇Leo Matsuoka¹, Kenta Yuki², Hynek Lavicka³, Etsuo Segawa⁴ (1.Hiroshima Inst. of Tech., 2.Analytics Japan, 3.Thetaris GmbH, 4.Yokohama Nat. Univ.)

Keywords:natural computation, quantum search, mathematical model

Nature phenomenon sometimes autonomously finds the shortest path in a maze-like structure. We found that the density distribution of a quantum walk eternally remains on the shortest path between a pair of marked nodes on the network with an exit sink. We show numerical results of the shortest pathfinding by the quantum walk and discuss the mathematical foundation of that phenomenon.