The Lackadaisical Quantum Walker is NOT Lazy at all
arXiv:1612.03370 · doi:10.1088/1751-8121/aa9235
Abstract
In this paper, we study the properties of lackadaisical quantum walks on a line. This model is first proposed in~\cite{wong2015grover} as a quantum analogue of lazy random walks where each vertex is attached self-loops. We derive an analytic expression for the localization probability of the walker at the origin after infinite steps, and obtain the peak velocities of the walker. We also calculate rigorously the wave function of the walker starting from the origin and obtain a long time approximation for the entire probability density function. As an application of the density function, we prove that lackadaisical quantum walks spread ballistically for arbitrary , and give an analytic solution for the variance of the walker's probability distribution.
arXiv comment9 pages, 4 figures, comments are welcome
References in corpus (21)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Exponential algorithmic speedup by quantum walk
- Spatial search by quantum walk
- From quantum cellular automata to quantum lattice gases
- Universal quantum computation using the discrete time quantum walk
- Weak limits for quantum random walks
- One-Dimensional Three-State Quantum Walk
- Localization of Two-Dimensional Quantum Walks
- Hitting time for quantum walks on the hypercube
- Optimizing the discrete time quantum walk using a SU(2) coin
- Grover Search with Lackadaisical Quantum Walks
- Weak Limit of the 3-State Quantum Walk on the Line
- Limit distributions of three-state quantum walks: the role of coin eigenstates
- Coined Quantum Walks on Weighted Graphs
- Continuous deformations of the Grover walk preserving localization
- Localization in Quantum Walks on a Honeycomb Network
- Grover Walks on a Line with Absorbing Boundaries
- Stability of point spectrum for three-state quantum walks on a line