Related papers: Exploring scalar quantum walks on Cayley graphs
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…
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,…
The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems,…
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
The development of quantum walks in the context of quantum computation, as generalisations of random walk techniques, led rapidly to several new quantum algorithms. These all follow unitary quantum evolution, apart from the final…
In this article we present an effective Hamiltonian approach for Discrete Time Quantum Random Walk. A form of the Hamiltonian for one dimensional quantum walk has been prescribed, utilizing the fact that Hamiltonians are the generators of…
I introduce a new type of continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First I analyze the quantum snake walk on the line, and I…
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…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
This manuscript gathers and subsumes a long series of works on using QW to simulate transport phenomena. Quantum Walks (QWs) consist of single and isolated quantum systems, evolving in discrete or continuous time steps according to a…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
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 address continuous-time quantum walks on graphs, and discuss whether and how quantum-limited measurements on the walker may extract information on the tunnelling amplitude between the nodes of the graphs. For a few remarkable families of…
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…
Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation.…
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…
Currently there are three major paradigms of quantum computation, the gate model, annealing, and walks on graphs. The gate model and quantum walks on graphs are universal computation models, while annealing plays within a specific subset of…
Let $X$ be a graph with adjacency matrix $A$. The \textsl{continuous quantum walk} on $X$ is determined by the unitary matrices $U(t)=\exp(itA)$. If $X$ is the complete graph $K_n$ and $a\in V(X)$, then \[1-|U(t)_{a,a}|\le2/n. \] In a…
Quantum walks have frequently envisioned the behavior of a quantum state traversing a classically defined, generally finite, graph structure. While this approach has already generated significant results, it imposes a strong assumption: all…
We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…