We introduce and empirically validate Landscape Span Compression (LSC), a device-agnostic metric for quantifying how hardware noise distorts the variational energy landscape of the Quantum Approximate Optimization Algorithm (QAOA). Intuitively, LSC measures how much noise flattens the energy landscape, approaching 1 as the landscape collapses toward a barren plateau. We report an experience study of applying QAOA with LSC-based noise characterization on IBM's ibm_fez for three constrained QUBO portfolio instances, distilling practical lessons for parameter transfer, calibration-model fidelity, and error mitigation. Running p=1 QAOA on ibm_fez (Heron r2, 156 qubits) with up to 57,344 shots per grid point across three constrained binary optimization instances encoded as QUBO problems, we find: (i) hardware noise uniformly compresses the landscape span by 24-30% without displacing the global minimum, supporting classical-to-hardware parameter transfer; (ii) feasibility fractions at the optimal parameters remain 1.5-1.7 times above random sampling despite noise-induced degradation; (iii) the IBM calibration-based noise model achieves Pearson r=0.959 structural agreement with hardware but explains only approximately 42% of approximation-ratio degradation, with crosstalk and coherent errors as the leading unexplained contributors; (iv) a consistent noise cost of approximately 0.03 approximation-ratio units is observed across all instances; and (v) Zero-Noise Extrapolation yields mixed energy improvements of +7%/+9%/-4% per instance with 3-5 times uncertainty inflation. We compare LSC against four existing metrics and argue it is the most robust discriminator of noise severity for constrained QAOA on near-term devices.
Comments
5 pages, 6 figures, 3 tables. Preprint under review
We introduce and empirically validate Landscape Span Compression (LSC), a device-agnostic metric for quantifying how hardware noise distorts the variational energy landscape of the Quantum Approximate Optimization Algorithm (QAOA). Intuitively, LSC measures how much noise flattens the energy landscape, approaching 1 as the landscape collapses toward a barren plateau. We report an experience study of applying QAOA with LSC-based noise characterization on IBM's ibm_fez for three constrained QUBO portfolio instances, distilling practical lessons for parameter transfer, calibration-model fidelity, and error mitigation. Running p=1 QAOA on ibm_fez (Heron r2, 156 qubits) with up to 57,344 shots per grid point across three constrained binary optimization instances encoded as QUBO problems, we find: (i) hardware noise uniformly compresses the landscape span by 24-30% without displacing the global minimum, supporting classical-to-hardware parameter transfer; (ii) feasibility fractions at the optimal parameters remain 1.5-1.7 times above random sampling despite noise-induced degradation; (iii) the IBM calibration-based noise model achieves Pearson r=0.959 structural agreement with hardware but explains only approximately 42% of approximation-ratio degradation, with crosstalk and coherent errors as the leading unexplained contributors; (iv) a consistent noise cost of approximately 0.03 approximation-ratio units is observed across all instances; and (v) Zero-Noise Extrapolation yields mixed energy improvements of +7%/+9%/-4% per instance with 3-5 times uncertainty inflation. We compare LSC against four existing metrics and argue it is the most robust discriminator of noise severity for constrained QAOA on near-term devices.
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.
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.
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.
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(γ,β)grid-search protocol that minimizes expected energy, followed by a top-Mpost-processing rule for returning a feasible portfolio. Across 10 synthetic instances per problem size, feasibility is achieved in all runs forN∈{8,10,12}withK=3under the default setting(α=10,M=256). An ablation quantifies that top-Mpost-processing is critical for maintaining feasibility under a standard mixer, while penalty scaling exhibits an explicit feasibility-quality trade-off atN=12. A simple classical greedy and random-Kbaseline 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, Fest. For MDKP and MIS, an empirical operating point near Fest≈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!/2100 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 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.