15 research outputs found
Localization of the Grover walks on spidernets and free Meixner laws
A spidernet is a graph obtained by adding large cycles to an almost regular
tree and considered as an example having intermediate properties of lattices
and trees in the study of discrete-time quantum walks on graphs. We introduce
the Grover walk on a spidernet and its one-dimensional reduction. We derive an
integral representation of the -step transition amplitude in terms of the
free Meixner law which appears as the spectral distribution. As an application
we determine the class of spidernets which exhibit localization. Our method is
based on quantum probabilistic spectral analysis of graphs.Comment: 32 page
Quantum walks: a comprehensive review
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 universal model of quantum computation. Quantum walks is
now a solid field of research of quantum computation full of exciting open
problems for physicists, computer scientists, mathematicians and engineers.
In this paper we review theoretical advances on the foundations of both
discrete- and continuous-time quantum walks, together with the role that
randomness plays in quantum walks, the connections between the mathematical
models of coined discrete quantum walks and continuous quantum walks, the
quantumness of quantum walks, a summary of papers published on discrete quantum
walks and entanglement as well as a succinct review of experimental proposals
and realizations of discrete-time quantum walks. Furthermore, we have reviewed
several algorithms based on both discrete- and continuous-time quantum walks as
well as a most important result: the computational universality of both
continuous- and discrete- time quantum walks.Comment: Paper accepted for publication in Quantum Information Processing
Journa