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

Sanim Yousuf Fahim, Mohammad Arif Hossain

TL;DR

This paper demonstrates that standard hardware validation metrics—like comparing the "mean cost" of a quantum algorithm to a simulation—can be highly misleading for optimization tasks. By testing the Quantum Approximate Optimization Algorithm (QAOA) on an IBM Heron processor, the authors found that while the device retained a significant fraction of its "mean-gap" improvement, the actual probability of finding the optimal solution was up to eight times lower than predicted, meaning the hardware is much better at avoiding bad solutions than it is at finding the best ones.

What Problem Does This Paper Address?

When researchers run optimization algorithms like QAOA on Near-Intermediate Scale Quantum (NISQ) hardware, they often summarize the results using the "mean cost" or "approximation ratio." If the hardware's mean cost matches a noisy simulation, the run is considered "validated."

However, for practical optimization, the mean doesn't matter as much as the Time to Solution (TTS), which is dictated by the probability ($q$) of measuring the absolute best (optimal) bitstring. This paper investigates whether mean-based metrics actually predict the survival of this optimal probability. Specifically, it tests a common assumption: that noise on quantum devices acts like "global depolarization" (which would shrink all probabilities toward a uniform distribution at the same rate). If this assumption holds, mean-gap retention should equal the retention of the optimum.

Methods

The authors evaluated depth-2 ($p=2$) QAOA circuits on the 156-qubit IBM Heron processor (ibm_marrakesh).

Key methodological choices included:

  • Transferred Angles: Instead of running a costly optimization loop on the hardware to find the best circuit parameters ($\gamma, \beta$), they used "transferred angles" pre-trained on smaller, noiseless instances. This ensures every "shot" from the quantum computer is a candidate solution.
  • ADMM Subproblems: The test cases were Quadratic Unconstrained Binary Optimization (QUBO) problems derived from the first step of an Alternating Direction Method of Multipliers (ADMM) decomposition, a common technique for solving complex mixed-integer problems.
  • Error Suppression: They tested the impact of Dynamical Decoupling (DD) and Twirling to see if these techniques could bridge the gap between hardware and simulation.
  • Retention Measures: They introduced "floor-corrected retention" ($\eta$), a metric that measures how much of the noiseless improvement over a random guess survives on the hardware.
Figure 1: Study design. (a) Instances, the first ADMM binary subproblem, depth-2 QAOA circuits with transferred or random angles, and their transpilation for the device. (b) Each circuit is evaluated exactly, in a device-matched noisy simulation, and on hardware under several suppression settings. (c) Retention measures, optimization value, and tests. Proposition 1 predicts that under global depolarization the mean-gap retention η equals the retention ηq of the optimum and of every other set.

Datasets

The study used two types of problem families at 8 and 12 qubits:

  1. Main Family: Randomly generated QUBO instances where coefficients are drawn from a uniform distribution.
  2. Planted Family: Rugged "Wishart planted ensemble" instances. These are designed to be more difficult for local search heuristics because the landscape is "rugged," with many near-optimal solutions clustered near the true optimum.

Key Insights and Ideas

  • The "Mean" is a Deceptive Metric: The most striking insight is that the hardware's ability to avoid the worst solutions (which improves the mean) is much more robust than its ability to find the best solution.
  • Failure of the Global Depolarization Model: In theory, if noise were uniform, the retention of the mean gap ($\eta$) and the retention of the optimum ($\eta_q$) should be equal. In practice, $\eta_q$ was consistently much lower than $\eta$.
  • Noise Models are Too Optimistic: Even "device-matched" noise models (which account for gate errors and relaxation) significantly overestimated how often the hardware would find the optimum—sometimes by a factor of five to eight.
  • Effective Fidelity is Angle-Dependent: The "quality" of the hardware wasn't a constant; it changed depending on the specific rotation angles used in the QAOA circuit. This suggests that simple benchmarks using random circuits might not accurately reflect performance on structured optimization circuits.

Key Results

  • Retention Discrepancy: At 12 qubits, the hardware retained 29% to 46% of its mean-gap improvement but only 5% to 15% of the probability of the optimum.
  • Optimization Performance: On the "Main Family," the hardware found the optimum in 70-78% of 768-shot blocks, but it was outperformed by tuned classical heuristics like Simulated Annealing (SA) and Tabu Search.
  • Planted Family Ruggedness: On the harder "Planted Family," the noiseless advantage of QAOA over local heuristics completely vanished when run on actual hardware.
  • Suppression Effects: Twirling actually lowered the retention of the optimum in these experiments, while Dynamical Decoupling generally helped.
Figure 4: Second 12-qubit submission (ten instances per family; M: main, P: planted). (a) Fraction of 768-shot blocks containing the subproblem optimum per suppression mode, and of 768-evaluation runs of SDP+LS, tabu search with restarts, local search, PT, and random search on the planted subproblems; mean and 95% interval. (b) Mean-gap retention η per instance (horizontal lines: means). (c) Floor-corrected retention ηq of the probability of the optimum against η, per instance and run (filled: second submission; open squares: first submission, main family); the dashed line is the global-depolarization prediction of Proposition 1(d).

Limitations and Future Work

The study was limited to a single device, relatively small qubit counts (up to 12), and a shallow depth ($p=2$). The authors also noted that they did not record gate errors or coherence times at the exact moment of execution, which can drift.

Future work should investigate why the probability of the optimum is so fragile—potentially looking into crosstalk or coherent errors that standard noise models miss. The authors conclude with a call to action for the field: validations of quantum optimization should report the retention of the optimum and near-optimal sets, not just the mean cost.

Summary updated

Abstract

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.
BibTeX
@misc{fahim2026beyond,
  author = {Sanim Yousuf Fahim and Mohammad Arif Hossain},
  title = {{Beyond the Mean Gap: What Transferred-Angle QAOA Retains on a Superconducting Processor}},
  year = {2026},
  eprint = {2611.10529},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.10529},
}
Figure