Related papers: Dirac quantum walks on triangular and honeycomb la…
In this paper, we propose a circuit design for implementing quantum walks on complex networks. Quantum walks are powerful tools for various graph-based applications such as spatial search, community detection, and node classification.…
This note describes recent results on the localization properties of Random Quantum Walks on the d-dimensional lattice in a regime analogous to the large disorder regime by means of the Fractional Moments Method adapted to the unitary…
The discrete-time quantum walk (QW) is determined by a unitary matrix whose component is complex number. Konno (2015) extended the QW to a walk whose component is quaternion.We call this model quaternionic quantum walk (QQW). The…
For a discrete two-state quantum walk (QW) on the half-line with a general condition at the boundary, we formulate and prove a weak limit theorem describing the terminal behavior of its transition probabilities. In this context,…
A two-dimensional discrete-time quantum walk (DTQW) can be realized by alternating a two-state DTQW in one spatial dimension followed by an evolution in the other dimension. This was shown to reproduce a probability distribution for a…
We study numerically the nature of the diffusion process on a honeycomb and a quasi-lattice, where a point particle, moving along the bonds of the lattice, scatters from randomly placed scatterers on the lattice sites according to strictly…
The discrete-time quantum walk (QW) is a quantum version of the random walk (RW) and has been widely investigated for the last two decades. Some remarkable properties of QW are well known. For example, QW has a ballistic spreading, i.e., QW…
Restart is a common strategy observed in nature that accelerates first-passage processes and has been extensively studied using classical random walks. In the quantum regime, restart in continuous-time quantum walks (CTQWs) has been shown…
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…
The problem of simulating through quantum walks Dirac fermions in arbitrary curved space-times and coordinates is revisited, taking (1 + 1)D space-times as an example. A new shift or translation operator on the grid is introduced, to take…
We introduce a fidelity-based measure $\text{D}_{\text{CQ}}(t)$ to quantify the differences between the dynamics of classical (CW) and quantum (QW) walks over a graph. We provide universal, graph-independent, analytic expressions of this…
We show that a large class of 2-adic Schr\"odinger equations is the scaling limit of certain continuous-time quantum Markov chains (CTQMCs). Practically, a discretization of such an equation gives a CTQMC. As a practical result, we…
We analytically investigate the recently proposed and implemented discrete-time quantum walk based on kicked ultra-cold atoms. We show how the internal level structure of the kicked atoms leads to the emergence of a relative light-shift…
Topological phases, edge states, and flat bands in synthetic quantum systems are a key resource for topological quantum computing and noise-resilient information processing. We introduce a scheme based on step-dependent quantum walks on…
The probability distributions of discrete-time quantum walks have been often investigated, and many interesting properties of them have been discovered. The probability that the walker can be find at a position is defined by diagonal…
Discrete time quantum walks are unitary maps defined on the Hilbert space of coupled two-level systems. We study the dynamics of excitations in a nonlinear discrete time quantum walk, whose fine-tuned linear counterpart has a flat band…
In this paper, we claim that a common underlying structure--a skeleton structure--is present behind discrete-time quantum walks (QWs) on a one-dimensional lattice with a homogeneous coin matrix. This skeleton structure is independent of the…
We investigate the irreconcilability issue that raises in translating the search algorithm from the Continuous-Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along…
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior…
Continuous-time quantum walks (CTQW) have shown the capability to perform efficiently the spatial search of a marked site on many kinds of graphs. However, most of such graphs are hard to realize in an experimental setting. Here we study…