dc.contributor.author |
Yan Kolezhitskiy, MJD |
en |
dc.contributor.author |
Dinneen, Michael |
en |
dc.contributor.author |
Nies, A |
en |
dc.date.accessioned |
2019-01-09T04:29:17Z |
en |
dc.date.issued |
2018-04 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-525 (2018) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/45078 |
en |
dc.description.abstract |
Quantum computing has been a popular phenomena in Computer Science over the past few decades. More specifically in recent years, the D-Wave, a commercially available quantum computer, has been receiving significant attention due to the fact that it can take in as input non-trivial NP hard problems and produce results of varying accuracy. The broadcast problem is a popular optimization problem of graph theory, it asks if there is an efficient way to spread a message across a network in a given time frame. The main purpose of our efforts is two-fold; To evaluate the capacity of the D-Wave quantum computer to tackle this type of problem. Also to evaluate the current QUBO formulation (a specific presentation of the problem which the D-Wave can solve) of the broadcast problem and compare to a previous formulation. We present here the results as generated by the D-Wave on the current best-known QUBO formulation. We also compare them to the previous results, concluding that indeed the current QUBO formulation of the broadcast problem is more efficient. |
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 |
D-Wave Experimental Results for an Improved QUBO Formulation of the Broadcast Time Problem |
en |
dc.type |
Report |
en |
pubs.volume |
CDMTCS-525 |
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 |
758673 |
en |
pubs.org-id |
Science |
en |
pubs.org-id |
School of Computer Science |
en |
pubs.record-created-at-source-date |
2018-12-26 |
en |