Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity
AbstractWe 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 directed and undirected graphs. We also consider the use of alternative Hamiltonians as well as the possibility of integrating additional node-level topological information into the proposed framework. We set up a graph classification task and we provide empirical evidence that: (1) our similarity measure can effectively incorporate the edge directionality information, leading to a significant improvement in classification accuracy; (2) the choice of the quantum walk Hamiltonian does not have a significant effect on the classification accuracy; (3) the addition of node-level topological information improves the classification accuracy in some but not all cases. We also theoretically prove that under certain constraints, the proposed similarity measure is positive definite and thus a valid kernel measure. Finally, we describe a fully quantum procedure to compute the kernel. View Full-Text
Share & Cite This Article
Minello, G.; Rossi, L.; Torsello, A. Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity. Entropy 2019, 21, 328.
Minello G, Rossi L, Torsello A. Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity. Entropy. 2019; 21(3):328.Chicago/Turabian Style
Minello, Giorgia; Rossi, Luca; Torsello, Andrea. 2019. "Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity." Entropy 21, no. 3: 328.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.