A mathematical framework for maze solving using quantum walks

DOI10.1007/S11128-025-04711-YMaRDI QIDQ6977562zbMATH OpenFDO

Authors Leo Matsuoka, Hiromichi Ohno, Etsuo Segawa

Publication date 28 May 2025

Published in Quantum Information Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11128-025-04711-Y

zbMATH Keywords

discrete-time quantum walkGrover walkmaze-solving problemshortest path problem

Mathematics Subject Classification ID

Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Cites work

• A dynamical system induced by quantum walk
• A mathematical model for adaptive transport network in path finding by true slime mold
• A note on two problems in connexion with graphs
• An Appraisal of Some Shortest-Path Algorithms
• Circuit equation of Grover walk
• Complex networks: structure and dynamics
• Electric circuit induced by quantum walk
• Exploring complex networks
• Finding more than one path through a simple maze with a quantum walk
• scientific article; zbMATH DE number 5934473 (Why is no real title available?)
• scientific article; zbMATH DE number 2222671 (Why is no real title available?)
• Introduction to algorithms.
• Modifying quantum walks: a scattering theory approach
• On a routing problem
• One-dimensional quantum walks
• Quantum search of spatial regions
• Quantum walks and search algorithms
• Shortest paths algorithms: Theory and experimental evaluation
• Survival probability of the Grover walk on the ladder graph

This page was built for publication: A mathematical framework for maze solving using quantum walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977562)