Related papers: Universality of the fully connected vertex in Lapl…
In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated to their adjacency matrix. Here in…
This paper investigates continuous-time quantum walks on directed bipartite graphs based on a graph's adjacency matrix. We prove that on bipartite graphs, probability transport between the two node partitions can be completely suppressed by…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
One of the most important algorithmic applications of quantum walks is to solve spatial search problems. A widely used quantum algorithm for this problem, introduced by Childs and Goldstone [Phys. Rev. A 70, 022314 (2004)], finds a marked…
Continuous-time quantum walks (CTQWs) provide a versatile framework for exploring quantum transport on graphs. In this work, we investigate how the introduction of edge-weight modulation at a single vertex can suppress its occupation…
Spatial search is an important problem in quantum computation, which aims to find a marked vertex on a graph. We propose a novel approach for designing deterministic quantum search algorithms on a variety of graphs via alternating quantum…
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we…
A continuous-time quantum walk on a graph is a matrix-valued function $\exp(-\mathtt{i} At)$ over the reals, where $A$ is the adjacency matrix of the graph. Such a quantum walk has universal perfect state transfer if for all vertices $u,v$,…
It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of quantum gates. This result treated all isolated vertices as…
We examine the time dependent amplitude $ \phi_{j}\left( t\right)$ at each vertex $j$ of a continuous-time quantum walk on the cycle $C_{n}$. In many cases the Lissajous curve of the real vs. imaginary parts of each $ \phi_{j}\left(…
Kronecker graphs, obtained by repeatedly performing the Kronecker product of the adjacency matrix of an "initiator" graph with itself, have risen in popularity in network science due to their ability to generate complex networks with…
In this work, we consider the spatial search for a general marked state on graphs by continuous time quantum walks. As a simplest case, we compute the amplitude expression of the search for the multi-vertex uniform superposition state on…
In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we consider search when this is no longer true. In particular, we…
We present a detailed analysis of continuous time quantum walks (CTQW) with both position and transition defects defined at a single point in the line. Analytical solutions of both traveling waves or bound states are obtained, which provide…
Continuous-time quantum walks provide a natural framework to tackle the fundamental problem of finding a node among a set of marked nodes in a graph, known as spatial search. Whether spatial search by continuous-time quantum walk provides a…
Lackadaisical quantum walk (LQW) is a quantum analog of a classical lazy walk, where each vertex has a self-loop of weight $l$. For a regular $\sqrt{N}\times\sqrt{N}$ 2D grid LQW can find a single marked vertex with $O(1)$ probability in…
Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes, the structure of the graph causes the walker to get trapped, such that the probability of finding the marked…
The lackadaisical quantum walk is a lazy version of a discrete-time, coined quantum walk, where each vertex has a weighted self-loop that permits the walker to stay put. They have been used to speed up spatial search on a variety of graphs,…
The lackadaisical quantum walk, which is a quantum walk with a weighted self-loop at each vertex, has been shown to speed up dispersion on the line and improve spatial search on the complete graph and periodic square lattice. In these…
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…