Graph matching using the interference of continuous-time quantum walks

DOI10.1016/j.patcog.2008.09.001zbMath1181.68232WikidataQ60431133 ScholiaQ60431133MaRDI QIDQ1010111

Edwin R. Hancock, Richard C. Wilson, David Emms

Publication date: 3 April 2009

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.09.001

zbMATH Keywords

interference; object recognition; graph matching; continuous-time quantum walk

Mathematics Subject Classification ID

68T10: Pattern recognition, speech recognition

Related Items

Graph kernels from the Jensen-Shannon divergence, Local feature point extraction for quantum images, 3D shape retrieval using kernels on extended Reeb graphs, Fast depth-based subgraph kernels for unattributed graphs, Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph spectral image smoothing using the heat kernel
• Subgraph isomorphism, matching relational structures and maximal cliques
• An example of the difference between quantum and classical random walks
• A graph distance measure for image analysis
• Exponential algorithmic speedup by a quantum walk
• An eigendecomposition approach to weighted graph matching problems
• Organization of Relational Models for Scene Analysis
• An Algorithm for Subgraph Isomorphism
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A distance measure between attributed relational graphs for pattern recognition
• One-dimensional quantum walks
• Quantum walks on graphs
• A classical approach to the graph isomorphism problem using quantum walks
• Logical Approaches to Computational Barriers
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques