相关论文: Quantum Walk Search on Johnson Graphs

Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…

We introduce a minimal set of physically motivated postulates that the Hamiltonian H of a continuous-time quantum walk should satisfy in order to properly represent the quantum counterpart of the classical random walk on a given graph. We…

A graph $G$ is said to be {\em hom-idempotent} if there is a homomorphism from $G^2$ to $G$, and {\em weakly hom-idempotent} if for some $n \geq 1$ there is a homomorphism from $G^{n+1}$ to $G^n$. Larose et al. [{\em Eur. J. Comb.…

For integers $n\geq k\geq 1$, the Kneser graph $K(n,k)$ is the graph with vertex set $V=[n]^{(k)}$ and edge set $E=\{\{x,y\} \in V^{(2)}: x\cap y=\emptyset\}$. Chen proved that for $n\geq 3k$, Kneser graphs are Hamiltonian and later…

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…

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for $N$-fold star power graph, which are invariant under the quantum…

We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of $S^+(U^3)$, a matrix based on the amplitudes of walks in the quantum walk,…

We introduce a two-parameter framework that refines several classical graph invariants by imposing higher-order constraints along bounded-length geodesics. For integers $k,d\ge1$, a vertex set is called $k,d$-independent if every shortest…

A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…

The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular…

We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…

When searching for a marked vertex in a graph, Szegedy's usual search operator is defined by using the transition probability matrix of the random walk with absorbing barriers at the marked vertices. Instead of using this operator, we…

A temporal graph is a graph for which the edge set can change from one time step to the next. This paper considers undirected temporal graphs defined over L time steps and connected at each time step. We study the Shortest Temporal…

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…

The continuous-time quantum walk on the underlying graphs of association schemes have been studied, via the algebraic combinatorics structures of association schemes, namely semi-simple modules of their Bose-Mesner and (reference state…

We address the properties of continuous-time quantum walks with Hamiltonians of the form $\mathcal{H}= L + \lambda L^2$, being $L$ the Laplacian matrix of the underlying graph and being the perturbation $\lambda L^2$ motivated by its…

We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point…

In recent years, new neural network architectures designed to operate on graph-structured data have pushed the state-of-the-art in the field. A large set of these architectures utilize a form of classical random walks to diffuse…

We explore the possibility of using quantum walks on graphs to find structural anomalies, such as extra edges or loops, on a graph. We focus our attention on star graphs, whose edges are like spokes coming out of a central hub. If there are…