Table 1 Number of isomorphic-input problems embedded and correctly classified as isomorphic via quantum annealing.
From: Experimental quantum annealing: case study involving the graph isomorphism problem
Size of input graphs (number of vertices) | ||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | |
Number of problems for which an embedding was found using H1 | 100 | 100 | 100 | 74 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Number of problems for which an embedding was found using H2 | 100 | 100 | 100 | 99 | 99 | 96 | 95 | 93 | 87 | 83 | 54 | 39 | 20 | 7 | 4 | 1 |
Number of problems solved using H1 | 100 | 99 | 98 | 13 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Number of problems solved using H1 and chain majority voting | 100 | 100 | 99 | 43 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Number of problems solved using H2 | 100 | 100 | 100 | 98 | 96 | 93 | 86 | 75 | 67 | 53 | 34 | 23 | 9 | 1 | 2 | 0 |
Number of problems solved using H2 and chain majority voting | 100 | 100 | 100 | 99 | 99 | 96 | 90 | 80 | 73 | 65 | 40 | 25 | 12 | 3 | 2 | 1 |
Number of problems solved using H2, chain majority voting and multiple jobs | 100 | 100 | 100 | 99 | 99 | 96 | 95 | 93 | 87 | 83 | 54 | 39 | 20 | 7 | 4 | 1 |
