Graph Edit Distance without Correspondence from Continuous-Time Quantum Walks

We consider how continuous-time quantum walks can be used for graph matching. We focus in detail on both exact and inexact graph matching, and consider in depth the problem of measuring graph similarity. We commence by constructing an auxiliary graph, in which the two graph to be matched are co-joined by a layer of indicator nodes (one for each potential correspondence between a pair of nodes). We simulate a continuous time quantum walk in parallel on the two graphs. The layer of connecting indicator nodes in the auxiliary graph allow quantum interference to take place between the two walks. The interference amplitudes on the indicator nodes are determined by differences in the two walks. We show how these interference amplitudes can be used to compute graph edit distances without explicitly determining node correspondences.

[1]  Harry G. Barrow,et al.  Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques , 1976, Inf. Process. Lett..

[2]  Johannes Köbler,et al.  On Graph Isomorphism for Restricted Graph Classes , 2006, CiE.

[3]  Richard Jozsa,et al.  Quantum factoring, discrete logarithms, and the hidden subgroup problem , 1996, Comput. Sci. Eng..

[4]  David M. Mount,et al.  Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.

[5]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[6]  Robert Beals,et al.  Quantum computation of Fourier transforms over symmetric groups , 1997, STOC '97.

[7]  Julian R. Ullmann,et al.  An Algorithm for Subgraph Isomorphism , 1976, J. ACM.

[8]  Julia Kempe,et al.  Quantum random walks: An introductory overview , 2003, quant-ph/0303081.

[9]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[10]  Edwin R. Hancock,et al.  Graph Similarity Using Interfering Quantum Walks , 2007, CAIP.

[11]  John E. Hopcroft,et al.  Linear time algorithm for isomorphism of planar graphs (Preliminary Report) , 1974, STOC '74.

[12]  Edwin R. Hancock,et al.  Graph Embedding Using Quantum Commute Times , 2007, GbRPR.

[13]  Benedikt Löwe,et al.  Logical Approaches to Computational Barriers: CiE 2006 , 2007, J. Log. Comput..

[14]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[15]  P. Høyer,et al.  A Quantum Observable for the Graph Isomorphism Problem , 1999, quant-ph/9901029.

[16]  Takunari Miyazaki,et al.  The complexity of McKay's canonical labeling algorithm , 1995, Groups and Computation.

[17]  Julia Kempe,et al.  The hidden subgroup problem and permutation group theory , 2004, SODA '05.