2013/03/31 by J. Lockhart, Carlo D. Franco, C. Di Franco +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computer science #Discrete mathematics #Graph #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum computer #Quantum decoherence #Quantum mechanics #Quantum walk #Quantum-Dot Cellular Automata #Statistical physics #Vertex (graph theory) #cs.DS #quant-ph
paper · pdf · doi:10.1016/j.physleta.2013.11.034
published as Phys. Lett. A 378, 338 (2014) · 6 pages, 7 figures, RevTeX4
openalex publication_date 2013/11/28 · arxiv created 2014/01/04 · arxiv updated 2015/06/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We study the behaviour of the glued trees algorithm described by Childs et al. in [1] under decoherence. We consider a discrete time reformulation of the continuous time quantum walk protocol and apply a phase damping channel to the coin state, investigating the effect of such a mechanism on the probability of the walker appearing on the target vertex of the graph. We pay particular attention to any potential advantage coming from the use of weak decoherence for the spreading of the walk across the glued trees graph.