Quantum walk inspired algorithm for graph similarity and isomorphism

Callum Schofield, Jingbo B. Wang, Yuying Li

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Large-scale complex systems, such as social networks, electrical power grid, database structure, consumption pattern or brain connectivity, are often modelled using network graphs. Valuable insight can be gained by measuring similarity between network graphs in order to make quantitative comparisons. Since these networks can be very large, scalability and efficiency of the algorithm are key concerns. More importantly, for graphs with unknown labelling, this graph similarity problem requires exponential time to solve using existing algorithms. In this paper, we propose a quantum walk inspired algorithm, which provides a solution to the graph similarity problem without prior knowledge on graph labelling. This algorithm is capable of distinguishing between minor structural differences, such as between strongly regular graphs with the same parameters. The algorithm has a polynomial complexity, scaling with O(n9).

Original languageEnglish
Article number281
JournalQuantum Information Processing
Issue number9
Publication statusPublished - 1 Aug 2020


Dive into the research topics of 'Quantum walk inspired algorithm for graph similarity and isomorphism'. Together they form a unique fingerprint.

Cite this