English
Related papers

Related papers: Non-stationary quantum walks on the cycle

200 papers

We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…

Quantum Physics · Physics 2020-04-06 Václav Potoček

We propose two possible definitions for a version of Kemeny's constant of a graph based on non-backtracking random walks (in place of the usual simple random walk). We show that these two definitions coincide for edge-transitive graphs, and…

Combinatorics · Mathematics 2025-10-09 Jane Breen , Mark Kempton , Adam Knudson , Matthew Shumway

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

The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular…

Quantum Physics · Physics 2022-02-01 Peter Høyer , Zhan Yu

In this expository note, we study several families of periodic graphs which satisfy a sufficient condition for the ergodicity of the associated continuous-time quantum walk. For these graphs, we compute the limiting distribution of the walk…

Mathematical Physics · Physics 2025-03-12 Anne Boutet de Monvel , Kiran Kumar A. S. , Mostafa Sabri

It is demonstrated that in contrast to the well-known case with a quantum particle moving freely in a real line, the wave packets corresponding to the coherent states for a free quantum particle on a circle do not spread but develop…

Quantum Physics · Physics 2009-11-06 K. Kowalski , J. Rembielinski

We propose a scheme to implement the one-dimensional coined quantum walk with electrons transported through a two-dimensional network of spintronic semiconductor quantum rings. The coin degree of freedom is represented by the spin of the…

Mesoscale and Nanoscale Physics · Physics 2009-07-30 Orsolya Kálmán , Tamás Kiss , Péter Földi

Several inequalities are proved for the mixing time of discrete-time quantum walks on finite graphs. The mixing time is defined differently than in Aharonov, Ambainis, Kempe and Vazirani (2001) and it is found that for particular examples…

Probability · Mathematics 2010-07-23 Vladislav Kargin

This paper continues the previous work (Quantum Inf. Process (2019)) by two authors of the present paper about a spectral mapping property of chiral symmetric unitary operators. In physics, they treat non-unitary time-evolution operators to…

Mathematical Physics · Physics 2022-09-28 Keisuke Asahara , Daiju Funakawa , Etsuo Segawa , Akito Suzuki , Noriaki Teranishi

A simple coined quantum walk in one dimension can be characterized by a $SU(2)$ operator with three parameters which represents the coin toss. However, different such coin toss operators lead to equivalent dynamics of the quantum walker. In…

Quantum Physics · Physics 2014-12-04 Sandeep K Goyal , Thomas Konrad , Lajos Diósi

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

Probability · Mathematics 2015-09-15 Peggy Cénac , Basile De Loynes , Arnaud Le Ny , Yoann Offret

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

Probability · Mathematics 2019-03-05 Thomas Sauerwald , Luca Zanetti

In a continuous-time quantum walk on a network of qubits, pretty good state transfer is the phenomenon of state transfer between two vertices with fidelity arbitrarily close to 1. We construct families of graphs to demonstrate that there is…

Combinatorics · Mathematics 2023-05-24 Ada Chan , Peter Sin

Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always…

Quantum Physics · Physics 2011-07-20 Viv Kendon

Quantum walks on graphs are fundamental to quantum computing and have led to many interesting open problems in algebraic graph theory. This review article highlights three key classes of open problems in this domain; perfect state transfer,…

Combinatorics · Mathematics 2024-04-04 Gabriel Coutinho , Krystal Guo

We discuss spreading estimates for dynamical systems given by the iteration of an extended CMV matrix. Using a connection due to Cantero--Gr\"unbaum--Moral--Vel\'azquez, this enables us to study spreading rates for quantum walks in one…

Mathematical Physics · Physics 2016-03-04 David Damanik , Jake Fillman , Darren C. Ong

This work focuses on the study of quantum stochastic walks, which are a generalization of coherent, i. e. unitary quantum walks. Our main goal is to present a measure of a coherence of the walk. To this end, we utilize the asymptotic…

Quantum Physics · Physics 2018-03-21 Krzysztof Domino , Adam Glos , Mateusz Ostaszewski , Łukasz Pawela , Przemysław Sadowski

We investigate a system of two atoms in an optical lattice, performing a quantum walk by state-dependent shift operations and a coin operation acting on the internal states. The atoms interact, e.g., by cold collisions, whenever they are in…

We introduce and study peak state transfer, a notion of high state transfer in qubit networks modeled by continuous-time quantum walks. Unlike perfect or pretty good state transfer, peak state transfer does not require fidelity arbitrarily…

Quantum Physics · Physics 2025-10-02 Gabriel Coutinho , Krystal Guo , Vincent Schmeits

We construct infinite families of graphs in which pretty good state transfer can be induced by adding a potential to the nodes of the graph (i.e. adding a number to a diagonal entry of the adjacency matrix). Indeed, we show that given any…

Combinatorics · Mathematics 2018-04-06 Or Eisenberg , Mark Kempton , Gabor Lippner