One dimensional lazy quantum walks and occupancy rate

Abstract

Lazy quantum walks were presented by Andrew M. Childs to prove that the continuous-time quantum walk is a limit of the discrete-time quantum walk [Commun.Math.Phys.294,581-603(2010)]. In this paper, we discuss properties of lazy quantum walks. Our analysis shows that lazy quantum walks have $O(t^n)$ order of the n-th moment of the corresponding probability distribution, which is the same as that for normal quantum walks. Also, the lazy quantum walk with DFT (Discrete Fourier Transform) coin operator has a similar probability distribution concentrated interval to that of the normal Hadamard quantum walk. Most importantly, we introduce the concepts of occupancy number and occupancy rate to measure the extent to which the walk has a (relatively) high probability at every position in its range. We conclude that lazy quantum walks have a higher occupancy rate than other walks such as normal quantum walks, classical walks and lazy classical walks.

References in corpus (4)

• Mimicking the probability distribution of a two-dimensional Grover walk with a single-qubit coin
• Counting Statistics of Many-Particle Quantum Walks
• Decoherence vs entanglement in coined quantum walks
• Continuous deformations of the Grover walk preserving localization

Cited by in corpus (9)

• Localization for a one-dimensional split-step quantum walk with bound states robust against perturbations
• Photonic quantum walks with four-dimensional coins
• Search by Lackadaisical Quantum Walk with Nonhomogeneous Weights
• Generic Quantum Walks with Memory
• One-Dimensional Lazy Quantum walk in Ternary System
• Lazy Open Quantum Walks
• Coin dimensionality as a resource in quantum metrology involving discrete-time quantum walks
• Localization of space-inhomogeneous three-state quantum walks
• Spectral analysis of three-state quantum walks with general coin matrices