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 Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum Walk

Lu Bai, Edwin R. Hancock, Andrea Torsello A, Luca Rossi

Published Jan 1, 2013• 18 citations
Publisher
DOI
10.1007/978-3-642-38221-5_13

Related papers

A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks

Lu Bai, Luca Rossi, Peng Ren +2 more

Lecture notes in computer science•Jan 1, 2015•7 citations

A quantum Jensen–Shannon graph kernel for unattributed graphs

Lu Bai, Luca Rossi, Andrea Torsello A +1 more

Pattern Recognition•Apr 4, 2014•112 citations

A Continuous-Time Quantum Walk Kernel for Unattributed Graphs

Luca Rossi, Andrea Torsello A, Edwin R. Hancock

Lecture notes in computer science•Jan 1, 2013•19 citations

Jensen-Shannon Divergence of Quantum Hashing Algorithms Based on Quantum Walk

Arav Cabral

Springer eBooks•Jan 1, 2023•0 citations

Factoring discrete-time quantum walks on distance regular graphs into continuous-time quantum walks

Hanmeng Zhan

arXiv:2008.01224•Linear Algebra and its Applications•Apr 28, 2022•1 citation

Measuring graph similarity through continuous-time quantum walks and the quantum Jensen-Shannon divergence

Luca Rossi, Andrea Torsello A, Edwin R. Hancock

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 establishing a complete set of connections between their nodes and the resulting structure is probed through the evolution of continuous-time quantum walks. In order to analyze the behavior of the walks without causing wave function collapse, we base our analysis on the recently introduced quantum Jensen-Shannon divergence. In particular, we show that the divergence between the evolution of two suitably initialized quantum walks over this structure is maximum when the original pair of graphs is isomorphic. We also prove that under special conditions the divergence is minimum when the sets of eigenvalues of the Hamiltonians associated with the two original graphs have an empty intersection.

Physical Review E•Feb 23, 2015•48 citations
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 establishing a complete set of connections between their nodes and the resulting structure is probed through the evolution of continuous-time quantum walks. In order to analyze the behavior of the walks without causing wave function collapse, we base our analysis on the recently introduced quantum Jensen-Shannon divergence. In particular, we show that the divergence between the evolution of two suitably initialized quantum walks over this structure is maximum when the original pair of graphs is isomorphic. We also prove that under special conditions the divergence is minimum when the sets of eigenvalues of the Hamiltonians associated with the two original graphs have an empty intersection.