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 (41)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Environment-Assisted Quantum Transport
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- From quantum cellular automata to quantum lattice gases
- Universal quantum computation using the discrete time quantum walk
- On the relationship between continuous- and discrete-time quantum walk
- Discrete single-photon quantum walks with tunable decoherence
- Decoherence and disorder in quantum walks: From ballistic spread to localization
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Controlling discrete quantum walks: coins and intitial states
- Quantum walks in higher dimensions
- Decoherence in quantum walks - a review
- Quantum Walks driven by many coins
- The quantum to classical transition for random walks
- Faster quantum walk algorithm for the two dimensional spatial search
- Connecting the discrete and continuous-time quantum walks
- Quantum walk on the line as an interference phenomenon
- Aperiodic Quantum Random Walks
- A random walk approach to quantum algorithms
- Breakdown of an Electric-Field Driven System: a Mapping to a Quantum Walk
- Quantum walks based on an interferometric analogy
- Multi-walker discrete time quantum walks on arbitrary graphs, their properties, and their photonic implementation
- 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
- Searching via walking: How to find a marked subgraph of a graph using quantum walks
- Green functions for generalized point interactions in 1D: A scattering approach
- Group Velocity of Discrete-Time Quantum Walks
- Equivalence between discrete quantum walk models in arbitrary topologies
- Sub-ballistic behavior in quantum systems with Lévy noise
- Scattering quantum random-walk search with errors
- Evanescence in Coined Quantum Walks
- Green function approach for scattering quantum walks
- Searches on star graphs and equivalent oracle problems