% 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:1051620,
      author       = {Vert, Daniel and Willsch, Madita and Yenilen, Berat and
                      Sirdey, Renaud and Louise, Stéphane and Michielsen,
                      Kristel},
      title        = {{C}orrection: {B}enchmarking quantum annealing with maximum
                      cardinality matching problems},
      journal      = {Frontiers in computer science},
      volume       = {7},
      issn         = {2624-9898},
      address      = {Lausanne},
      publisher    = {Frontiers Media},
      reportid     = {FZJ-2026-00542},
      pages        = {1744088},
      year         = {2025},
      abstract     = {We benchmark Quantum Annealing (QA) vs. Simulated Annealing
                      (SA) witha focus on the impact of the embedding of problems
                      onto the differenttopologies of the D-Wave quantum
                      annealers. The series of problems we studyare especially
                      designed instances of the maximum cardinality matching
                      problemthat 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, wesimulate the
                      QA process by numerically solving the time-dependent
                      Schrödingerequation. We find that the embedded problems can
                      be significantly moredifficult than the unembedded problems,
                      and some parameters, such as thechain strength, can be very
                      impactful for finding the optimal solution. Thus,finding a
                      good embedding and optimal parameter values can improve
                      theresults considerably. Interestingly, we find that
                      although SA succeeds for theunembedded problems, the SA
                      results obtained for the embedded versionscale quite poorly
                      in comparison with what we can achieve on the D-Wavequantum
                      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)$ / EXC 2004:  Matter and Light
                      for Quantum Computing (ML4Q) (390534769) / DFG project
                      G:(GEPRIS)390534769 - EXC 2004: Materie und Licht für
                      Quanteninformation (ML4Q) (390534769)},
      pid          = {G:(DE-HGF)POF4-5111 / $G:(DE-Juel-1)aidas_20200731$ /
                      G:(BMBF)390534769 / G:(GEPRIS)390534769},
      typ          = {PUB:(DE-HGF)16},
      doi          = {10.3389/fcomp.2025.1744088},
      url          = {https://juser.fz-juelich.de/record/1051620},
}