Quantum Walk: Graph Hitting Time

A discrete-time quantum walk on a graph, driven by a coin operator and shift. The quantum walk's hitting time scales as O(√N) vs O(N) classical, enabling quantum speedup for search problems.

Graph

Steps: 0
Max prob: –
Spread σ: –