Solving Maximum Common Subgraph Isomorphism Problem with Quantum Annealing

Show simple item record Huang, N en Roje, D. en 2022-01-14T03:42:09Z 2022-01-14T03:42:09Z 2020 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-544 (2020) en
dc.identifier.issn 1178-3540 en
dc.description.abstract 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.
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri en
dc.source.uri en
dc.title Solving Maximum Common Subgraph Isomorphism Problem with Quantum Annealing en
dc.type Technical Report en
dc.subject.marsden Fields of Research en
dc.rights.holder Copyright: The author(s) en
dc.rights.accessrights en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace