Discrete time quantum walks on percolation graphs
arXiv:1404.4509 · doi:10.1140/epjp/i2014-14103-6
Abstract
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear and disappear randomly in each step during the time evolution. The resulting open system dynamics is hard to treat numerically in general. We shortly review the literature on this problem. We then present our method to solve the evolution on finite percolation graphs in the long time limit, applying the asymptotic methods concerning random unitary maps. We work out the case of one dimensional chains in detail and provide a concrete, step by step numerical example in order to give more insight into the possible asymptotic behavior. The results about the case of the two-dimensional integer lattice are summarized, focusing on the Grover type coin operator.
22 pages, 3 figures
References in corpus (14)
- Universal computation by quantum walk
- Quantum walks of correlated particles
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- A 2D Quantum Walk Simulation of Two-Particle Dynamics
- Discrete single-photon quantum walks with tunable decoherence
- Decoherence in quantum walks - a review
- Asymptotic evolution of quantum walks with random coin
- Quantum transport on small-world networks: A continuous-time quantum walk approach
- Asymptotic dynamics of coined quantum walks on percolation graphs
- Coined quantum walks on percolation graphs
- Mixing Times in Quantum Walks on the Hypercube
- Full-revivals in 2-D Quantum Walks
- Implementation of a spatial two-dimensional quantum random walk with tunable decoherence
- Decoherent quantum walks driven by a generic coin operation