Superdiffusivity of quantum walks: A Feynman sum-over-paths description
arXiv:1209.4953 · doi:10.1103/PhysRevA.86.042309
Abstract
Quantum walks constitute important tools in different applications, especially in quantum algorithms. To a great extent their usefulness is due to unusual diffusive features, allowing much faster spreading than their classical counterparts. Such behavior, although frequently credited to intrinsic quantum interference, usually is not completely characterized. Using a recently developed Green's function approach [Phys. Rev. A {\bf 84}, 042343 (2011)], here it is described -- in a rather general way -- the problem dynamics in terms of a true sum over paths history a la Feynman. It allows one to explicit identify interference effects and also to explain the emergence of superdiffusivity. The present analysis has the potential to help in designing quantum walks with distinct transport properties.
6 pages, 4 figures, Accepted in Physical Review A
References in corpus (17)
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Universal computation by quantum walk
- Environment-Assisted Quantum Transport
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Discrete single-photon quantum walks with tunable decoherence
- Decoherence in quantum walks - a review
- Faster quantum walk algorithm for the two dimensional spatial search
- Connecting the discrete and continuous-time quantum walks
- A random walk approach to quantum algorithms
- Quantum searches on highly symmetric graphs
- Quantum walks with random phase shifts
- Disordered quantum walk-induced localization of a Bose-Einstein condensate
- Quantum phase transition using quantum walks in an optical lattice
- Modifying quantum walks: A scattering theory approach
- Sub-ballistic behavior in quantum systems with Lévy noise
- Scattering quantum random-walk search with errors
- Searches on star graphs and equivalent oracle problems