% 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”.

@ARTICLE{Hall:203911,
      author       = {Hall, J. S. and Novotny, M. A. and Neuhaus, T. and
                      Michielsen, Kristel},
      title        = {{A} {S}tudy of {S}panning {T}rees on a {D}-{W}ave {Q}uantum
                      {C}omputer},
      journal      = {Physics procedia},
      volume       = {68},
      issn         = {1875-3892},
      address      = {Amsterdam [u.a.]},
      publisher    = {Elsevier},
      reportid     = {FZJ-2015-05452},
      pages        = {56 - 60},
      year         = {2015},
      abstract     = {The performance of a 496 qubit D-Wave Two quantum computer
                      was investigated for spanning tree problems. The chip has a
                      Chimera interaction graph G, an 8x8 lattice of clusters of
                      eight qubits. Problem input consists of values for the
                      fields hj and for the two-qubit interactions Ji,j of an
                      Ising spin-glass problem formulated on G. Output is returned
                      in terms of a spin configuration {sj}, with sj = ±1. A tree
                      is a connected, undirected subgraph of G that contains no
                      cycles, and a spanning tree is a tree which includes all of
                      the vertices of G. We generated random spanning trees
                      (RSTs), uniformly distributed over all spanning trees of G.
                      One hundred RSTs with random Ji,j = {-1,1} and hj = 0 were
                      generated on the full 8x8 graph G of the chip. Each RST
                      problem was solved up to one hundred times and the number of
                      times the ground state energy was found was recorded. This
                      procedure was repeated for square subgraphs G′, thereby
                      providing results for portions of the chip with dimensions
                      ranging from 2x2 to 8x8.},
      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)16},
      UT           = {WOS:000380514400010},
      doi          = {10.1016/j.phpro.2015.07.109},
      url          = {https://juser.fz-juelich.de/record/203911},
}