Preprint
Sep 2026
Faster Computation with the Generalized Laplacian Quantum Walk
It is proved that a continuous-time quantum walk effected by a generalized Laplacian, which can arise in spin chains, can solve a computational problem more quickly than typical quantum walks governed by the standard Laplacian or adjacency matrix.
Jonas Duda, Thomas G. Wong
· 0 citations