% 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{Willsch:875239,
      author       = {Willsch, Madita and Willsch, Dennis and Jin, Fengping and
                      De Raedt, Hans and Michielsen, Kristel},
      title        = {{B}enchmarking the quantum approximate optimization
                      algorithm},
      journal      = {Quantum information processing},
      volume       = {19},
      number       = {7},
      issn         = {1570-0755},
      address      = {Dordrecht},
      publisher    = {Springer Science + Business Media B.V.},
      reportid     = {FZJ-2020-01888},
      pages        = {197},
      year         = {2020},
      abstract     = {The performance of the quantum approximate optimization
                      algorithm is evaluated by using three different measures:
                      the probability of finding the ground state, the energy
                      expectation value, and a ratio closely related to the
                      approximation ratio. The set of problem instances studied
                      consists of weighted MaxCut problems and 2-satisfiability
                      problems. The Ising model representations of the latter
                      possess unique ground states and highly degenerate first
                      excited states. The quantum approximate optimization
                      algorithm is executed on quantum computer simulators and on
                      the IBM Q Experience. Additionally, data obtained from the
                      D-Wave 2000Q quantum annealer are used for comparison, and
                      it is found that the D-Wave machine outperforms the quantum
                      approximate optimization algorithm executed on a simulator.
                      The overall performance of the quantum approximate
                      optimization algorithm is found to strongly depend on the
                      problem instance.},
      cin          = {JSC},
      ddc          = {004},
      cid          = {I:(DE-Juel1)JSC-20090406},
      pnm          = {511 - Computational Science and Mathematical Methods
                      (POF3-511) / PhD no Grant - Doktorand ohne besondere
                      Förderung (PHD-NO-GRANT-20170405)},
      pid          = {G:(DE-HGF)POF3-511 / G:(DE-Juel1)PHD-NO-GRANT-20170405},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:000538059200001},
      doi          = {10.1007/s11128-020-02692-8},
      url          = {https://juser.fz-juelich.de/record/875239},
}