Exact solutions and symmetry analysis for the limiting probability distribution of quantum walks
arXiv:1608.07059 · doi:10.1016/j.aop.2016.08.019
Abstract
In the literature, there are numerous studies of one-dimensional discrete-time quantum walks (DTQWs) using a moving shift operator. However, there is no exact solution for the limiting probability distributions of DTQWs on cycles using a general coin or swapping shift operator. In this paper, we derive exact solutions for the limiting probability distribution of quantum walks using a general coin and swapping shift operator on cycles for the first time. Based on the exact solutions, we show how to generate symmetric quantum walks and determine the condition under which a symmetric quantum walk appears. Our results suggest that choosing various coin and initial state parameters can achieve a symmetric quantum walk. By defining a quantity to measure the variation of symmetry, deviation and mixing time of symmetric quantum walks are also investigated.
arXiv comment17 pages, 2 figures
References in corpus (13)
- Quantum random walks - an introductory overview
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Universal quantum computation using the discrete time quantum walk
- On the relationship between continuous- and discrete-time quantum walk
- Quantum algorithms for algebraic problems
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Controlling discrete quantum walks: coins and intitial states
- Decoherence in quantum walks - a review
- Quantum walks on cycles
- Mixing Times in Quantum Walks on the Hypercube
- Analytical solutions for quantum walks on 1D chain with different shift operators