This title appears in the Scientific Report :
2016
Please use the identifier:
http://hdl.handle.net/2128/9846 in citations.
Please use the identifier: http://dx.doi.org/10.1088/1742-6596/681/1/012005 in citations.
Spanning Tree Calculations on D-Wave 2 Machines
Spanning Tree Calculations on D-Wave 2 Machines
Calculations on D-Wave machines are presented, both for the 500-qubit and the 1000-qubit machines. Results are presented for spanning trees on the available K4,4 Chimera graphs of both machines. Comparing trees of approximately the same size, the frequency of finding the ground state for the 1000-qu...
Saved in:
Personal Name(s): | Novotny, M. A. (Corresponding author) |
---|---|
Hobl, Lukas / Hall, J. S. / Michielsen, K. | |
Contributing Institute: |
Jülich Supercomputing Center; JSC |
Published in: | Journal of physics / Conference Series, 681 (2016) S. 012005 |
Imprint: |
Bristol
IOP Publ.
2016
|
Physical Description: |
13 p. |
DOI: |
10.1088/1742-6596/681/1/012005 |
Conference: | International Conference on Computer Simulation and Beyond 2015, Moscow (Russia), 2015-09-06 - 2015-09-10 |
Document Type: |
Contribution to a conference proceedings Journal Article |
Research Program: |
Computational Science and Mathematical Methods |
Link: |
OpenAccess OpenAccess |
Publikationsportal JuSER |
Please use the identifier: http://dx.doi.org/10.1088/1742-6596/681/1/012005 in citations.
Calculations on D-Wave machines are presented, both for the 500-qubit and the 1000-qubit machines. Results are presented for spanning trees on the available K4,4 Chimera graphs of both machines. Comparing trees of approximately the same size, the frequency of finding the ground state for the 1000-qubit machine is significantly improved over the 500- qubit older generation machine. Spanning trees are difficult problems for solution by adiabatic quantum computers, so the enhanced frequency of finding the ground state for newer machine generations and larger machines is encouraging for this immature technology. |