Quantum Algorithms Database
Quantum Walk Algorithms
The quantum analog of a classical random walk, used to search graphs and networks faster than classical methods in specific structured cases.
Year
2003 (Childs et al.)
Inventor(s)
Multiple contributors
Speedup Type
Polynomial Speedup
Difficulty
★★★★☆
The Problem
Searching or traversing a large graph or network structure to find a target node or path.
How It Works
Exploits quantum superposition and interference to spread probability across a graph differently than a classical random walk, in some cases reaching target nodes quadratically faster.
Real-World Impact
Used in specialized search applications and as a building block for some optimization and machine learning algorithms; less broadly known than Grover's but mathematically related.