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 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 …

It is known that any positive-energy state of a free Dirac particle that is initially highly
localized evolves in time by spreading at speeds close to the speed of light. As recently …

Quantum walks, both discrete (coined) and continuous time, form the basis of several
quantum algorithms and have been used to model processes such as transport in spin …

Quantization of a random-walk model is performed by giving a qudit (a multicomponent
wave function) to a walker at site and by introducing a quantum coin, which is a matrix …

Discrete-time quantum walks (QWs) are transportation models of single quantum particles
over a lattice. Their evolution is driven through causal and local unitary operators. QWs are a …

In this thesis we have focused on two topics: Discrete Quantum Walks and Quantum Image
Processing. Our work is a contribution within the field of quantum computation from the …

We present numerical studies of quantum walks on C 60 and related graphene structures to
investigate their transport properties. Also known as a honeycomb lattice, the lattice formed …

The position density of a “particle” performing a continuous-time quantum walk on the
integer lattice, viewed on length scales inversely proportional to the time t, converges (as t …