Related papers: Asymmetries in symmetric quantum walks on two-dime…
In this paper we present a model exhibiting a new type of continuous-time quantum walk (as a quantum mechanical transport process) on networks, which is described by a non-Hermitian Hamiltonian possessing a real spectrum. We call it…
For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus,…
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probability distribution and time-averaged probability distribution.…
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…
We address the question of symmetries of an important type of quantum walks. We introduce all the necessary definitions and provide a rigorous formulation of the problem. Using a thorough analysis, we reach the complete answer by presenting…
We show that the coined quantum walk on a line can be understood as an interference phenomenon, can be classically implemented, and indeed already has been. The walk is essentially two independent walks associated with the different coin…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior…
Quantum walks on networks are a paradigmatic model in quantum information theory. Quantum-walk algorithms have been developed for various applications, including spatial-search problems, element-distinctness problems, and node centrality…
We introduce and analyze a one-dimensional quantum walk with two time-independent rotations on the coin. We study the influence on the property of quantum walk due to the second rotation on the coin. Based on the asymptotic solution in the…
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…
We consider a random walk model in a one-dimensional environment, formed by several zones of finite width with the fixed transition probabilities. It is also assumed that the transitions to the left and right neighboring points have unequal…
In this paper, we study the properties of lackadaisical quantum walks on a line. This model is first proposed in~\cite{wong2015grover} as a quantum analogue of lazy random walks where each vertex is attached $\tau$ self-loops. We derive an…
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an…
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 stationary distribution, as they are unitary and reversible.…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
Quantum walks behave differently from what we expect and their probability distributions have unique structures. They have localization, singularities, a gap, and so on. Those features have been discovered from the view point of mathematics…
We consider the quantum mechanical transport of (coherent) excitons on small-world networks (SWN). The SWN are build from a one-dimensional ring of N nodes by randomly introducing B additional bonds between them. The exciton dynamics is…
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…