2005/07/20 by Oliver Muelken, Oliver Mülken, Antonio Volta +3 · 4 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum and electron transport phenomena #Quantum-Dot Cellular Automata #cond-mat.stat-mech #quant-ph
paper · pdf · doi:10.1103/physreva.72.042334
published as Phys. Rev. A 72, 042334 (2005) · 9 pages, 12 figures, revtex4
arxiv created 2005/07/20 · openalex publication_date 2005/10/28 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast, directed transport through the network to the opposite corner. This transport is not ballistic in nature, but rather produced by quantum mechanical interference. In the long time limit, certain walks show an asymmetric limiting probability distribution; this feature depends on the starting site and, remarkably, on the precise size of the network. The limiting probability distributions show patterns which are correlated with the initial condition. This might have consequences for the application of continuous-time quantum walk algorithms.