Related papers: Quantum walks with memory - goldfish, elephants an…
In this article we investigate the effects of shifting position decoherence, arisen from the tunneling effect in the experimental realization of the quantum walk, on the one-dimensional discreet time quantum walk. We show that in the regime…
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 investigate the evolution of a discrete-time one-dimensional quantum walk driven by a position-dependent coin. The rotation angle which depends upon the position of a quantum particle parameterizes the coin operator. For different values…
The quantum walk is a quantum counterpart of the classical random walk that exhibits nonclassical behaviors and outperforms the classical random walk in various aspects. It has been known that a single particle can be propagated by a…
A discrete time quantum walker is considered in one dimension, where at each step, the translation can be more than one unit length chosen randomly. In the simplest case, the probability that the distance travelled is $\ell$ is taken as…
We propose a new hash function QHFM based on controlled alternate quantum walks with memory on cycles, where the jth message bit decides whether to run quantum walk with one-step memory or to run quantum walk with two-step memory at the jth…
We investigate the role of a time and spin-dependent phase shift on the evolution of one-dimensional discrete-time quantum walks. By employing Floquet engineering, a time and spin-dependent phase shift ($\phi$) is imprinted onto the…
In this paper we extend the concept of persistence, well defined for classical stochastic dynamics, to the context of quantum dynamics. We demonstrate the idea via quantum random walk and a successive measurement scheme, where persistence…
Random walks are a fundamental primitive used in many machine learning algorithms with several applications in clustering and semi-supervised learning. Despite their relevance, the first efficient parallel algorithm to compute random walks…
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it…
Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like superposition, entanglement, and tunneling. Quantum walks (QWs)…
Stochastic processes underlie a vast range of natural and social phenomena. Some processes such as atomic decay feature intrinsic randomness, whereas other complex processes, e.g. traffic congestion, are effectively probabilistic because we…
Quantum walks are referred to as quantum analogs to random walks in mathematics. They have been studied as quantum algorithms in quantum information for quantum computers. There are two types of quantum walks. One is the discrete-time…
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…
The classicalization of a decoherent discrete-time quantum walk on a line or an n-cycle can be demonstrated in various ways that do not necessarily provide a geometry-independent description. For example, the position probability…
Full state revivals in a quantum walk can be viewed as returning of the walker to the initial quantum state in a periodic fashion during the propagation of the walk. In this paper we show that for any given number of spatial dimensions, a…
We consider the 2D alternate quantum walk on a cylinder. We concentrate on the study of the motion along the open dimension, in the spirit of looking at the closed coordinate as a small or "hidden" extra dimension. If one starts from…
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…
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…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…