Preprint
Aug 2026
Laziness of Quantum Walks on Graphs
The trace of the average mixing matrix of a quantum walk measures the"laziness"of the walk: the higher the trace, the more likely that the walker returns home in the long run. In this paper, we develop tools to study this graph invariant arising from Laplacian quantum walks. It is known that the complete graph $K_n$ is...
Amulya Mohan, Christino Tamon, Yi-Chi Xu et al.
· 0 citations