Related papers: Quantum walks under superposition of causal order
In this letter we introduce the concept of a driven quantum walk. This work is motivated by recent theoretical and experimental progress that combines quantum walks and parametric down- conversion, leading to fundamentally different…
Quantum walks are dynamic systems with a wide range of applications in quantum computation and quantum simulation of analog systems, therefore it is of common interest to understand what changes from an isolated process to one embedded in…
In this study we show a way of achieving the reverse evolution of n-dimensional quantum walks by introducing interventions on the coin degree of freedom during the forward progression of the coin-walker system. Only a single intervention is…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…
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…
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…
We investigate quantum superposition effects in two-dimensional quantum walks of identical particles with different statistics under particle exchange, starting from various different initial configurations. To characterize interparticle…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…
We perform the scattering analysis of the evolution operator of quantum walks with an anisotropic coin, and we prove a weak limit theorem for their asymptotic velocity. The quantum walks that we consider include one-defect models, two-phase…
We study quantum walk on a ladder with combination of conventional and split-step protocols. The two components of the walk resulting from periodic boundary conditions can be made to have three kinds of probability distributions. Two of…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
Discrete-time quantum walks are known to exhibit exotic topological states and phases. Physical realization of quantum walks in a noisy environment may destroy these phases. We investigate the behavior of topological states in quantum walks…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
We study the simulation of the topological phases in three subsequent dimensions with quantum walks. We are mainly focused on the completion of a table for the protocols of the quantum walk that could simulate different family of the…
We analyze a set of discrete-time quantum walks for which the displacements on a chain follow binary aperiodic jumps according to three paradigmatic sequences: Fibonacci, Thue-Morse and Rudin-Shapiro. We use a generalized Hadamard coin…