Solving Maximum Common Subgraph Isomorphism Problem with Quantum Annealing

Huang, N; Roje, D.

dc.contributor.author	Huang, N	en
dc.contributor.author	Roje, D.	en
dc.date.accessioned	2022-01-14T03:42:09Z
dc.date.available	2022-01-14T03:42:09Z
dc.date.issued	2020	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-544 (2020)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	https://hdl.handle.net/2292/58007
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	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php	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	http://purl.org/eprint/accessRights/OpenAccess	en