Related papers: Quantum random walk approximation on locally compa…
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…
We characterise the convergence of a certain class of discrete time Markov processes toward locally Feller processes in terms of convergence of associated operators. The theory of locally Feller processes is applied to L\'evy-type processes…
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
Quantum walks on networks are a paradigmatic model in quantum information theory. Quantum-walk algorithms have been developed for various applications, including spatial-search problems, element-distinctness problems, and node centrality…
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…
We present two examples of actions of non-regular locally compact quantum groups on their homogeneous spaces. The homogeneous spaces are defined in a way specific to these examples, but the definitions we use have the advantage of being…
Given a conditionally completely positive map $\mathcal L$ on a unital $\ast$-algebra $\A$, we find an interesting connection between the second Hochschild cohomology of $\A$ with coefficients in the bimodule $E_{\mathcal L}=\B^a(\A \oplus…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
We study the Haagerup--Kraus approximation property for locally compact quantum groups, generalising and unifying previous work by Kraus--Ruan and Crann. Along the way we discuss how multipliers of quantum groups interact with the…
We develop a new approach to random walks on de Bruijn graphs over the alphabet $A$ through right congruences on $A^k$, defined using the natural right action of $A^+$. A major role is played by special right congruences, which correspond…
This survey is concerned with random walks on mapping class groups. We illustrate how the actions of mapping class groups on Teichm\"uller spaces or curve complexes reveal the nature of random walks, and vice versa. Our emphasis is on the…
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior…
Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodes corresponding to quantum states of a fixed basis. We…
In this paper, we consider the quantum walk on $\mathbb{Z}$ with attachment of one-length path periodically. This small modification to $\mathbb{Z}$ provides localization of the quantum walk. The eigenspace causing this localization is…
Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.
The behaviour of random quantum walks is known to be diffusive. Here we study discrete time quantum walks in weak stochastic gauge fields. In the case of position and spin dependent gauge field, we observe a transition from ballistic to…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
In the present paper we find necessary and sufficient conditions for recurrence of random walks on arbitrary subgroups of the group of rational numbers $\mathbb{Q}$.
Random walks are fundamental models of stochastic processes with applications in various fields including physics, biology, and computer science. We study classical and quantum random walks under the influence of stochastic resetting on…