Related papers: Two-walker discrete-time quantum walks on the line…
We show that quantum walks interpolate between a coherent `wave walk' and a random walk depending on how strongly the walker's coin state is measured; i.e., the quantum walk exhibits the quintessentially quantum property of complementarity,…
We study a model of interacting run-and-tumble random walkers operating under mutual hardcore exclusion on a one-dimensional lattice with periodic boundary conditions. We incorporate a finite, Poisson-distributed, tumble duration so that a…
We explore static noise in a discrete quantum random walk over a homogeneous cyclic graph, focusing on spectral and dynamical properties. Using a three-parameter unitary coin, we control the spectral structure of the noiseless step operator…
Quantum walks are considered in a one-dimensional random medium characterized by static or dynamic disorder. Quantum interference for static disorder can lead to Anderson localization which completely hinders the quantum walk and it is…
Parrondo's paradox, a counterintuitive phenomenon where two losing strategies combine to produce a winning outcome, has been a subject of interest across various scientific fields, including quantum mechanics. In this study, we investigate…
For more than a century lattice random walks have been employed ubiquitously, both as a theoretical laboratory to develop intuition about more complex stochastic processes and as a tool to interpret a vast array of empirical observations.…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We employ Quantum Fisher Information, as a figure of merit, to quantify extractable information about an unknown parameter…
We study a generalized Hadamard walk in one dimension with three inner states. The particle governed by the three-state quantum walk moves, in superposition, both to the left and to the right according to the inner state. In addition to…
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…
We extend the idea of a discrete-time quantum walk on a graph by placing a qubit on each vertex, and allowing the walker to interact with the qubit at its current position. We show that allowing for a controlled-Z interaction at each time…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…
We study a 2-D disordered time-discrete quantum walk based on 1-D `generalized elephant quantum walk' where an entangling coin operator is assumed and which paves the way to a new set of properties. We show that considering a given disorder…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
By pursuing the deep relation between the one-dimensional Dirac equation and quantum walks, the physical role of quantum interference in the latter is explained. It is shown that the time evolution of the probability density of a quantum…
We study a particle system with hopping (random walk) dynamics on the integer lattice $\mathbb Z^d$. The particles can exist in two states, active or inactive (sleeping); only the former can hop. The dynamics conserves the number of…
We present numerical study of a model of quantum walk in periodic potential on the line. We take the simple view that different potentials affect differently the way the coin state of the walker is changed. For simplicity and definiteness,…
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…
Quantum walks (QWs) represent pillars of quantum dynamics and information processing. They provide a powerful framework for simulating quantum transport, designing search algorithms, and enabling universal quantum computation. Several…
We show that a quantum state transfer, previously studied as a continuous time process in networks of interacting spins, can be achieved within the model of discrete time quantum walks with position dependent coin. We argue that due to…