Related papers: Continuous-time quantum walks on semi-regular spid…
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…
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
It has been proved by Kempe that discrete quantum walks on the hypercube (HC) hit exponentially faster than the classical analog. The same was also observed numerically by Krovi and Brun for a slightly different property, namely, the…
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via a monitoring of the position. We discuss the…
We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…
In this paper, we study coherent exciton transport of continuous-time quantum walks on star graph. Exact analytical results of the transition probabilities are obtained by means of the Gram-Schmidt orthonormalization of the eigenstates. Our…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
We introduce a model of a quantum walk on a graph in which a particle jumps between neighboring nodes and interacts with independent spins sitting on the edges. Entanglement propagates with the walker. We apply this model to the case of a…
The quantum walk is a dynamical protocol which describes the motion of spinful particles on a lattice. Also, it has been demonstrated to be a powerful platform to explore topological quantum matter. Recently, the quantum walk in coherent…
We model coherent exciton transport in dendrimers by continuous-time quantum walks (CTQWs). For dendrimers up to the second generation the coherent transport shows perfect recurrences, when the initial excitation starts at the central node.…
We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…
We present a generalized definition of discrete-time quantum walks convenient for capturing a rather broad spectrum of walker's behavior on arbitrary graphs. It includes and covers both: the geometry of possible walker's positions with…
We address decoherence and classicalization of continuous-time quantum walks (CTQWs) on graphs. In particular, we investigate three different models of decoherence, and employ the quantum-classical (QC) dynamical distance as a figure of…
We consider a network model, embedded on the Manhattan lattice, of a quantum localisation problem belonging to symmetry class C. This arises in the context of quasiparticle dynamics in disordered spin-singlet superconductors which are…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
A study of persistence dynamics is made for the first time in a quantum system by considering the dynamics of a quantum random walk. For a discrete walk on a line starting at $x=0$ at time $t=0$, the persistence probability $P(x,t)$ that a…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
We derive an expression for the mean square displacement of a particle whose motion is governed by a uniform, periodic, quantum multi-baker map. The expression is a function of both time, $t$, and Planck's constant, $\hbar$, and allows a…
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…