Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2604.19426

Landscape Compression in Constrained QAOA Tracks Feasibility Loss on IBM Heron Hardware

Dikran S Meliksetian

quant-phcs.ETSubmitted Apr 21, 2026• Announced Apr 22, 2026• 0 citations• Revised Sep 29, 2026 (v2)
v1 · Apr 21, 2026v2 · Sep 29, 2026
arXivHTMLPDF

Abstract

We study how hardware noise changes the p=1 Quantum Approximate Optimization Algorithm (QAOA) landscape for cardinality-constrained portfolio problems on ibm_fez (IBM Heron r2): seven instances from n=6 to 16 qubits, each on a 7x7 parameter grid at 4,096 and 8,192 shots per point. The first version of this paper proposed Landscape Span Compression (LSC), the fractional loss of energy range across the grid, as a device benchmark, based on stable values of 0.24-0.30 at n<=8. The larger study shows why that does not hold. Hardware LSC rises to 0.72-0.81 at n=16, growing with circuit size (R^2=0.96 and 0.88 for an exponential decay in CZ count). Because the landscape energy averages over all shots, it is nearly linear in the feasible fraction, and a statistic built only from that fraction reproduces LSC (Pearson r=0.954). For these penalty-encoded problems, landscape compression is a circuit-fidelity effect expressed as loss of feasible samples, as noise-flattening models of QAOA predict. The same mechanism biases the usual test of parameter transfer: grid verdicts on whether the optimum moves agree across shot counts for only 2 of 7 instances, and hardware optima move toward higher feasibility. Even in noiseless simulation, p=1 QAOA samples the feasible set of these instances almost uniformly, so best-feasible approximation ratios (>=0.9993) are uninformative and the only effect noise can remove is a raised feasible fraction. We withdraw the benchmark and noise-model-gap claims of the first version, correct its solution-quality figures, and describe a protocol that separates feasibility loss from solution quality.

Comments
7 pages, 4 figures, 7 tables. v2: substantially revised after a scaling study to n=16; withdraws the device-benchmark claim of v1 (changes listed in Sec. V). Data: doi:10.5281/zenodo.23040298. Code: https://github.com/dmeliksetian/qaoa-noise-landscape

Related papers

Limits of QAOA Depth Scaling on IBM Quantum Hardware for Fault Tree QUBOs

Devin Peters

The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for near-term quantum advantage in combinatorial optimization. A central design parameter is circuit depth p, with theoretical analyses establishing asymptotic convergence under idealized conditions. This paper presents a limits study demonstrating that this theoretical relationship does not translate to measurable improvement on current noisy intermediate-scale quantum (NISQ) hardware for fault tree analysis applications. Across 120 QAOA executions on 60 QUBO-encoded fault tree instances (N ∈ {12, 16, 20, 24, 28, 32}) on IBM Quantum hardware (ibm_torino, 133-qubit Heron processor), circuit depths p = 1 and p = 2 were directly compared. The mean change in optimal state sampling probability from doubling circuit depth was Δmax_prob = 1.22 × 10⁻⁵ with a median Δ of zero. For 8,192 shots, the binomial sampling uncertainty is O(10⁻²); the observed mean delta is therefore approximately three orders of magnitude below the shot-noise scale, making the difference statistically indistinguishable from zero. Output distribution entropy approaches the theoretical maximum of log₂(8192) ≈ 13 bits, indicating hardware noise dominates algorithmic signal. These findings establish that for fault tree minimal cut set identification on current NISQ devices, computational resources are more effectively allocated to increased shot counts than to circuit depth. Complete experimental artifacts with SHA-256 verification are provided, enabling full reproducibility.

•Jan 18, 2026•0 citations

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

Sanim Yousuf Fahim, Mohammad Arif Hossain

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.

arXiv:2611.10529•Nov 7, 2026•0 citations

QAOA Circuit Depth Does Not Improve Fault Tree Analysis on NISQ Hardware: An Empirical Scaling Study

Devin Peters

The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for near-term quantum advantage in combinatorial optimization. A central design parameter is circuit depth p, with theoretical analyses suggesting higher p monotonically improves solution quality. This paper presents empirical evidence that this theoretical relationship does not hold on current noisy intermediate-scale quantum (NISQ) hardware for fault tree analysis applications. Across 120 QAOA executions on 60 QUBO-encoded fault tree instances (N ∈ {12, 16, 20, 24, 28, 32}) on IBM quantum hardware, circuit depths p = 1 and p = 2 were directly compared. The mean change in optimal state sampling probability from doubling circuit depth was Δmax_prob = 1.22 × 10⁻⁵ with a median Δ of zero, making the difference statistically indistinguishable from noise across all evaluated metrics. Output distribution entropy approaches the theoretical maximum (mean = 12.74 bits), indicating hardware noise dominates algorithmic signal. These findings establish that for fault tree minimal cut set identification on current NISQ devices, computational resources are more effectively allocated to increased shot counts than to circuit depth. Complete experimental artifacts with SHA-256 verification are provided, enabling full reproducibility.

•Jan 13, 2026•0 citations

PACE-QAOA: Physics-Constrained Quantum Optimization for Qubit-Efficient Power System Islanding

Yuqi Jiang, Zhiding Liang, Qiang Guan +2 more

Increasing renewable-energy penetration heightens power-system variability and complicates disturbance containment. Controlled islanding mitigates cascading failures by partitioning a stressed network to limit disrupted power transfer while preserving each island's operational integrity, but this constrained partitioning problem is NP-hard. Although QAOA offers a complementary search strategy, limited near-term qubit capacity restricts conventional formulations. This paper presents a qubit-efficient hybrid quantum framework combining a physics-informed compact encoding with Lagrangian constraint handling and classical feasibility refinement. The encoding exploits grid structure while formally preserving the original feasible solution space and objective. For a fixed island count on sparse working graphs, the formulation reduces phase-separator and per-layer gate complexity from quadratic to linear scaling with system size. Tests on eight IEEE systems ranging from 9 to 89 buses and multiple quantum-provider backends produce feasible, high-quality islanding solutions under practical circuit and sampling budgets. Factorial ablation attributes resource and runtime improvements to the complementary effects of compact encoding and qubit-efficient constraint handling. Noise analysis shows stable solution quality under tested device noise, while landscape diagnostics reveal smoother, more consistently scaled QAOA cost surfaces and improved parameter-optimization behavior. These results offer a transferable approach for scaling constrained quantum optimization toward larger real-world applications on near-term hardware.

quant-pharXiv:2608.02789•Aug 5, 2026•2 citations

Reproducible QUBO-QAOA Benchmark for Cardinality-Constrained Mean-Variance Portfolio Selection

Ata Sani Kılıç, Ercan Erkalkan

Cardinality-constrained mean-variance portfolio selection is a practical decision-support problem in finance and business analytics and a compact benchmark for combinatorial optimization. A Quadratic Unconstrained Binary Optimization (QUBO) model is derived using an equal-weight utility proxy and an instance-adaptive quadratic penalty that enforces a fixed number of selected assets. A depth-one Quantum Approximate Optimization Algorithm (QAOA) solver is evaluated on a classical statevector simulator and compared against an exact feasibleenumeration baseline on small problem sizes. A fully reproducible Python implementation is described, including QUBO construction, penalty calibration, and a$(\gamma, \beta)$grid-search protocol that minimizes expected energy, followed by a top-$M$post-processing rule for returning a feasible portfolio. Across 10 synthetic instances per problem size, feasibility is achieved in all runs for$N \in\{8,10,12\}$with$K=3$under the default setting$(\alpha=10$,$M=256$). An ablation quantifies that top-$M$post-processing is critical for maintaining feasibility under a standard mixer, while penalty scaling exhibits an explicit feasibility-quality trade-off at$N=12$. A simple classical greedy and random-$K$baseline is also reported to contextualize depth-one QAOA performance.

International Conference on Electrical, Computer and Energy Technologies (ICECET)•Jul 1, 2026•0 citations

From Circuits to Hardware: Benchmarking Standard and Qubit-Efficient Quantum Optimization on Real Hardware

Monit Sharma, Hoong Chuin Lau

Despite rapid progress in quantum optimization, broad real-hardware benchmarks comparing multiple algorithmic families across diverse combinatorial problems under a common protocol remain limited. We benchmark gate-based quantum optimization on four NP-hard problems: multi-dimensional knapsack (MDKP), maximum independent set (MIS), quadratic assignment (QAP), and market-share (MSP). We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO, on IBM Heron r1/r2 processors using resilience-level-2 mitigation. To our knowledge, this includes the first real-hardware QRAO results and the first multi-problem PCE hardware benchmark. Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy, $F_{\mathrm{est}}$. For MDKP and MIS, an empirical operating point near $F_{\mathrm{est}}\approx 0.1$, corresponding to about 770 two-qubit gates at the median Heron-r2 CZ error rate, marks the onset of noise-dominated execution. QAP exposes a separate bottleneck: dense one-hot encodings and an exponentially sparse feasible manifold, with feasible fraction $10!/2^{100}$ at $n=10$; no tested hardware method produces a feasible assignment. Compiled QAOA-family circuits are generally noise dominated, and a matched uniform-random control shows that most feasible low-fidelity outcomes fall within the random range, apart from one finite-sample MIS warm-start exception. A SWAP-aware, fractional-gate, Nighthawk-topology compilation counterfactual reduces two-qubit counts but leaves all circuits below $F_{\mathrm{est}}=10^{-3}$. These conclusions apply to the tested implementations rather than QAOA in general. Qubit-efficient methods extend runnable instance sizes, but only within the empirical fidelity budget.

quant-pharXiv:2607.11637•Quantum Science and Technology•Jul 14, 2026•3 citations
We study how hardware noise changes the p=1 Quantum Approximate Optimization Algorithm (QAOA) landscape for cardinality-constrained portfolio problems on ibm_fez (IBM Heron r2): seven instances from n=6 to 16 qubits, each on a 7x7 parameter grid at 4,096 and 8,192 shots per point. The first version of this paper proposed Landscape Span Compression (LSC), the fractional loss of energy range across the grid, as a device benchmark, based on stable values of 0.24-0.30 at n<=8. The larger study shows why that does not hold. Hardware LSC rises to 0.72-0.81 at n=16, growing with circuit size (R^2=0.96 and 0.88 for an exponential decay in CZ count). Because the landscape energy averages over all shots, it is nearly linear in the feasible fraction, and a statistic built only from that fraction reproduces LSC (Pearson r=0.954). For these penalty-encoded problems, landscape compression is a circuit-fidelity effect expressed as loss of feasible samples, as noise-flattening models of QAOA predict. The same mechanism biases the usual test of parameter transfer: grid verdicts on whether the optimum moves agree across shot counts for only 2 of 7 instances, and hardware optima move toward higher feasibility. Even in noiseless simulation, p=1 QAOA samples the feasible set of these instances almost uniformly, so best-feasible approximation ratios (>=0.9993) are uninformative and the only effect noise can remove is a raised feasible fraction. We withdraw the benchmark and noise-model-gap claims of the first version, correct its solution-quality figures, and describe a protocol that separates feasibility loss from solution quality.
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for near-term quantum advantage in combinatorial optimization. A central design parameter is circuit depth p, with theoretical analyses establishing asymptotic convergence under idealized conditions. This paper presents a limits study demonstrating that this theoretical relationship does not translate to measurable improvement on current noisy intermediate-scale quantum (NISQ) hardware for fault tree analysis applications. Across 120 QAOA executions on 60 QUBO-encoded fault tree instances (N ∈ {12, 16, 20, 24, 28, 32}) on IBM Quantum hardware (ibm_torino, 133-qubit Heron processor), circuit depths p = 1 and p = 2 were directly compared. The mean change in optimal state sampling probability from doubling circuit depth was Δmax_prob = 1.22 × 10⁻⁵ with a median Δ of zero. For 8,192 shots, the binomial sampling uncertainty is O(10⁻²); the observed mean delta is therefore approximately three orders of magnitude below the shot-noise scale, making the difference statistically indistinguishable from zero. Output distribution entropy approaches the theoretical maximum of log₂(8192) ≈ 13 bits, indicating hardware noise dominates algorithmic signal. These findings establish that for fault tree minimal cut set identification on current NISQ devices, computational resources are more effectively allocated to increased shot counts than to circuit depth. Complete experimental artifacts with SHA-256 verification are provided, enabling full reproducibility.
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.
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for near-term quantum advantage in combinatorial optimization. A central design parameter is circuit depth p, with theoretical analyses suggesting higher p monotonically improves solution quality. This paper presents empirical evidence that this theoretical relationship does not hold on current noisy intermediate-scale quantum (NISQ) hardware for fault tree analysis applications. Across 120 QAOA executions on 60 QUBO-encoded fault tree instances (N ∈ {12, 16, 20, 24, 28, 32}) on IBM quantum hardware, circuit depths p = 1 and p = 2 were directly compared. The mean change in optimal state sampling probability from doubling circuit depth was Δmax_prob = 1.22 × 10⁻⁵ with a median Δ of zero, making the difference statistically indistinguishable from noise across all evaluated metrics. Output distribution entropy approaches the theoretical maximum (mean = 12.74 bits), indicating hardware noise dominates algorithmic signal. These findings establish that for fault tree minimal cut set identification on current NISQ devices, computational resources are more effectively allocated to increased shot counts than to circuit depth. Complete experimental artifacts with SHA-256 verification are provided, enabling full reproducibility.
Increasing renewable-energy penetration heightens power-system variability and complicates disturbance containment. Controlled islanding mitigates cascading failures by partitioning a stressed network to limit disrupted power transfer while preserving each island's operational integrity, but this constrained partitioning problem is NP-hard. Although QAOA offers a complementary search strategy, limited near-term qubit capacity restricts conventional formulations. This paper presents a qubit-efficient hybrid quantum framework combining a physics-informed compact encoding with Lagrangian constraint handling and classical feasibility refinement. The encoding exploits grid structure while formally preserving the original feasible solution space and objective. For a fixed island count on sparse working graphs, the formulation reduces phase-separator and per-layer gate complexity from quadratic to linear scaling with system size. Tests on eight IEEE systems ranging from 9 to 89 buses and multiple quantum-provider backends produce feasible, high-quality islanding solutions under practical circuit and sampling budgets. Factorial ablation attributes resource and runtime improvements to the complementary effects of compact encoding and qubit-efficient constraint handling. Noise analysis shows stable solution quality under tested device noise, while landscape diagnostics reveal smoother, more consistently scaled QAOA cost surfaces and improved parameter-optimization behavior. These results offer a transferable approach for scaling constrained quantum optimization toward larger real-world applications on near-term hardware.
Cardinality-constrained mean-variance portfolio selection is a practical decision-support problem in finance and business analytics and a compact benchmark for combinatorial optimization. A Quadratic Unconstrained Binary Optimization (QUBO) model is derived using an equal-weight utility proxy and an instance-adaptive quadratic penalty that enforces a fixed number of selected assets. A depth-one Quantum Approximate Optimization Algorithm (QAOA) solver is evaluated on a classical statevector simulator and compared against an exact feasibleenumeration baseline on small problem sizes. A fully reproducible Python implementation is described, including QUBO construction, penalty calibration, and a(γ,β)(\gamma, \beta)(γ,β)grid-search protocol that minimizes expected energy, followed by a top-MMMpost-processing rule for returning a feasible portfolio. Across 10 synthetic instances per problem size, feasibility is achieved in all runs forN∈{8,10,12}N \in\{8,10,12\}N∈{8,10,12}withK=3K=3K=3under the default setting(α=10(\alpha=10(α=10,M=256M=256M=256). An ablation quantifies that top-MMMpost-processing is critical for maintaining feasibility under a standard mixer, while penalty scaling exhibits an explicit feasibility-quality trade-off atN=12N=12N=12. A simple classical greedy and random-KKKbaseline is also reported to contextualize depth-one QAOA performance.
Despite rapid progress in quantum optimization, broad real-hardware benchmarks comparing multiple algorithmic families across diverse combinatorial problems under a common protocol remain limited. We benchmark gate-based quantum optimization on four NP-hard problems: multi-dimensional knapsack (MDKP), maximum independent set (MIS), quadratic assignment (QAP), and market-share (MSP). We study VQE, CVaR-VQE, standard, multi-angle, and warm-start QAOA, together with qubit-efficient PCE and QRAO, on IBM Heron r1/r2 processors using resilience-level-2 mitigation. To our knowledge, this includes the first real-hardware QRAO results and the first multi-problem PCE hardware benchmark. Across 247 method-instance combinations, we report transpiled circuit size, hardware outcomes, and an independent-error gate-count fidelity proxy, FestF_{\mathrm{est}}Fest​. For MDKP and MIS, an empirical operating point near Fest≈0.1F_{\mathrm{est}}\approx 0.1Fest​≈0.1, corresponding to about 770 two-qubit gates at the median Heron-r2 CZ error rate, marks the onset of noise-dominated execution. QAP exposes a separate bottleneck: dense one-hot encodings and an exponentially sparse feasible manifold, with feasible fraction 10!/210010!/2^{100}10!/2100 at n=10n=10n=10; no tested hardware method produces a feasible assignment. Compiled QAOA-family circuits are generally noise dominated, and a matched uniform-random control shows that most feasible low-fidelity outcomes fall within the random range, apart from one finite-sample MIS warm-start exception. A SWAP-aware, fractional-gate, Nighthawk-topology compilation counterfactual reduces two-qubit counts but leaves all circuits below Fest=10−3F_{\mathrm{est}}=10^{-3}Fest​=10−3. These conclusions apply to the tested implementations rather than QAOA in general. Qubit-efficient methods extend runnable instance sizes, but only within the empirical fidelity budget.