Related papers: One-Dimensional Coinless Quantum Walks
We investigate the ballistic spreading behavior of the one-dimensional discrete time quantum walks whose time evolution is driven by any balanced quantum coin. We obtain closed-form expressions for the long-time variance of position of…
We analyze the application of the history state formalism to quantum walks. The formalism allows one to describe the whole walk through a pure quantum history state, which can be derived from a timeless eigenvalue equation. It naturally…
We consider two independent quantum walks on separate lines augmented by partial or full swapping of coins after each step. For classical random walks, swapping or not swapping coins makes little difference to the random walk…
In this article we investigate the effects of shifting position decoherence, arisen from the tunneling effect in the experimental realization of the quantum walk, on the one-dimensional discreet time quantum walk. We show that in the regime…
A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…
Quantum random walks, - coined, lattice ones, - exhibit ballistic behavior with fascinating asymptotic patterns of the amplitudes. We show that averaging over the coins (using the Haar measure), these patterns blend into a spline. Also, we…
We investigate the quantum versions of a one-dimensional random walk, whose corresponding Markov Chain is of order 2. This corresponds to the walk having a memory of up to two previous steps. We derive the amplitudes and probabilities for…
We derive the continuous spacetime limit of the one dimensional lazy discrete time quantum walk, obtaining explicit macroscopic evolution equations for a three state model in the presence of decoherence. While continuum limits of two state…
In this paper we present closed-form expressions for the wave function that governs the evolution of the discrete-time quantum walk on a line when the coin operator is arbitrary. The formulas were derived assuming that the walker can either…
The classicalization of a decoherent discrete-time quantum walk on a line or an n-cycle can be demonstrated in various ways that do not necessarily provide a geometry-independent description. For example, the position probability…
Lazy quantum walks were presented by Andrew M. Childs to prove that the continuous-time quantum walk is a limit of the discrete-time quantum walk [Commun.Math.Phys.294,581-603(2010)]. In this paper, we discuss properties of lazy quantum…
Symmetrically evolving discrete quantum walk results in dynamic localization with zero mean displacement when the standard evolution operations are replaced by a temporal disorder evolution operation. In this work we show that the quantum…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
We consider quantum walks with position dependent coin on 1D lattice $\mathbb{Z}$. The dispersive estimate $\|U^tP_c u_0\|_{l^\infty}\lesssim (1+|t|)^{-1/3} \|u_0\|_{l^1}$ is shown under $l^{1,1}$ perturbation for the generic case and…
We study maximal coin-position entanglement generation via a discrete-time quantum walk, in which the coin operation is randomly selected from one of two coin operators set at each step. We solve maximal entanglement generation as an…
The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…
The development of quantum walks in the context of quantum computation, as generalisations of random walk techniques, led rapidly to several new quantum algorithms. These all follow unitary quantum evolution, apart from the final…
Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides…
The capability to generate and manipulate quantum states in high-dimensional Hilbert spaces is a crucial step for the development of quantum technologies, from quantum communication to quantum computation. One-dimensional quantum walk…
We define coined Quantum Walks on the infinite rooted binary tree given by unitary operators $U(C)$ on an associated infinite dimensional Hilbert space, depending on a unitary coin matrix $C\in U(3)$, and study their spectral properties.…