Related papers: Quantum Walks on Generalized Quadrangles
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…
Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…
In this paper we study a class of discrete quantum walks, known as bipartite walks. These include the well-known Grover's walks. Any discrete quantum walk is given by the powers of a unitary matrix $U$ indexed by arcs or edges of the…
We clarify that coined quantum walk is determined by only the choice of local quantum coins. To do so, we characterize coined quantum walks on graph by disjoint Euler circles with respect to symmetric arcs. In this paper, we introduce a new…
We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy's quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of…
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…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
We analyze continuous-time quantum and classical random walk on spidernet lattices. In the framework of Stieltjes transform, we obtain density of states, which is an efficiency measure for the performance of classical and quantum mechanical…
In this paper, we determine periodicity of quantum walks defined by mixed paths and mixed cycles. By the spectral mapping theorem of quantum walks, consideration of periodicity is reduced to eigenvalue analysis of $\eta$-Hermitian adjacency…
Topological data analysis is a rapidly developing area of data science where one tries to discover topological patterns in data sets to generate insight and knowledge discovery. In this project we use quantum walk algorithms to discover…
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…
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,…
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic…
Quantum walks with long-range steps $R^{-\gamma}$ ($R$ being the distance between sites) on a discrete line behave in similar ways for all $\gamma\geq2$. This is in contrast to classical random walks, which for $\gamma >3$ belong to a…
We suggest a theoretical scheme for the simulation of quantum random walks on a line using beam splitters, phase shifters and photodetectors. Our model enables us to simulate a quantum random walk with use of the wave nature of classical…
We investigate the graph isomorphism (GI) in some cospectral networks. Two graph are isomorphic when they are related to each other by a relabeling of the graph vertices. We want to investigate the GI in two scalable (n + 2)-regular graphs…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. They can be constructed as coset graphs of the duals of…