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 AND THEIR ALGORITHMIC APPLICATIONS | International Journal of
Quantum Information World Scientific Search This Journal Anywhere Quick Search in Journals …

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 …

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

Spatial search by a discrete-time quantum walk can find a marked node on any ergodic,
reversible Markov chain P quadratically faster than its classical counterpart, ie, in a time that …

We set the ground for a theory of quantum walks on graphs-the generalization of random
walks on finite graphs to the quantum world. Such quantum walks do not converge to any …

Quantum walks are quantum counterparts of random walks. In the last 5 years, they have
become one of main methods of designing quantum algorithms. Quantum walk based …

Quantum random walks on graphs have been shown to display many interesting properties,
including exponentially fast hitting times when compared with their classical counterparts …

Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to
classical random walk, a quantum walk is a time-homogeneous quantum process on a …

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by
Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks …