Related papers: Localization in Quantum Walks on a Honeycomb Netwo…
Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks…
Continuous-time quantum walks (CTQWs) exhibit localization phenomena that differ fundamentally from their classical counterparts, yet the precise relationship between network structure, spectral degeneracy, and confined dynamics remains…
We demonstrate the onset of strong on-site localization in a one-dimensional many-particle system. The localization is obtained by constructing, in an explicit form, a bounded sequence of on-site energies that eliminates resonant hopping…
We propose an implementation of a quantum walk on a circle on an optomechanical system by encoding the walker on the phase space of a radiation field and the coin on a two-level state of a mechanical resonator. The dynamics of the system is…
Multilayer network is a potent platform which paves a way to study the interactions among entities in various networks with multiple types of relationships. In this study, the dynamics of discrete-time quantum walk on a multilayer network…
The coined quantum walk is a discretization of the Dirac equation of relativistic quantum mechanics, and it is the basis of many quantum algorithms. We investigate how it searches the complete bipartite graph of $N$ vertices for one of $k$…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks are characterized by the fact that the one-step transition probabilities are functions of the…
We construct a new type of quantum walks on simplicial complexes as a natural extension of the well-known Szegedy walk on graphs. One can numerically observe that our proposing quantum walks possess linear spreading and localization as in…
A powerful strategy to accelerate quantum-walk-based search algorithms leverages on resetting protocols, where a detector monitors a target site and the evolution of the walker is restarted if no detection occurs within a fixed time…
Entanglement is a key resource in many quantum information applications and achieving high values independently of the initial conditions is an important task. Here we address the problem of generating highly entangled states in a discrete…
A spidernet is a graph obtained by adding large cycles to an almost regular tree and considered as an example having intermediate properties of lattices and trees in the study of discrete-time quantum walks on graphs. We introduce the…
We present a theoretical and numerical study of the competition between two opposite interference effects, namely interference-induced ballistic transport on one hand, and strong (Anderson) localization on the other. While the former effect…
We study the effects of interparticle interactions and power-law tunneling couplings on quantum walks executed by both a single one and a pair of hard-core bosons moving in clean and disordered one-dimensional lattices. For this purpose, we…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
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…
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…
Quantum random walks use interference to obtain faster state space exploration, which can be used for algorithmic purposes. Photonic technologies provide a natural platform for many recent experimental demonstrations. Here we analyze…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
Rules for quantizing the walker+coin parts of a classical random walk are provided by treating them as interacting quantum systems. A quantum optical random walk (QORW), is introduced by means of a new rule that treats quantum or classical…
Place an obstacle with probability $1-p$ independently at each vertex of $\mathbb Z^d$, and run a simple random walk until hitting one of the obstacles. For $d\geq 2$ and $p$ strictly above the critical threshold for site percolation, we…