相关论文: Continuous deformations of the Grover walk preserv…
We investigate the transport properties and entanglement between spin and position of one-dimensional quantum walks starting from a qubit over position states following a delta-like (local state) and Gaussian (delocalized state)…
We study search by quantum walk on a two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [AKR05]. We show what the most natural coin transformation - Grover's diffusion transformation - has a wide class of exceptional…
We study the decoherence effects originating from state flipping and depolarization for two-dimensional discrete-time quantum walks using four-state and two-state particles. By quantifying the quantum correlations between the particle and…
We study the state transfer through quantum walks placed on a bounded one-dimensional path. We first consider continuous-time quantum walks from a Gaussian state. We find such a state when superposing centered on the starting and antipodal…
Quantization and asymptotic behaviour of a variant of discrete random walk on integers are investigated. This variant, the $\epsilon_{V^{k}}$ walk, has the novel feature that it uses many identical quantum coins keeping at the same time…
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we…
We introduce the concept of a quantum walk with two particles and study it for the case of a discrete time walk on a line. A quantum walk with more than one particle may contain entanglement, thus offering a resource unavailable in the…
We study the localization properties, energy spectra and coin-position entanglement of the aperiodic discrete-time quantum walks. The aperiodicity is described by spatially dependent quantum coins distributed on the lattice, whose…
We consider a quantum particle (walker) on a line who coherently chooses to jump to the left or right depending on the result of toss of a quantum coin. The lengths of the jumps are considered to be independent and identically distributed…
We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…
Disorder in coined quantum walks generally leads to localization. We investigate the influence of the localization on the entanglement properties of coined quantum walks. Specifically, we consider quantum walks on the line and explore the…
The CGMV method allows for the general discussion of localization properties for the states of a one-dimensional quantum walk, both in the case of the integers and in the case of the non negative integers. Using this method we classify,…
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…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
We investigate the relation between transport properties and entanglement between the internal (spin) and external (position) degrees of freedom in one-dimensional discrete time quantum walks. We obtain closed-form expressions for the…
We propose a new family of discrete-spacetime quantum walks capable to propagate on any arbitrary triangulations. Moreover we also extend and generalize the duality principle introduced by one of the authors, linking continuous local…
We present two long-time limit theorems of a 3-state quantum walk on the line when the walker starts from the origin. One is a limit measure which is obtained from the probability distribution of the walk at a long-time limit, and the other…
We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…