STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum Random Walks in One Dimension
Quantum Information Processing
Quantum Walk Algorithm for Element Distinctness
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Quantum Speed-Up of Markov Chain Based Algorithms
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Decoherence in quantum walks – a review
Mathematical Structures in Computer Science
Quantum Walks for Computer Scientists
Quantum Walks for Computer Scientists
Graph Spectra for Complex Networks
Graph Spectra for Complex Networks
Crossovers induced by discrete-time quantum walks
Quantum Information & Computation
Limit theorems for the discrete-time quantum walk on a graph with joined half lines
Quantum Information & Computation
Quantum walks: a comprehensive review
Quantum Information Processing
Hi-index | 0.00 |
The discrete time quantum walk which is a quantum counterpart of random walk plays important roles in the theory of quantum information theory. In the present paper, we focus on discrete time quantum walks viewed as quantization of random walks on the path. We obtain a weak limit theorem for the time averaged distribution of our quantum walks.