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 …

A proof that continuous-time quantum walks are universal for quantum computation, using
unweighted graphs of low degree, has recently been presented by AM Childs [Phys. Rev …

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

We propose a novel algorithm for quantum spatial search on a star graph using interleaved
continuous-time quantum walks and marking oracle queries. Initializing the system in the …

If X is a graph with adjacency matrix A, then we define H (t) to be the operator exp (itA). We
say that we have perfect state transfer in X from the vertex u to the vertex v at time τ if the uv …

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 …

In recent years, rapid developments of quantum computer are witnessed in both the
hardware and the algorithm domains, making it necessary to have an updated review of …

Hitting times for discrete quantum walks on graphs give an average time before the walk
reaches an ending condition. To be analogous to the hitting time for a classical walk, the …