Related papers: The Staggered Quantum Walk Model

We consider a position-dependent quantum walk on ${\bf Z}$. In particular, we derive a detection method for edge defects by embedded eigenvalues of its time evolution operator. In the present paper, the set of edge defects is that of points…

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)…

The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…

This study is motivated by the previous work [14]. We treat 3 types of the one-dimensional quantum walks (QWs), whose time evolutions are described by diagonal unitary matrix, and diagonal unitary matrices with one defect. In this paper, we…

We consider discrete-time evolution equations in which the stochastic operator of a classical random walk is replaced by a unitary operator. Such a problem has gained much attention as a framework for coined quantum walks that are essential…

There exist two types of configurations of marked vertices on a two-dimensional grid, known as the {\it exceptional configurations}, which are hard to find by the discrete-time quantum walk algorithms. In this article, we provide a…

In a seminal paper, Szegedy showed how to construct a quantum walk $W(P)$ for any reversible Markov chain $P$ such that its eigenvector with eigenphase $0$ is a quantum sample of the limiting distribution of the random walk and its…

Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such…

For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus,…

Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…

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…

Spatial search by discrete-time quantum walk can find a marked node on any ergodic, reversible Markov chain $P$ quadratically faster than its classical counterpart, i.e.\ in a time that is in the square root of the hitting time of $P$.…

We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…

A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…

We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues…

Suppose we have k matrices of size n by n. We are given an oracle that knows all the entries of k matrices, that is, we can query the oracle an (i,j) entry of the l-th matrix. The goal is to test if each pair of k matrices commute with each…

There is a property called localization, which is essential for applications of quantum walks. From a mathematical point of view, the occurrence of localization is known to be equivalent to the existence of eigenvalues of the time evolution…

Lackadaisical quantum walk(LQW) has been an efficient technique in searching a target state from a database which is distributed on a two-dimensional lattice. We numerically study the quantum search algorithm based on the lackadaisical…

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…

We propose a class of continuous-time quantum walk models on graphs induced by a certain class of discrete-time quantum walk models with the parameter $\epsilon\in [0,1]$. Here the graph treated in this paper can be applied both finite and…