Papers › Scattering Quantum Random Walks on Square Grids and Randomly Generated Mazes
Scattering Quantum Random Walks on Square Grids and Randomly Generated Mazes
Daniel Koch
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs, consisting of N² nodes. We simulate these quantum systems using classical computational methods, and find that the probability distributions that arise are very favorable for a hybrid quantum / classical algorithm. We then examine how this hybrid algorithm handles varying types of randomness in both location of the special vertex and later random obstacles placed throughout the geometry, showing that that the algorithm is resilient to both cases.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections