Beyond the Mean Gap: What Transferred-Angle QAOA Retains on a Superconducting Processor
Authors: Sanim Yousuf Fahim, Mohammad Arif Hossain
Organizations: Daffodil International University, Dhaka, Bangladesh · Department of Engineering Technology and Quantum Research Interdisciplinary Science and Education (QRISE) Center, Middle Tennessee State University, Murfreesboro, TN 37132, USA
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 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.
Figures & tables
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.
Figure 2: Hardware at n=8 on ibm_marrakesh , both sessions. Mean gap relative to uniform for (a) random and (b) transferred angles, per instance; the dashed line marks the uniform distribution. (c) Total variation distance (TVD) to the device-matched simulation, mean over instances.
Condition
Pr768
η
q
TTS99
Main family
Noiseless
1.00
1
0.0185
246
Device model (first) a)
1.00
0.75 (0.70–0.78)
0.0072
646
First, DD + tw.
0.70 [0.54, 0.84]
0.29 (0.24–0.34)
0.0013
3456
First, none
0.78 [0.62, 0.92]
0.40 (0.28–0.48)
0.0017
2692
Second, none
0.82 [0.66, 0.96]
0.44 (0.38–0.50)
0.0024
2071
Table 1: Hardware at n=12 ( p=2 , transferred angles, ten instances per family, first ADMM subproblem).
Figure 3: First 12-qubit submission (ten main-family instances, transferred angles). (a) Fraction of 768-shot blocks containing the subproblem optimum, with random search, SA, and tuned SA at 768 evaluations, mean and 95% interval. (b) Mean-gap retention η per instance for the device-matched simulation and for hardware with and without suppression (dynamical decoupling, DD, and twirling together), raw and readout-mitigated, with 95% shot-bootstrap intervals.
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).
Run
Mode
Counts
Exp.
ηq [95% CI]
η
Ratio
Below
P
First, main
DD + tw.
5.5 (2)
22.8
0.046 [0.024, 0.082]
0.289
6.4
10/10
0.002
First, main
none
7 (2)
29.0
0.068 [0.032, 0.109]
0.402
6.1
10/10
0.002
Second, main
none
10 (2)
31.1
0.065 [0.023, 0.212]
0.449
6.6
9/10
0.004
Second, main
DD
14 (5)
32.7
0.147 [0.078, 0.237]
0.463
3.0
10/10
0.002
Second, main
tw.
9 (3)
27.5
0.046 [0.034, 0.208]
0.388
8.1
9/10
0.006
Second, main
DD + tw.
6.5 (2)
27.1
0.068 [0.038, 0.112]
0.374
5.6
10/10
0.002
Table 2: Floor-corrected retention of the probability of the optimum against mean-gap retention ( n=12 , ten instances per row, unmitigated counts).
{gunif≤t}
Run
Mode
η
0.05
0.1
0.2
0.5
{gunif>1}
d≤1
First, main
DD + tw.
0.289
0.036
0.042
0.064
0.182
0.45
0.077
First, main
none
0.402
0.068
0.078
0.114
0.292
0.60
0.096
Second, main
none
0.449
0.081
0.096
0.144
0.335
0.64
0.136
Second, main
DD
0.463
0.113
0.127
0.172
0.370
0.64
0.178
Second, main
tw.
0.388
0.056
0.076
0.108
0.292
0.56
0.120
Table 3: Threshold-resolved floor-corrected retention ( n=12 , medians over ten instances, post hoc).
Figure 5: Where the probability is lost ( n=12 , medians over ten instances, post hoc). Floor-corrected retention of the near-optimal sets {gunif≤t} against the threshold t ( t=0 : the optimum), of the ideal state’s probability deficit on the poor set {gunif>1} (squares; open: first submission), and the mean-gap retention η of the same run (bars) for (a) the main family, including the device-matched model of the first submission, and (b) the planted family. Global depolarization predicts that every point of a run lies at its η .
Quantum Approximate Optimization Algorithm (QAOA) uses parameterized quantum circuits and classical feedback to seek good solutions to discrete optimization problems.
The Quantum Approximate Optimization Algorithm (QAOA) and its variants are leading algorithms to help solve challenging combinatorial optimization problems. QAOA maps these problems to Ising Hamiltonians such that their ground state is the desired solution. Candidate solutions are then drawn from a variational quantum circuit. The performance of QAOA hinges on a set of variational angles. However, finding good angles is an instance-specific and computationally expensive non-convex classical optimization task. Here, we learn the mapping from the problem instance to high-quality QAOA angles. Our learned models replace the per-instance optimization, that we call the solver, with a single forward pass that is several orders of magnitude faster than the solver with a near identical quality. Our models further generalize to unseen topologies such as Barabási-Albert and 2D grid graphs. Experiments on quantum hardware confirm that QAOA samples with angles produced by our open-source models are indistinguishable from solver angles. Crucially, models sensitive to the topology of the problem instance increase the quality of the QAOA angles. Our work amortizes a major bottleneck in QAOA by an up-front data generation and training cost. Importantly, this cost can be amortized over time in settings where many similar problems are optimized on a regular basis, as is often the case in applications for industry.
Johannes Jakubik, Isabelle Wittmann, Zaheed Gaffoor +5
We benchmark classical optimization of a fixed low-depth Quantum Approximate Optimization Algorithm (QAOA) ansatz across four cost-Hamiltonian families at N=12, p=3, and D=6. Ten optimizers are compared over 25 independent runs under common ceilings of 10,000 and 30,000 function evaluations (FEs), first with exact statevector objectives and then with two additive observation-noise levels. Exact objectives favor multistart BFGS and multistart CMA-ES. Under noisy feedback, adaptive population methods become more competitive, but the ranking depends on whether performance is measured by the best exact point visited or by the point selected from noisy observations. A targeted extension over all three pre-screened instances per family confirms this regime change while showing that named adaptive-DE winners are instance dependent: jSO-lite leads low-noise oracle search, iL-SHADE high-noise oracle search, and L-SRTDE high-noise selected solutions in the equal-instance summaries. Bootstrap analysis quantifies a non-negligible high-noise search--selection gap, and a retrospective fixed-budget verification proxy shows that reserving a small measurement budget for final re-evaluation improves selected quality across all ten methods at 30,000 FEs. A supplementary structure-aware study further shows that QAOA cross-depth restriction and continuous basin refinement are more useful in these conditions than standalone Monte Carlo tree-search selection. Overall, optimizer choice depends jointly on landscape structure, observation noise, and final-point identification.
Vojtěch Novák, Ivan Zelinka, Swagatam Das +1
Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VSB–Technical University of Ostrava, Ostrava, Czech Republic · IT4Innovations National Supercomputing Center, VSB–Technical University of Ostrava, 708 00 Ostrava, Czech Republic · Department of Informatics and Statistics, Marine Research Institute, Klaipeda University, Lithuania +2
To overcome the limitations of classical partially connected Boltzmann machines and mainstream quantum Boltzmann machines (QBMs), this work extends the conventional circuit of the quantum approximate optimization algorithm (QAOA) to a bilevel optimization architecture and proposes a fully connected QBM. The inner-loop training simulates positive phase energy minimization based on the computational process of the conventional QAOA circuit, whereas the outer-loop training simulates negative phase contrastive divergence learning by optimizing the structural parameters of the target Hamiltonian. It is found that, first, the model exhibits superior performance using only a single layer (p=1) in the QAOA circuit, with an average probability of 0.9559 in measuring the target quantum state under noiseless conditions. Second, the model exhibits notable noise robustness. Under the typical noise level of current mainstream commercial quantum computing devices, the average probability of measuring the target quantum state reaches 0.6047; when the noise rises to a more stringent level with doubled intensity, this probability remains at 0.3859. In both scenarios, the target quantum state maintains the highest measurement probability among all detected states, with a value several times higher than that of the second-ranked state. This indicates that the model retains strong robustness even when noise meets or exceeds the upper limit of current mainstream commercial quantum computing devices. Third, under a block-by-block learning strategy with p=1 and only 10 measurement shots, the model consistently generates the target "qubit" grid image regardless of noise interference, demonstrating strong robustness in image generation.
Jun Liu
School of Economics, Hunan University of Finance and Economics, Changsha 410205, China