STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum Random Walks in One Dimension
Quantum Information Processing
Decoherence in quantum walks – a review
Mathematical Structures in Computer Science
Localization of an inhomogeneous discrete-time quantum walk on the line
Quantum Information Processing
One dimensional quantum walks with memory
Quantum Information & Computation
Asymptotic distributions of quantum walks on the line with two entangled coins
Quantum Information Processing
Quantum walks: a comprehensive review
Quantum Information Processing
Limit measures of inhomogeneous discrete-time quantum walks in one dimension
Quantum Information Processing
Realization of the probability laws in the quantum central limit theorems by a quantum walk
Quantum Information & Computation
| Hi-index | 0.00 |
Recently Mc Gettrick [1] introduced and studied a discrete-time 2-state quantum walk(QW) with a memory in one dimension. He gave an expression for the amplitude ofthe QW by path counting method. Moreover he showed that the return probability ofthe walk is more than 1/2 for any even time. In this paper, we compute the stationarydistribution by considering the walk as a 4-state QW without memory. Our result isconsistent with his claim. In addition, we obtain the weak limit theorem of the rescaledQW. This behavior is strikingly different from the corresponding classical random walkand the usual 2-state QW without memory as his numerical simulations suggested.