Metraipolis › archive › dc_79fc01d709e0

Beyond the Mean Gap: What Transferred-Angle QAOA Retains on a Superconducting Processor — arXiv:2611.10529

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.10529
License (as archived)
CC0-1.0
Archived
2026-11-10T18:42:34.898Z
SHA-256 of the archived text
baa14fd7cbfdeec4d9f4c09bac5bb5da20765ee9eb7d52a4e7620fc7671d701b
Stable URL of this page
https://metraipolis.com/documento/dc_79fc01d709e0

How to cite

Beyond the Mean Gap: What Transferred-Angle QAOA Retains on a Superconducting Processor — arXiv:2611.10529 — arXiv (en), https://arxiv.org/abs/2611.10529 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_79fc01d709e0 (Metraipolis archive dc_79fc01d709e0, sha256 baa14fd7cbfdeec4d9f4c09bac5bb5da20765ee9eb7d52a4e7620fc7671d701b)
BibTeX
@misc{dc79fc01d709e0,
  title = {Beyond the Mean Gap: What Transferred-Angle QAOA Retains on a Superconducting Processor — arXiv:2611.10529},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.10529},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_79fc01d709e0; sha256 baa14fd7cbfdeec4d9f4c09bac5bb5da20765ee9eb7d52a4e7620fc7671d701b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.10529. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Hardware executions of the quantum approximate optimization algorithm (QAOA) are often validated by comparing the device's mean cost with a simulation, a check that can miss what matters for optimization. Under global depolarization, the mean normalized gap and the floor-corrected probability of every set of bitstrings, the optimum included, retain the same fraction of their noiseless improvement over uniform sampling. We test this prediction with depth-2, transferred-angle QAOA circuits for binary subproblems of an alternating-direction decomposition on the IBM Heron processor \texttt{ibm\_marrakesh}, with and without dynamical decoupling and twirling. At 12 qubits, the main-family circuits retained 29\% to 46\% of their mean-gap improvement but only 5\% to 15\% of their probability of the optimum, lower on at least nine of ten instances per run. Near-optimal bitstrings were lost about as much as the optimum, whereas the avoidance of poor bitstrings was retained best. In the first submission, a device-matched noise model reproduced the pattern but overestimated the retention of the optimum five- to eightfold. On a rugged planted family, the device found the optimum in 62\% of 768-shot blocks (noiseless: 98\%), within the range of local heuristics. Validations of optimization circuits should report retention of the optimum and of near-optimal sets.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2611.10529 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-10T18:37:37.593Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).