% 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{Mller:1046982,
      author       = {Müller, Thorge and Singh, Ajainderpal and Wilhelm, Frank
                      K. and Bode, Tim},
      title        = {{L}imitations of quantum approximate optimization in
                      solving generic higher-order constraint-satisfaction
                      problems},
      journal      = {Physical review research},
      volume       = {7},
      number       = {2},
      issn         = {2643-1564},
      address      = {College Park, MD},
      publisher    = {APS},
      reportid     = {FZJ-2025-04050},
      pages        = {023165},
      year         = {2025},
      abstract     = {The ability of the quantum approximate optimization
                      algorithm (QAOA) to deliver a quantum advantage on
                      combinatorial optimization problems is still unclear.
                      Recently, a scaling advantage over a classical solver was
                      postulated to exist for random 8-SAT at the satisfiability
                      threshold. At the same time, the viability of quantum error
                      mitigation for deep circuits on near-term devices has been
                      put into doubt. Here we analyze the QAOA's performance on
                      random Max-𝑘⁢XORas a function of 𝑘and the
                      clause-to-variable ratio. As a classical benchmark, we use
                      the mean-field approximate optimization algorithm and find
                      that it performs better than or equal to the QAOA on
                      average. Still, for large 𝑘and numbers of layers 𝑝,
                      there may remain a window of opportunity for the QAOA.
                      However, by extrapolating our numerical results, we find
                      that reaching high levels of satisfaction would require
                      extremely large 𝑝, which must be considered rather
                      difficult both in the variational context and on near-term
                      devices.},
      cin          = {PGI-12},
      ddc          = {530},
      cid          = {I:(DE-Juel1)PGI-12-20200716},
      pnm          = {5214 - Quantum State Preparation and Control (POF4-521) /
                      BMBF 13N16149 - QSolid - Quantencomputer im Festkörper
                      (BMBF-13N16149)},
      pid          = {G:(DE-HGF)POF4-5214 / G:(DE-Juel1)BMBF-13N16149},
      typ          = {PUB:(DE-HGF)16},
      doi          = {10.1103/PhysRevResearch.7.023165},
      url          = {https://juser.fz-juelich.de/record/1046982},
}