Related papers: Quantum information spreading in a disordered quan…
Distributed quantum information processing seeks to overcome the scalability limitations of monolithic quantum devices by interconnecting multiple quantum processing nodes via classical and quantum communication. This approach extends the…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum computation among quantum…
Decoherence transforms a ballistic quantum walk into a diffusive classical random walk. After each step the environment measures the particle's path and the outside world gets to know the which-way information. The relation between the…
We analyze the quantum walk in higher spatial dimensions and compare classical and quantum spreading as a function of time. Tensor products of Hadamard transformations and the discrete Fourier transform arise as natural extensions of the…
We introduce the Peierls substitution to a two-dimensional discrete-time quantum walk on a square lattice to examine the spreading dynamics and the coin-position entanglement in the presence of an artificial gauge field. We use the ratio of…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
The motion of self-propelled particles is modeled as a persistent random walk. An analytical framework is developed that allows the derivation of exact expressions for the time evolution of arbitrary moments of the persistent walk's…
Rules for quantizing the walker+coin parts of a classical random walk are provided by treating them as interacting quantum systems. A quantum optical random walk (QORW), is introduced by means of a new rule that treats quantum or classical…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
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 compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us…
Quantum computers are susceptible to noises from the outside world. We investigate the effect of perturbation on the hitting time of a quantum walk and the stationary distribution prepared by a quantum walk based algorithm. The perturbation…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum operations among quantum…
We investigate the evolution dynamics of inhomogeneous discrete-time one-dimensional quantum walks displaying long-range correlations in both space and time. The associated quantum coin operators are built to exhibit a random inhomogeneity…
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…
In this work we build a theoretical framework for the transport of information in quantum systems. This is a framework aimed at describing how out of equilibrium open quantum systems move information around their state space, using an…
We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all…
The task of finding an element in an unstructured database is known as spatial search and can be expressed as a quantum walk evolution on a graph. In this article, we modify the usual search problem by adding an extra trapping vertex to the…
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 discuss spreading estimates for dynamical systems given by the iteration of an extended CMV matrix. Using a connection due to Cantero--Gr\"unbaum--Moral--Vel\'azquez, this enables us to study spreading rates for quantum walks in one…