English
Related papers

Related papers: $\epsilon$-Uniform Mixing in Discrete Quantum Walk…

200 papers

We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…

Statistical Mechanics · Physics 2017-04-03 A. V. Nazarenko , V. Blavatska

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

Probability · Mathematics 2012-02-28 Mohammed Abdullah

We show that the hitting time of the discrete quantum walk on a symmetric Cayley graph over $\Z_2^n $ from a vertex to its antipodal is polynomial in degree of the graph. We prove that returning time of quantum walk on a symmetric Cayley…

Quantum Physics · Physics 2013-07-31 Ilnur Khuziev

We investigate continuous-time quantum walks of two indistinguishable particles (bosons, fermions or hard-core bosons) in one-dimensional lattices with nearest-neighbour interactions. The two interacting particles can undergo independent-…

Quantum Physics · Physics 2014-02-17 Xizhou Qin , Yongguan Ke , Xiwen Guan , Zhibing Li , Natan Andrei , Chaohong Lee

In this Chapter, we present some interesting properties of quantum walks on the line. We concentrate our attention in the emergence of invariance and provide some insights into the ultimate origin of the observed behavior. In the first part…

Quantum Physics · Physics 2016-09-02 Miquel Montero

Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…

Quantum Physics · Physics 2024-05-28 John C Vining , Howard A. Blair

We propose a quantum walk defined by digraphs (mixed graphs). This is like Grover walk that is perturbed by a certain complex-valued function defined by digraphs. The discriminant of this quantum walk is a matrix that is a certain…

Combinatorics · Mathematics 2021-03-10 Sho Kubota , Etsuo Segawa , Tetsuji Taniguchi

We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…

Data Analysis, Statistics and Probability · Physics 2007-05-23 T. Antal , S. Redner

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…

Probability · Mathematics 2022-06-08 Raffaella Carbone , Federico Girotti , Anderson Melchor Hernandez

Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation.…

Quantum Physics · Physics 2012-07-11 Bálint Kollár , Tamás Kiss , Jaroslav Novotný , Igor Jex

Within a special multi-coin quantum walk scheme we analyze the effect of the entanglement of the initial coin state. For states with a special entanglement structure it is shown that this entanglement can be meausured with the mean value of…

Quantum Physics · Physics 2009-11-11 Jochen Endrejat , Helmut Buettner

Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…

Statistical Mechanics · Physics 2015-03-24 Gerard Le Caer

Quantum random walks are shown to have non-intuitive dynamics which makes them an attractive area of study for devising quantum algorithms for long-standing open problems as well as those arising in the field of quantum computing. In the…

Quantum Physics · Physics 2009-11-13 K. Manouchehri , J. B. Wang

Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary. In particular, we prove that the random walk…

Probability · Mathematics 2015-09-10 Zhen-Qing Chen , David A. Croydon , Takashi Kumagai

We use discrete-event simulation on a digital computer to study two different models of experimentally realizable quantum walks. The simulation models comply with Einstein locality, are as "realistic" as the one of the simple random walk in…

Quantum Physics · Physics 2020-05-08 Madita Willsch , Dennis Willsch , Kristel Michielsen , Hans De Raedt

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…

Mathematical Physics · Physics 2026-02-16 Alain Joye , Andreas Schaefer , Simone Warzel

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

Statistical Mechanics · Physics 2021-09-27 Takashi Odagaki

The concept of random walk, in which particles or waves undergo multiple collisions with the microscopic constituents of a surrounding medium, is central to understanding diffusive transport across many research areas. However, this…

The subject of this paper is a kind of dynamical systems called quantum walks. We study one-dimensional homogeneous analytic quantum walks U. We explain how to identify the space of all the uniform intertwining operators between these…

Mathematical Physics · Physics 2019-02-08 Hiroki Sako

This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…

Quantum Physics · Physics 2016-12-07 Beat Tödtli , Monika Laner , Jouri Semenov , Beatrice Paoli , Marcel Blattner , Jérôme Kunegis
‹ Prev 1 8 9 10 Next ›