dc.contributor.author |
Anuradha Mahasinghe, MJD |
en |
dc.contributor.author |
Dinneen, Michael |
en |
dc.contributor.author |
Liu, K |
en |
dc.date.accessioned |
2019-01-09T02:51:34Z |
en |
dc.date.issued |
2018-02 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-519 (2018) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/45076 |
en |
dc.description.abstract |
In this paper we demonstrate how to solve the chromatic sum problem using a D-Wave quantum computer. Starting from a BIP (binary integer programming) formulation, we develop a D-Wave feasible QUBO quadratic unconstrained binary optimisation) formulation of the chromatic sum problem. Our construction requires nk qubits for a graph of n vertices and upper bound of k colours. Further, we present the experimental results obtained by running several QUBOs on a D-Wave quantum computer. |
en |
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.title |
Finding the Chromatic Sums of Graphs Using a D-Wave Quantum Computer |
en |
dc.type |
Report |
en |
pubs.volume |
CDMTCS-519 |
en |
dc.rights.holder |
Copyright: The authors |
en |
pubs.author-url |
https://www.cs.auckland.ac.nz/research/groups/CDMTCS/researchreports/index.php |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |
pubs.subtype |
Technical Report |
en |
pubs.elements-id |
758669 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.record-created-at-source-date |
2018-12-26 |
en |