Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk

David Emms, Edwin R. Hancock, Richard C. Wilson

Published Aug 19, 2007• 6 citations
Publisher
DOI
10.1007/978-3-540-72903-7_8

Related papers

Graph matching using the interference of discrete-time quantum walks

David Emms, Richard C. Wilson, Edwin R. Hancock

Image and Vision Computing•Nov 9, 2008•24 citations

Linear extrapolation for the graph of function of single variable based on walks

Norio Konno, Shohei Koyama

The quantum walk was introduced as a quantum counterpart of the random walk and has been intensively studied since around 2000. Its applications include topological insulators, radioactive waste reduction, and quantum search. The first author in 2019 defined a time-series model based on the measure of the ``discrete-time" and ``discrete-space" quantum walk in one dimension. Inspired by his model, this paper proposes a new model for the graph of a function of a single variable determined by the measure which comes from the weak limit measure of a ``continuous-time or discrete-time" and ``discrete-space" walk. The measure corresponds to a ``continuous-time" and ``continuous-space" walk in one dimension. Moreover, we also presents a method of a linear extrapolation for the graph by our model.

arXiv:2501.13386•Jan 23, 2025•0 citations

Linear extrapolation for the graph of function of single variable based on walks

Norio Konno, Koyama Shohei

The quantum walk was introduced as a quantum counterpart of the random walk and has been intensively studied since around 2000. Its applications include topological insulators, radioactive waste reduction, and quantum search. The first author in 2019 defined a time-series model based on the measure of the “discrete-time” and “discrete-space” quantum walk in one dimension. Inspired by his model, this paper proposes a new model for the graph of a function of a single variable determined by the measure which comes from the weak limit measure of a “continuous-time or discrete-time” and “discrete-space” walk. The measure corresponds to a “continuous-time” and “continuous-space” walk in one dimension. Moreover, we also presents a method of a linear extrapolation for the graph by our model.

•Jan 1, 2022•0 citations

Quantum search of matching on signed graphs

Etsuo Segawa, Yusuke Yoshie

arXiv:2007.07223•Quantum Information Processing•May 1, 2021•5 citations

Graph matching using the interference of continuous-time quantum walks

David Emms, Richard C. Wilson, Edwin R. Hancock

Pattern Recognition•Sep 18, 2008•50 citations

A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs

Lu Bai, Luca Rossi, Lixin Cui +2 more

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 complete graphs using discrete-time quantum walks is intractable due to the cost of simulating the quantum walk. We overcome this problem by extracting a commute time minimum spanning tree from the complete weighted graph. The spanning tree is probed by a discrete-time quantum walk which is initialized using a weighted version of the Perron-Frobenius operator. This naturally encapsulates the edge weight information for the spanning tree extracted from the original graph. For each pair of complete weighted graphs to be compared, we simulate a discrete-time quantum walk on each of the corresponding commute time minimum spanning trees and, then, compute the associated density matrices for the quantum walks. The probability of the walk visiting each edge of the spanning tree is given by the diagonal elements of the density matrices. The similarity between each pair of graphs is then computed using either: 1) the inner product or 2) the negative exponential of the Jensen-Shannon divergence between the probability distributions. We show that in both cases the resulting similarity measure is positive definite and, therefore, corresponds to a kernel on the graphs. We perform a series of experiments on publicly available graph datasets from a variety of different domains, together with time-varying financial networks extracted from data for the New York Stock Exchange. Our experiments demonstrate the effectiveness of the proposed similarity measures.

IEEE Transactions on Cybernetics•Jul 11, 2019•29 citations
The quantum walk was introduced as a quantum counterpart of the random walk and has been intensively studied since around 2000. Its applications include topological insulators, radioactive waste reduction, and quantum search. The first author in 2019 defined a time-series model based on the measure of the ``discrete-time" and ``discrete-space" quantum walk in one dimension. Inspired by his model, this paper proposes a new model for the graph of a function of a single variable determined by the measure which comes from the weak limit measure of a ``continuous-time or discrete-time" and ``discrete-space" walk. The measure corresponds to a ``continuous-time" and ``continuous-space" walk in one dimension. Moreover, we also presents a method of a linear extrapolation for the graph by our model.
The quantum walk was introduced as a quantum counterpart of the random walk and has been intensively studied since around 2000. Its applications include topological insulators, radioactive waste reduction, and quantum search. The first author in 2019 defined a time-series model based on the measure of the “discrete-time” and “discrete-space” quantum walk in one dimension. Inspired by his model, this paper proposes a new model for the graph of a function of a single variable determined by the measure which comes from the weak limit measure of a “continuous-time or discrete-time” and “discrete-space” walk. The measure corresponds to a “continuous-time” and “continuous-space” walk in one dimension. Moreover, we also presents a method of a linear extrapolation for the graph by our model.
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 complete graphs using discrete-time quantum walks is intractable due to the cost of simulating the quantum walk. We overcome this problem by extracting a commute time minimum spanning tree from the complete weighted graph. The spanning tree is probed by a discrete-time quantum walk which is initialized using a weighted version of the Perron-Frobenius operator. This naturally encapsulates the edge weight information for the spanning tree extracted from the original graph. For each pair of complete weighted graphs to be compared, we simulate a discrete-time quantum walk on each of the corresponding commute time minimum spanning trees and, then, compute the associated density matrices for the quantum walks. The probability of the walk visiting each edge of the spanning tree is given by the diagonal elements of the density matrices. The similarity between each pair of graphs is then computed using either: 1) the inner product or 2) the negative exponential of the Jensen-Shannon divergence between the probability distributions. We show that in both cases the resulting similarity measure is positive definite and, therefore, corresponds to a kernel on the graphs. We perform a series of experiments on publicly available graph datasets from a variety of different domains, together with time-varying financial networks extracted from data for the New York Stock Exchange. Our experiments demonstrate the effectiveness of the proposed similarity measures.