One-dimensional quantum walks with absorbing boundaries

Authors:
Eric Bach;Susan Coppersmith;Marcel Paz Goldschen;Robert Joynt;John Watrous
Affiliations:
Computer Sciences Department, University of Wisconsin, 1210 W. Dayton St., Madison, WI;Department of Physics, University of Wisconsin, 1150 University Avenue, Madison, WI;Department of Physics, University of Wisconsin, 1150 University Avenue, Madison, WI;Department of Physics, University of Wisconsin, 1150 University Avenue, Madison, WI;Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, AB, Canada T2N 1N4
Venue:
Journal of Computer and System Sciences
Year:
2004

Citing 6
Cited 4

Quantum simulations of classical random walks and undirected graph connectivity

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
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
An Example of the Difference Between Quantum and Classical Random Walks

Quantum Information Processing
Quantum Walks on the Hypercube

RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Decoherence in quantum walks – a review

Mathematical Structures in Computer Science
Optimal computation with non-unitary quantum walks

Theoretical Computer Science
The CGMV method for quantum walks

Quantum Information Processing
Quantum walks: a comprehensive review

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we analyze the behavior of quantum random walks. In particular, we present several new results for the absorption probabilities in systems with both one and two absorbing walls for the one-dimensional case. We compute these probabilities both by employing generating functions and by use of an eigenfunction approach. The generating function method is used to determine some simple properties of the walks we consider, but appears to have limitations. The eigenfunction approach works by relating the problem of absorption to a unitary problem that has identical dynamics inside a certain domain, and can be used to compute several additional interesting properties, such as the time dependence of absorption. The eigenfunction method has the distinct advantage that it can be extended to arbitrary dimensionality. We outline the solution of the absorption probability problem of a (D-1)-dimensional wall in a D-dimensional space.