Quantum walks, the quantum mechanical counterpart of classical random walks, is an
advanced tool for building quantum algorithms that has been recently shown to constitute a …

The development of quantum walks in the context of quantum computation, as
generalisations of random walk techniques, has led rapidly to several new quantum …

QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS | International Journal of
Quantum Information World Scientific Search This Journal Anywhere Quick Search in Journals …

This letter treats the quantum random walk on the line determined by a 2× 2 unitary matrix U.
A combinatorial expression for the mth moment of the quantum random walk is presented by …

Quantum walks can be considered as a generalized version of the classical random walk.
There are two classes of quantum walks, that is, the discrete-time (or coined) and the …

We formulate and prove a general weak limit theorem for quantum random walks in one and
more dimensions. With X n denoting position at time n, we show that X n/n converges weakly …

A new model of quantum random walks is introduced, on lattices as well as on finite graphs.
These quantum random walks take into account the behavior of open quantum systems …

We study a generalized Hadamard walk in one dimension with three inner states. The
particle governed by the three-state quantum walk moves, in superposition, both to the left …

Recently, quantized versions of random walks have been explored as effective elements for
quantum algorithms. In the simplest case of one dimension, the theory has remained divided …

We study the asymptotic position distribution of general quantum walks on a lattice,
including walks with a random coin, which is chosen from step to step by a general Markov …