In this paper, we consider how discrete-time quantum walks can be applied to graph-
matching problems. The matching problem is abstracted using an auxiliary graph that …

We consider how continuous-time quantum walks can be used for graph matching. We focus
in detail on both exact and inexact graph matching, and consider in depth the problem of …

In this paper, we propose a new edge-based matching kernel for graphs by using discrete-
time quantum walks. To this end, we commence by transforming a graph into a directed line …

Studies on graph isomorphism play an important role in graph research, and graph
isomorphism algorithms have a wide range of applications in image matching, pattern …

In this paper we consider the problem of distinguishing graphs that are cospectral with
respect to the standard adjacency and Laplacian matrix representations. Borrowing ideas …

We develop a novel method for measuring the similarity between complete weighted
graphs, which are probed by means of the discrete-time quantum walks. Directly probing …

Graph comparison is an established NP-hard problem. In this paper, we present an
efficiently scaling quantum algorithm which finds the size of the maximum common edge …

One of the most fundamental problem that we face in the graph domain is that of
establishing the similarity, or alternatively the distance, between graphs. In this paper, we …

In this paper we propose a quantum algorithm to measure the similarity between a pair of
unattributed graphs. We design an experiment where the two graphs are merged by …

We consider the problem of measuring the similarity between two graphs using continuous-
time quantum walks and comparing their time-evolution by means of the quantum Jensen …