Quantum random walk is the quantum counterpart of a classical random walk. The classical
random walk concept has long been used as a computational framework for designing …

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 …

Multidimensional quantum walks can exhibit highly nontrivial topological structure, providing
a powerful tool for simulating quantum information and transport systems. We present a …

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

Applications of quantum walks can depend on the number, exchange symmetry and
indistinguishability of the particles involved, and the underlying graph structures where they …

PageRank is an algorithm used by Google Search to rank web pages in their search engine
results. An important step for quantum networks is to quantize the classical protocol as …

The random walk formalism is used across a wide range of applications, from modelling
share prices to predicting population genetics. Likewise, quantum walks have shown much …

The quantum walk formalism is a widely used and highly successful framework for modeling
quantum systems, such as simulations of the Dirac equation, different dynamics in both the …

Centrality measure is an essential tool in network analysis and widely used in the domain of
computer science, biology and sociology. Taking advantage of the speedup offered by …

We present a highly efficient quantum circuit for performing continuous time quantum walks
(CTQWs) over an exponentially large set of combinatorial objects, provided that the objects …