A Correspondence Measure for Graph Matching using the Discrete Quantum Walk

In this paper we consider how coined quantum walks can be applied to graph matching problems. The matching problem is ab- stracted using an auxiliary graph that connects pairs of vertices from the gra