We present QUBO objective functions for the maximum common sub-graph
isomorphism problem, proved their correctness and illustrate them with a few toy
problems. Very small scale problems can be solved by the D-Wave 2X machine
with high enough accurate rates; however, for larger scale problems, the accurate
rate drops significantly.
