loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
18th International Conference on Pattern Recognition (ICPR'06) Volume 3
Graph Matching using Interference of Coined Quantum Walks
Hong Kong
August 20-August 24
ISBN: 0-7695-2521-0
ASCII Text
x 
 
David Emms, Edwin Hancock, Richard Wilson, "Graph Matching using Interference of Coined Quantum Walks," Pattern Recognition, International Conference on, vol. 3, pp. 133-136, 18th International Conference on Pattern Recognition (ICPR'06) Volume 3, 2006.
 
 
BibTex
x
 
@article{ 10.1109/ICPR.2006.615,
author = {David Emms and Edwin Hancock and Richard Wilson},
title = {Graph Matching using Interference of Coined Quantum Walks},
journal ={Pattern Recognition, International Conference on},
volume = {3},
year = {2006},
issn = {1051-4651},
pages = {133-136},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPR.2006.615},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Pattern Recognition, International Conference on
TI - Graph Matching using Interference of Coined Quantum Walks
SN - 1051-4651
SP133
EP136
A1 - David Emms,
A1 - Edwin Hancock,
A1 - Richard Wilson,
PY - 2006
KW - null
VL - 3
JA - Pattern Recognition, International Conference on
ER -
 
David Emms, University of York
Edwin Hancock, University of York
Richard Wilson, University of York
In this paper we consider how coined quantum walks can be applied to exact graph matching. The matching problem is abstracted using an auxiliary structure that connects pairs of vertices from the graphs to be matched by way of auxiliary vertices. We locate matches using coined quantum walks on this structure. We have tested the algorithm on graphs derived from the NCI molecule database and found it to significantly reduce the space of possible matchings thereby allowing the graphs to be matched directly. We also perform a sensitivity analysis on the algorithm in order to examine its behaviour in the presence of noise.
Citation:
David Emms, Edwin Hancock, Richard Wilson, "Graph Matching using Interference of Coined Quantum Walks," icpr, vol. 3, pp.133-136, 18th International Conference on Pattern Recognition (ICPR'06) Volume 3, 2006
Usage of this product signifies your acceptance of the Terms of Use.