Related papers: Return probability of quantum and correlated rando…
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…
In this paper we study convergence of random walks, on finite quantum groups, arising from linear combination of irreducible characters. We bound the distance to the Haar state and determine the asymptotic behavior, i.e. the limit state if…
Random walks on general graphs play an important role in the understanding of the general theory of stochastic processes. Beyond their fundamental interest in probability theory, they arise also as simple models of physical systems. A brief…
A well known connection between first-passage probability of random walk and distribution of electrical potential described by Laplace equation is studied. We simulate random walk in the plane numerically as a discrete time process with…
Let $(Y_n)$ be a sequence of i.i.d. $\mathbb Z$-valued random variables with law $\mu$. The reflected random walk $(X_n)$ is defined recursively by $X_0=x \in \mathbb N_0, X_{n+1}=|X_n+Y_{n+1}|$. Under mild hypotheses on the law $\mu$, it…
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the…
We report on the possibility of controlling quantum random walks with a step-dependent coin. The coin is characterized by a (single) rotation angle. Considering different rotation angles, one can find diverse probability distributions for…
The P\'olya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. \v{S}tefa\v{n}\'ak, I. Jex and T. Kiss, Phys. Rev. Lett. \textbf{100}, 020501 (2008)] which is based on a…
We introduce and analyze a one-dimensional quantum walk with two time-independent rotations on the coin. We study the influence on the property of quantum walk due to the second rotation on the coin. Based on the asymptotic solution in the…
We investigate the role of a time and spin-dependent phase shift on the evolution of one-dimensional discrete-time quantum walks. By employing Floquet engineering, a time and spin-dependent phase shift ($\phi$) is imprinted onto the…
A convergence theorem is obtained for quantum random walks with particles in an arbitrary normal state. This result unifies and extends previous work on repeated-interactions models, including that of the author (2010, J. London Math. Soc.…
Quantum walk models have been used as an algorithmic tool for quantum computation and to describe various physical processes. This paper revisits the relationship between relativistic quantum mechanics and the quantum walks. We show the…
We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
We study the discrete quantum groups $\Gamma$ whose group algebra has an inner faithful representation of type $\pi:C^*(\Gamma)\to M_K(\mathbb C)$. Such a representation can be thought of as coming from an embedding $\Gamma\subset U_K$. Our…
We are studying the motion of a random walker in two and three dimensional continuum with uniformly distributed jump-length. This is different from conventional Lavy flight. In 2D and 3D continuum, a random walker can move in any direction,…
The class of random walks in one dimension, returning to the origin, restricted by the requirement that any site visited (different from the origin) is visited an even number of times, is analyzed in the present note. We call this class the…
The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum random walk (QRW) with the problem of data clustering, and develop two clustering algorithms based on the one…
We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.
We demonstrate a quantum walk with time-dependent coin bias. With this technique we realize an experimental single-photon one-dimensional quantum walk with a linearly-ramped time-dependent coin flip operation and thereby demonstrate two…