English
Related papers

Related papers: Limit theorem for a time-dependent coined quantum …

200 papers

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…

Probability · Mathematics 2015-09-02 Raffaella Carbone , Yan Pautrat

We study the asymptotic behaviour of occupation times of a transient random walk in quenched random environment on a strip in a sub-diffusive regime. The asymptotic behaviour of hitting times, which is a more traditional object of study, is…

Probability · Mathematics 2015-06-12 Dmitry Dolgopyat , Ilya Goldsheid

Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…

Quantum Physics · Physics 2015-05-19 Peter P. Rohde , Andreas Schreiber , Martin Stefanak , Igor Jex , Christine Silberhorn

First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…

Probability · Mathematics 2014-05-13 Nuno Luzia

One goal in the quantum-walk research is the exploitation of the intrinsic quantum nature of multiple walkers, in order to achieve the full computational power of the model. Here we study the behaviour of two non-interacting particles…

Quantum Physics · Physics 2016-02-26 Luca Rigovacca , Carlo Di Franco

We consider nonintersecting random walks satisfying the condition that the increments have a finite moment generating function. We prove that in a certain limiting regime where the number of walks and the number of time steps grow to…

Probability · Mathematics 2011-11-09 Jinho Baik , Toufic M. Suidan

In quantum computation theory, quantum random walks have been utilized by many quantum search algorithms which provide improved performance over their classical counterparts. However, due to the importance of the quantum decoherence…

Quantum Physics · Physics 2021-04-20 Chia-Han Chou , Wei-Shih Yang

We derive the weak limit theorem for a class of long range type quantum walks. To do it, we analyze spectral properties of a time evolution operator and prove that modified wave operators exist and are complete.

Mathematical Physics · Physics 2019-01-30 Kazuyuki Wada

The discrete-time quantum walk is a quantum counterpart of the random walk. It is expected that the model plays important roles in the quantum field. In the quantum information theory, entanglement is a key resource. We use the von Neumann…

Quantum Physics · Physics 2011-09-21 Yusuke Ide , Norio Konno , Takuya Machida

It has been discovered that open quantum walks diffusively distribute in space, since they were introduced in 2012. Indeed, some limit distributions have been demonstrated and most of them are described by Gaussian distributions. We operate…

Quantum Physics · Physics 2021-12-20 Takuya Machida

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…

Probability · Mathematics 2013-12-20 Stephane Attal , Nadine Guillotin-Plantard , Christophe Sabot

This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…

Probability · Mathematics 2011-03-31 Kohei Uchiyama

A Plastic Quantum Walk admits both continuous time and continuous spacetime. The model has been recently proposed by one of the authors in \cite{molfetta2019quantum}, leading to a general quantum simulation scheme for simulating fermions in…

Quantum Physics · Physics 2020-11-25 Michael Manighalam , Giuseppe Di Molfetta

We examine the sets of late points of a symmetric random walk on $Z^2$ projected onto the torus $Z^2_K$, culminating in a limit theorem for the cover time of the toral random walk. This extends the work done for the simple random walk in…

Probability · Mathematics 2014-04-16 Michael Carlisle

Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…

Probability · Mathematics 2019-04-30 Andrea Collevecchio , Kais Hamza , Laurent Tournier

Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a…

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…

Quantum Physics · Physics 2017-10-26 Thomas G. Wong

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in{\mathbb Z}^d)$ are two independent sequences of i.i.d. random variables with values in ${\mathbb Z}^d$ and…

Probability · Mathematics 2011-03-24 Fabienne Castell , Nadine Guillotin--Plantard , Françoise Pène

The quantum diffusion of a particle in an initially localized state on a cyclic lattice with N sites is studied. Diffusion and reconstruction time are calculated. Strong differences are found for even or odd number of sites and the limit…

Quantum Physics · Physics 2007-05-23 A. C. de la Torre , H. O. Martin , D. Goyeneche

We formulate a framework for discrete-time quantum walks, motivated by classical random walks with memory. We present a specific representation of the classical walk with memory 2 on which this is based. The framework has no need for coin…