% 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{Vert:1027544,
      author       = {Vert, Daniel and Willsch, Madita and Yenilen, Berat and
                      Sirdey, Renaud and Louise, Stéphane and Michielsen,
                      Kristel},
      title        = {{B}enchmarking quantum annealing with maximum cardinality
                      matching problems},
      journal      = {Frontiers in computer science},
      volume       = {6},
      issn         = {2624-9898},
      address      = {Lausanne},
      publisher    = {Frontiers Media},
      reportid     = {FZJ-2024-03947},
      pages        = {1286057},
      year         = {2024},
      abstract     = {We benchmark Quantum Annealing (QA) vs. Simulated Annealing
                      (SA) with a focus on the impact of the embedding of problems
                      onto the different topologies of the D-Wave quantum
                      annealers. The series of problems we study are especially
                      designed instances of the maximum cardinality matching
                      problem that are easy to solve classically but difficult for
                      SA and, as found experimentally, not easy for QA either. In
                      addition to using several D-Wave processors, we simulate the
                      QA process by numerically solving the time-dependent
                      Schrödinger equation. We find that the embedded problems
                      can be significantly more difficult than the unembedded
                      problems, and some parameters, such as the chain strength,
                      can be very impactful for finding the optimal solution.
                      Thus, finding a good embedding and optimal parameter values
                      can improve the results considerably. Interestingly, we find
                      that although SA succeeds for the unembedded problems, the
                      SA results obtained for the embedded version scale quite
                      poorly in comparison with what we can achieve on the D-Wave
                      quantum annealers.},
      cin          = {JSC},
      ddc          = {004},
      cid          = {I:(DE-Juel1)JSC-20090406},
      pnm          = {5111 - Domain-Specific Simulation $\&$ Data Life Cycle Labs
                      (SDLs) and Research Groups (POF4-511) / AIDAS - Joint
                      Virtual Laboratory for AI, Data Analytics and Scalable
                      Simulation $(aidas_20200731)$ / DFG project 390534769 - EXC
                      2004: Materie und Licht für Quanteninformation (ML4Q)
                      (390534769)},
      pid          = {G:(DE-HGF)POF4-5111 / $G:(DE-Juel-1)aidas_20200731$ /
                      G:(GEPRIS)390534769},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:001249804500001},
      doi          = {10.3389/fcomp.2024.1286057},
      url          = {https://juser.fz-juelich.de/record/1027544},
}