1207.1712 (Itay Hen et al.)
Itay Hen, A. P. Young
We propose a novel method for a quantum annealer - an analog quantum computer based on the principles of quantum adiabatic evolution - to solve the Graph Isomorphism problem in which one has to determine whether two graphs are isomorphic (i.e., can be transformed into each other simply by a relabeling of the vertices). We demonstrate the capabilities of the method by analyzing several types of graph families, focusing on graphs with particularly high symmetry called strongly regular graphs (SRG's). We also show that our method is applicable to currently available quantum computers such as "D-Wave One" and suggest a way to test our hypothesis with existing resources.
View original:
http://arxiv.org/abs/1207.1712
No comments:
Post a Comment