% IMPORTANT: The following is UTF-8 encoded. This means that in the presence % of non-ASCII characters, it will not work with BibTeX 0.99 or older. % Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or % “biber”. @INPROCEEDINGS{Novotny:281883, author = {Novotny, M. A. and Hobl, Lukas and Hall, J. S. and Michielsen, K.}, title = {{S}panning {T}ree {C}alculations on {D}-{W}ave 2 {M}achines}, journal = {Journal of physics / Conference Series}, volume = {681}, issn = {1742-6596}, address = {Bristol}, publisher = {IOP Publ.}, reportid = {FZJ-2016-01545}, pages = {012005}, year = {2016}, abstract = {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.}, month = {Sep}, date = {2015-09-06}, organization = {International Conference on Computer Simulation and Beyond 2015, Moscow (Russia), 6 Sep 2015 - 10 Sep 2015}, cin = {JSC}, ddc = {530}, cid = {I:(DE-Juel1)JSC-20090406}, pnm = {511 - Computational Science and Mathematical Methods (POF3-511)}, pid = {G:(DE-HGF)POF3-511}, typ = {PUB:(DE-HGF)8 / PUB:(DE-HGF)16}, UT = {WOS:000376042800005}, doi = {10.1088/1742-6596/681/1/012005}, url = {https://juser.fz-juelich.de/record/281883}, }