2004/10/29 by Oliver Muelken, Oliver Mülken, A. Blumen +1 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Discrete mathematics #Graph #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum algorithm #Quantum and electron transport phenomena #Quantum mechanics #Quantum walk #Quantum-Dot Cellular Automata #Random walk #Statistical physics #Statistics #Superposition principle #cond-mat.stat-mech #quant-ph
paper · pdf · doi:10.1103/physreve.71.016101
published as Phys. Rev. E 71, 016101 (2005) · 5 pages, 7 figures, accepted for publication in Phys. Rev. E
arxiv created 2004/10/29 · openalex publication_date 2005/01/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Continuous time quantum walks (CTQWs) do not necessarily perform better than their classical counterparts, the continuous time random walks (CTRWs). For one special graph, where a recent analysis showed that in a particular direction of propagation the penetration of the graph is faster by CTQWs than by CTRWs, we demonstrate that in another direction of propagation the opposite is true. In this case a CTQW initially localized at one site displays a slow transport. We furthermore show that when the CTQW's initial condition is a totally symmetric superposition of states of equivalent sites, the transport gets to be much more rapid.