Related papers: Quantum walks induced by Dirichlet random walks on…
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…
We consider a Grover walk model on a finite internal graph, which is connected with a finite number of semi-infinite length paths and receives the alternative inflows along these paths at each time step. After the long time scale, we know…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
Localization phenomena of quantum walks makes the propagation dynamics of a walker strikingly different from that corresponding to classical random walks. In this paper, we study the localization phenomena of four-state discrete-time…
The discrete quantum walk in N dimensions is analyzed from the perspective of its dispersion relations. This allows understanding known properties, as well as designing new ones when spatially extended initial conditions are considered.…
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
We study the distributions of the continuous-time quantum walk on a one-dimensional lattice. In particular we will consider walks on unbounded lattices, walks with one and two boundaries and Dirichlet boundary conditions, and walks with…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph…
While completely self-avoiding quantum walks have the distinct property of leading to a trivial unidirectional transport of a quantum state, an interesting and non-trivial dynamics can be constructed by restricting the self-avoidance to a…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
Quantum walks have been shown to have impressive transport properties compared to classical random walks. However, imperfections in the quantum walk algorithm can destroy any quantum mechanical speed-up due to Anderson localization. We…
We consider a sequence of finite quantum graphs with few loops, so that they converge, in the sense of Benjamini-Schramm, to a random infinite quantum tree. We assume these quantum trees are spectrally delocalized in some interval $I$, in…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
One-parameter family of discrete-time quantum-walk models on the square lattice, which includes the Grover-walk model as a special case, is analytically studied. Convergence in the long-time limit $t \to \infty$ of all joint moments of two…
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
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…
We consider the discrete time quantum random walks on a Sierpinski gasket. We study the hitting probability as the level of fractal goes to infinity in terms of their localization exponents $\beta_w$ , total variation exponents $\delta_w$…