Related papers: Quantum centipedes with strong global constraint
Surpassing the standard quantum limit and even reaching the Heisenberg limit using quantum entanglement, represents the Holy Grail of quantum metrology. However, quantum entanglement is a valuable resource that does not come without a…
A system of N particles eN=(x1,v1,...,xN,vN) interacting self-consistently with M waves Zn=An*exp(iTn) is considered. Hamiltonian dynamics transports initial data (eN(0),Zn(0)) to (eN(t),Zn(t)). In the limit of an infinite number of…
A quantum central limit theorem for a continuous-time quantum walk on a homogeneous tree is derived from quantum probability theory. As a consequence, a new type of limit theorems for another continuous-time walk introduced by the walk is…
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…
We consider asymptotic behaviour of a Hadamard walk on a cycle. For a walk which starts with a state in which all the probability is concentrated on one node, we find the explicit formula for the limiting distribution and discuss its…
We investigate quantum dynamics of a quantum walker on a finite bipartite non-Hermitian lattice, in which the particle can leak out with certain rate whenever it visits one of the two sublattices. Quantum walker initially located on one of…
We study the quantum mechanical motion of massive particles in a system of two coupled waveguide potentials, where the population transfer between the waveguides effectively acts as a clock and allows particle velocities to be determined.…
We present a closed-form expression for the survival probability of a biased random walker to first reach a target site on a 1D lattice. The expression holds for any step number $N$ and is computationally faster than non-closed-form results…
The behaviors of one-dimensional quantum random walks are strikingly different from those of classical ones. However, when decoherence is involved, the limiting distributions take on many classical features over time. In this paper, we…
Discoveries of fundamental limits for the rates of physical processes, from the speed of light to the Lieb-Robinson bound for information propagation, often lead to breakthroughs in the our understanding of the underlying physics. Here we…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
The first detection of a quantum particle on a graph has been shown to depend sensitively on the sampling time {\tau} . Here we use the recently introduced quantum renewal equation to investigate the statistics of first detection on an…
We discuss quantum speed limits (QSLs) for finite-dimensional quantum systems undergoing general physical processes. These QSLs were obtained using Schatten $\alpha$-norms, firstly exploiting geometric features of the quantum state space,…
We study the motion of random walkers with residence time bias between first and subsequent visits to a site, as a model for synthetic molecular walkers composed of coupled DNAzyme legs known as molecular spiders. The mechanism of the…
We consider the dynamical properties of Quantum Walks defined on the d-dimensional cubic lattice, or the homogeneous tree of coordination number 2d, with site dependent random phases, further characterised by transition probabilities…
I obtain the dynamics of the continuous time quantum walk on a $d$-dimensional lattice, with periodic boundary conditions, as an appropriate limit of the dynamics of the discrete time quantum walk on the same lattice. This extends the main…
The "quantum walk" has emerged recently as a paradigmatic process for the dynamic simulation of complex quantum systems, entanglement production and quantum computation. Hitherto, photonic implementations of quantum walks have mainly been…
We consider a random walk among i.i.d. obstacles on the one dimensional integer lattice under the condition that the walk starts from the origin and reaches a remote location y. The obstacles are represented by a killing potential, which…
We construct novel examples of finitely generated groups that exhibit seemingly-contradicting probabilistic behaviors with respect to Burnside laws. We construct a finitely generated group that satisfies a Burnside law, namely a law of the…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…