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

This tutorial article showcases the many varieties and uses of quantum walks. Discrete time
quantum walks are introduced as counterparts of classical random walks. The emphasis is …

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 …

Motivated by the immense success of random walk and Markov chain methods in the design
of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the …

This article aims to provide an introductory survey on quantum random walks. Starting from a
physical effect to illustrate the main ideas we will introduce quantum random walks, review …

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

The hitting time of a classical random walk (Markov chain) is the time required to detect the
presence of—or equivalently, to find—a marked state. The hitting time of a quantum walk is …

Quantum walks, being the quantum analog of classical random walks, are expected to
provide a fruitful source of quantum algorithms. A few such algorithms have already been …

The development of quantum algorithms based on quantum versions of random walks is
placed in the context of the emerging field of quantum computing. Constructing a suitable …

Random walks have been employed in virtually every science related discipline to model
everyday phenomena such as biochemical reaction pathways and DNA synapsis …