A Continuous - Time Quantum Walk for Attributed Graphs Matching

ABSTRACT Various Aspects Of the Theory of Quantum Walks on Graphs are Surveyed. In particular, Quantum network routing ,Kempe[2002],Quantum Walk Search Algorithm, Shenvi,Kempe and Whaley[2002] , Element distinctness ,Ambainis, [2004]. Connections with the eigenvalues of Graphs and the use of these connections in the study of Quantum walks is described. Dierent researchers had contribution and put their benchmark idea Pertaining with this concept. I also try to investigate recent Application of Quantum walks, In particular the problem pertained with Graph matching i.e Matching nodes(vertices) of the Graphs. In this paper,I consider how Continuous-time quantum walk (CTQW) can be applied to Graph-matching problems. The matching problem is abstracted using weighted(attribiuted) Graphs that connects vertices of one Graph to other and Try to compute the distance b/n two Graphs Node's Beside that nding the Cost related to Matching. Finally classing Those Nodes upon the values they had