Related papers: Quantum Walks on Trees with Disorder: Decay, Diffu…
Quantum walks on translation invariant regular graphs spread quadratically faster than their classical counterparts. The same coherence that gives them this quantum speedup inhibits, or even stops their spread in the presence of disorder.…
The interplay between disorder and quantum interference leads to a wide variety of physical phenomena including celebrated Anderson localization -- the complete absence of diffusive transport due to quantum interference between different…
We study Anderson localization in a generalized discrete time quantum walk - a unitary map related to a Floquet driven quantum lattice. It is controlled by a quantum coin matrix which depends on four angles with the meaning of potential and…
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…
We investigate the properties of a quantum walk which can simulate the behavior of a spin $1/2$ particle in a model with an ordinary spatial dimension, and one extra dimension with warped geometry between two branes. Such a setup…
We study quantum transport in anisotropic 3D disorder and show that non rotation invariant correlations can induce rich diffusion and localization properties. For instance, structured finite-range correlations can lead to the inversion of…
The quantum walk is the quantum analogue of the well-known random walk, which forms the basis for models and applications in many realms of science. Its properties are markedly different from the classical counterpart and might lead to…
One-dimensional discrete-time quantum walk has played an important role in development of quantum algorithms and protocols for different quantum simulations. The speedup observed in quantum walk algorithms is attributed to quantum…
Entanglement generation in discrete time quantum walks is deemed to be another key property beyond the transport behaviors. The latter has been widely used in investigating the localization or topology in quantum walks. However, there are…
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior…
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…
Quantum percolation describes the problem of a quantum particle moving through a disordered system. While certain similarities to classical percolation exist, the quantum case has additional complexity due to the possibility of Anderson…
We investigate quantum transport in binary tree structures and in hypercubes for the disordered Frenkel-exciton Hamiltonian under pure dephasing noise. We compute the energy transport efficiency as a function of disorder and dephasing…
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the…
Quantum walks constitute an important tool for designing quantum algorithms and information processing tasks. In a lackadaisical walk, in addition to the possibility of moving out of a node, the walker can remain on the same node with some…
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition…
We have studied how decoherence affects a quantum walk on the line. As expected, it is highly sensitive, consisting as it does of an extremely delocalized particle. We obtain an expression for the rate at which the standard deviation falls…
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 walks are known to propagate quadratically faster than their classical counterparts and are used to model dynamics in various quantum systems. The spread of the quantum walk in position space shows anomalous diffusion behavior. By…
In this paper, we study the quantum walk on the 2D Penrose Lattice, which is intermediate between periodic and disordered structure. Quantum walk on Penrose Lattice is less efficient in transport comparing to the regular lattices. By…