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

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ₚrob = 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.