2003/05/29 by Heath Gerhardt, John Watrous, Gerhardt, Heath +1
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #Quantum and electron transport phenomena #Quantum-Dot Cellular Automata #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0305182
14 pages, to appear at RANDOM'03
arxiv created 2003/05/29 · openalex publication_date 2003/05/29 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that for several natural choices for generating sets, these quantum walks do not have uniform limiting distributions, and are effectively blind to large areas of the graphs due to destructive interference.