A Survey of Graph Matching Techniques using Quantum Walks

Ms. Jayaprabha Yadav, Mrs. Aparna Junnarkar

Abstract Graph matching techniques have been projected as a powerful tool for Pattern Recognition since the inception of machine vision. The reason might be the fact that the computational cost of the graph-based algorithms, although still high in most cases, is now becoming compatible with high performance computing. Here we endeavour to catalogue the literature on quantum walk techniques for graph matching. A continuous time quantum walk consists of a particle moving among the vertices of a graph which cannot distinguish two non-isomorphic graphs with high symmetry. We then discuss the quantum walks involving more than one particle. In addition to moving around the graph, these particles interact when they come across one another. Our focus is on a class of graphs with specifically high symmetry called strongly regular graphs. Our goal in this paper is to deliver a theoretical association of graph matching techniques using quantum walks. Keywords: graph isomorphism, quantum walks, continuous-time quantum walk, interacting bosons.

Title:	A Survey of Graph Matching Techniques using Quantum Walks
Author Name:	Ms. Jayaprabha Yadav, Mrs. Aparna Junnarkar
Abstract:	Abstract Graph matching techniques have been projected as a powerful tool for Pattern Recognition since the inception of machine vision. The reason might be the fact that the computational cost of the graph-based algorithms, although still high in most cases, is now becoming compatible with high performance computing. Here we endeavour to catalogue the literature on quantum walk techniques for graph matching. A continuous time quantum walk consists of a particle moving among the vertices of a graph which cannot distinguish two non-isomorphic graphs with high symmetry. We then discuss the quantum walks involving more than one particle. In addition to moving around the graph, these particles interact when they come across one another. Our focus is on a class of graphs with specifically high symmetry called strongly regular graphs. Our goal in this paper is to deliver a theoretical association of graph matching techniques using quantum walks. Keywords: graph isomorphism, quantum walks, continuous-time quantum walk, interacting bosons.
Cite this article:	Ms. Jayaprabha Yadav, Mrs. Aparna Junnarkar , " A Survey of Graph Matching Techniques using Quantum Walks " , International Journal of Emerging Trends & Technology in Computer Science (IJETTCS), Volume 3, Issue 4, July - August 2014 , pp. 360-363 , ISSN 2278-6856.
Full Text [PDF] Home