Related papers: Quantum Walk with Jumps
Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…
In this paper, we consider continuous-time quantum walks (CTQWs) on one-dimension ring lattice of N nodes in which every node is connected to its 2m nearest neighbors (m on either side). In the framework of the Bloch function ansatz, we…
We investigate one-dimensional (1D) discrete time quantum walks (QWs) with spatially or temporally random defects as a consequence of interactions with random environments. We focus on the QWs with chiral symmetry in a topological phase,…
Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks…
Quantum walks (QW) are of crucial importance in the development of quantum information processing algorithms. Recently, several quantum algorithms have been proposed to implement network analysis, in particular to rank the centrality of…
We study the continuous time quantum walk of a single particle (initially localized at a single site) on a one-dimensional spatial lattice with complex nearest neighbour and next-nearest neighbour hopping amplitudes. Complex couplings lead…
The behaviour of random quantum walks is known to be diffusive. Here we study discrete time quantum walks in weak stochastic gauge fields. In the case of position and spin dependent gauge field, we observe a transition from ballistic to…
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…
Recently, quantized versions of random walks have been explored as effective elements for quantum algorithms. In the simplest case of one dimension, the theory has remained divided into the discrete-time quantum walk and the continuous-time…
We study "the Wojcik model" which is a discrete-time quantum walk (QW) with one defect in one dimension, introduced by Wojcik et al.. For the Wojcik model, we give the weak convergence theorem describing the ballistic behavior of the walker…
For one-dimensional Jump-Drift and Jump-Diffusion processes converging towards some steady state, the large deviations of a long dynamical trajectory are described from two perspectives. Firstly, the joint probability of the empirical…
The discrete-time quantum walk (QW) is determined by a unitary matrix whose component is complex number. Konno (2015) extended the QW to a walk whose component is quaternion.We call this model quaternionic quantum walk (QQW). The…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
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…
Quantum Key Distribution (QKD) is an emerging cryptographic method designed for secure key sharing. Its security is theoretically guaranteed by fundamental principles of quantum mechanics, making it a leading candidate for future…
Quantum walks are well-known for their ballistic dispersion, traveling $\Theta(t)$ away in $t$ steps, which is quadratically faster than a classical random walk's diffusive spreading. In physical implementations of the walk, however, the…
Quantum random walk finds application in efficient quantum algorithms as well as in quantum network theory. Here we study the mixing time of a discrete quantum walk over a square lattice in presence percolation and decoherence. We consider…
We extend to the gamut of functional forms of the probability distribution of the time-dependent step-length a previous model dubbed Elephant Quantum Walk, which considers a uniform distribution and yields hyperballistic dynamics where the…
We set the criteria under which superposition of causal order can be incorporated in to quantum walks. In particular, we show that only periodic quantum walks or those with at least one disorder exhibit Superposition of causal order under…