Related papers: Central limit theorems for open quantum random wal…

Open Quantum Random Walks, as developed in \cite{APSS}, are a quantum generalization of Markov chains on finite graphs or on lattices. These random walks are typically quantum in their behavior, step by step, but they seem to show up a…

Recently, Ishiwata, Kawabi and Kotani [2] proved two kinds of central limit theorems for non-symmetric random walks on crystal lattices from the view point of discrete geometric analysis. In the present paper, we obtain yet another kind of…

We consider the limit distributions of open quantum random walks on one-dimensional lattice space. We introduce a dual process to the original quantum walk process, which is quite similar to the relation of Schr\"odinger-Heisenberg…

We consider homogeneous open quantum random walks on a lattice with finite dimensional local Hilbert space and we study in particular the position process of the quantum trajectories of the walk. We prove that the properly rescaled position…

In this work we aim at proving central limit theorems for open quantum walks on $\mathbb{Z}^d$. We study the case when there are various classes of vertices in the network. Furthermore, we investigate two ways of distributing the vertex…

Quantum walks are considered to be quantum counterparts of random walks.They show us impressive probability distributions which are different from those of random walks.That fact has been precisely proved in terms of mathematics and some of…

The method of the quantum probability theory only requires simple structural data of graph and allows us to avoid a heavy combinational argument often necessary to obtain full description of spectrum of the adjacency matrix. In the present…

We study time-dependent discrete-time quantum walks on the one-dimensional lattice. We compute the limit distribution of a two-period quantum walk defined by two orthogonal matrices. For the symmetric case, the distribution is determined by…

We prove a central limit theorem for random walks with finite variance on linear groups.

We study Open Quantum Random Walks for which the underlying graph is a lattice, and the generators of the walk are translation-invariant. We consider the quantum trajectory associated with the OQRW, which is described by a position process…

In this article we consider a natural class of random walks on free products of graphs, which arise as convex combinations of random walks on the single factors. From the works of Gilch [6,7] it is well-known that for these random walks the…

We propose an experimental realization of discrete quantum random walks using neutral atoms trapped in optical lattices. The random walk is taking place in position space and experimental implementation with present day technology --even…

A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…

The main result of this paper is a general central limit theorem for distributions defined by certain renewal type equations. We apply this to weakly self-avoiding random walks. We give good error estimates and Gaussian tail estimates which…

We consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…

We consider random walks in dynamic random environments which arise naturally as spatial embeddings of ancestral lineages in spatial locally regulated population models. In particular, as the main result, we prove the quenched central limit…

In [Kozma-Toth, Ann. Probab. v 45, pp 4307-4347 (2017)] the weak CLT was established for random walks in doubly stochastic (or, divergence-free) random environments, under the following conditions: 1. Strict ellipticity assumed for the…

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 chains and quantum chemistry. The enhanced spreading and mixing…

In the present paper, we study long time asymptotics of non-symmetric random walks on crystal lattices from a view point of discrete geometric analysis due to Kotani and Sunada [11, 23]. We observe that the Euclidean metric associated with…

We consider a multidimensional random walk in a product random environment with bounded steps, transience in some spatial direction, and high enough moments on the regeneration time. We prove an invariance principle, or functional central…