Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity
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-Shannon divergence. Contrary to previous works that focused solely on undirected graphs, here we consider the case of both dire...
Main Authors: | Giorgia Minello, Luca Rossi, Andrea Torsello |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2019-03-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/21/3/328 |
Similar Items
-
Controlled transport in chiral quantum walks on graphs
by: Yi-Cong Yu, et al.
Published: (2023-01-01) -
Transport Efficiency of Continuous-Time Quantum Walks on Graphs
by: Luca Razzoli, et al.
Published: (2021-01-01) -
Quantum walk neural networks with feature dependent coins
by: Stefan Dernbach, et al.
Published: (2019-09-01) -
Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk
by: Xin Wang, et al.
Published: (2018-08-01) -
MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk
by: Kai Liu, et al.
Published: (2019-06-01)