Limits of QAOA Depth Scaling on IBM Quantum Hardware for Fault Tree QUBOs
Authors/Creators
Description
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.
Files
Limits of QAOA Depth Scaling on IBM Quantum Hardware.pdf
Additional details
References
- E. Farhi, J. Goldstone, and S. Gutmann, "A quantum approximate optimization algorithm," arXiv:1411.4028, 2014.
- E. Farhi, J. Goldstone, and S. Gutmann, "The quantum approximate optimization algorithm and the Sherrington-Kirkpatrick model at infinite size," Quantum, vol. 6, p. 759, 2022.
- G. G. Guerreschi and A. Y. Matsuura, "QAOA for max-cut requires hundreds of qubits for quantum speed-up," Scientific Reports, vol. 9, no. 1, p. 6903, 2019.
- S. Hadfield et al., "From the quantum approximate optimization algorithm to a quantum alternating operator ansatz," Algorithms, vol. 12, no. 2, p. 34, 2019.
- L. Zhou et al., "Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices," Physical Review X, vol. 10, no. 2, p. 021067, 2020.
- J. Preskill, "Quantum computing in the NISQ era and beyond," Quantum, vol. 2, p. 79, 2018.
- W. E. Vesely, F. F. Goldberg, N. H. Roberts, and D. F. Haasl, "Fault tree handbook," NUREG-0492, U.S. Nuclear Regulatory Commission, 1981.
- E. M. Aras and M. A. Diaconeasa, "A critical look at the need for performing multi-hazard probabilistic risk assessment for nuclear power plants," Eng, vol. 2, no. 4, pp. 454–467, 2021.
- A. Lucas, "Ising formulations of many NP problems," Frontiers in Physics, vol. 2, no. 5, pp. 1–15, 2014.
- F. Glover, G. Kochenberger, and Y. Du, "Quantum Bridge Analytics I: A tutorial on formulating and using QUBO models," Annals of Operations Research, vol. 314, pp. 141–183, 2022.
- IBM Quantum, "IBM Quantum System One and Heron processor specifications," IBM Quantum Documentation, 2024. Available: https://quantum.ibm.com/ [Accessed January 2026].