Limit theorems and absorption problems for quantum random walks in one dimension

Authors:
Norio Konno
Affiliations:
Department of Applied Mathematics, Faculty of Engineering, Yokohama National University, Yokohama, Japan
Venue:
Quantum Information & Computation
Year:
2002

Citing 8
Cited 2

On asymptotics of Jacobi polynomials

SIAM Journal on Mathematical Analysis
One-dimensional quantum walks

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum walks on graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
An Example of the Difference Between Quantum and Classical Random Walks

Quantum Information Processing
Quantum Random Walks in One Dimension

Quantum Information Processing
Exponential algorithmic speedup by a quantum walk

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the Digraph of a Unitary Matrix

SIAM Journal on Matrix Analysis and Applications

Quantum walks: a comprehensive review

Quantum Information Processing
Realization of the probability laws in the quantum central limit theorems by a quantum walk

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider limit theorems, symmetry of distribution, and absorption problems for two types of one-dimensional quantum random walks determined by 2 × 2 unitary matrices using our PQRS method. The one type was introduced by Gudder in 1988, and the other type was studied intensively by Ambainis et al. in 2001. The difference between both types of quantum random walks is also clarified.