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
On the von neumann entropy of certain quantum walks subject to decoherence†
Mathematical Structures in Computer Science
Crossovers induced by discrete-time quantum walks
Quantum Information & Computation
Entanglement for discrete-time quantum walks on the line
Quantum Information & Computation
| Hi-index | 0.00 |
The probability distributions of discrete-time quantum walks have been often investigated, and many interesting properties of them have been discovered. The probability that the walker can be find at a position is defined by diagonal elements of the density matrix. On the other hand, although off-diagonal parts of the density matrices have an important role to quantify quantumness, they have not received attention in quantum walks. We focus on the off-diagonal parts of the density matrices for discrete-time quantum walks on the line and derive limit theorems for them.