% 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{Bode:1042351,
      author       = {Bode, Tim and Ramesh, Krish and Stollenwerk, Tobias},
      title        = {{Q}uantum combinatorial optimization beyond the variational
                      paradigm: {S}imple schedules for hard problems},
      journal      = {Physical review / A},
      volume       = {111},
      number       = {3},
      issn         = {2469-9926},
      address      = {Woodbury, NY},
      publisher    = {Inst.},
      reportid     = {FZJ-2025-02545},
      pages        = {032411},
      year         = {2025},
      abstract     = {Advances in quantum algorithms suggest a tentative scaling
                      advantage on certain combinatorial optimization problems.
                      Recent work, however, has also reinforced the idea that
                      barren plateaus render variational algorithms ineffective on
                      large Hilbert spaces. Hence, finding annealing protocols by
                      variation ultimately appears to be difficult. Similarly, the
                      adiabatic theorem fails on hard problem instances with
                      first-order quantum phase transitions. Here we show how to
                      use the spin coherent-state path integral to shape the
                      geometry of quantum adiabatic evolution, leading to
                      annealing protocols at polynomial overhead that provide
                      orders-of-magnitude improvements in the probability to
                      measure optimal solutions, relative to linear protocols.
                      These improvements are not obtained on a controllable toy
                      problem but on randomly generated hard instances
                      (Sherrington-Kirkpatrick and maximum 2-satisfiability),
                      making them generic and robust. Our method works for large
                      systems and may thus be used to improve the performance of
                      state-of-the-art quantum devices.},
      cin          = {PGI-12},
      ddc          = {530},
      cid          = {I:(DE-Juel1)PGI-12-20200716},
      pnm          = {5221 - Advanced Solid-State Qubits and Qubit Systems
                      (POF4-522) / Verbundprojekt: Digital-Analoge Quantencomputer
                      (DAQC) - Teilvorhaben: DAQC Kontrolle, Kalibrierung und
                      Charakterisierung (13N15688)},
      pid          = {G:(DE-HGF)POF4-5221 / G:(BMBF)13N15688},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:001451675900006},
      doi          = {10.1103/PhysRevA.111.032411},
      url          = {https://juser.fz-juelich.de/record/1042351},
}