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
Quantum Walks for Computer Scientists
Quantum Walks for Computer Scientists
Localization of an inhomogeneous discrete-time quantum walk on the line
Quantum Information Processing
Sojourn times of the Hadamard walk in one dimension
Quantum Information Processing
Dynamical localization for d-dimensional random quantum walks
Quantum Information Processing
Asymptotic behavior of quantum walks with spatio-temporal coin fluctuations
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
Mixing-time and large-decoherence in continuous-time quantum walks on one-dimension regular networks
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 |
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.