This paper evaluates the compiled scaling behavior and multi-backend eligibility of constraint-level quadratic unconstrained binary optimization (CL-QUBO) fault tree circuits at target sizes from 25 to 100 basic events across three IBM proxy backends (FakeFez, FakeMarrakesh, and FakeTorino). The study extends the feasibility roadmap established through n = 20 basic events in prior work by generating, classifying, selecting, and compiling 94 fault tree instances across nine target sizes. Each compile row represents one (instance, backend, transpiler seed, QAOA depth) tuple that completed transpilation without error. The initial 270-instance generated pool produced only Class A (56) and Class D (214) topology instances, with Class B and Class C entirely absent and Class A missing at n = 75. A four-stage topology recovery program generated 2,124 additional instances through progressively targeted search strategies: balanced widening (v1, 288 instances), expanded parameter ranges (v2, 378 instances), OR-heavy restructuring (v3, 810 instances), and a final AND-heavy Class B closure sweep (v4, 648 instances). The OR-heavy v3 sweep recovered the first Class C instances (4) and several boundary Other cases (3), while the AND-heavy v4 sweep still produced only Class A (77) and Class D (571) with zero Class B. The merged selected cohort of 94 instances yielded 2,454 successful compile rows across the three backends. FakeFez and FakeMarrakesh each supported successful compilation for 70 of 94 selected instances, while FakeTorino supported 66 of 94. The compiled frontier exhibited a clean size-dependent pattern: full selected-instance success from n = 25 through n = 45, backend-specific failures emerging at n = 50 and n = 60, and complete compilation failure for all 23 selected instances at n = 75 and n = 100, where the CL-QUBO circuit qubit requirements exceeded the coupling map capacity of all three backends (133 qubits for FakeTorino, 156 for FakeFez and FakeMarrakesh). This paper does not claim quantum advantage.
This paper evaluates the compiled scaling behavior and multi-backend eligibility of constraint-level quadratic unconstrained binary optimization (CL-QUBO) fault tree circuits at target sizes from 25 to 100 basic events across three IBM proxy backends (FakeFez, FakeMarrakesh, and FakeTorino). The study extends the feasibility roadmap established through n = 20 basic events in prior work by generating, classifying, selecting, and compiling 94 fault tree instances across nine target sizes. Each compile row represents one (instance, backend, transpiler seed, QAOA depth) tuple that completed transpilation without error. The initial 270-instance generated pool produced only Class A (56) and Class D (214) topology instances, with Class B and Class C entirely absent and Class A missing at n = 75. A four-stage topology recovery program generated 2,124 additional instances through progressively targeted search strategies: balanced widening (v1, 288 instances), expanded parameter ranges (v2, 378 instances), OR-heavy restructuring (v3, 810 instances), and a final AND-heavy Class B closure sweep (v4, 648 instances). The OR-heavy v3 sweep recovered the first Class C instances (4) and several boundary Other cases (3), while the AND-heavy v4 sweep still produced only Class A (77) and Class D (571) with zero Class B. The merged selected cohort of 94 instances yielded 2,454 successful compile rows across the three backends. FakeFez and FakeMarrakesh each supported successful compilation for 70 of 94 selected instances, while FakeTorino supported 66 of 94. The compiled frontier exhibited a clean size-dependent pattern: full selected-instance success from n = 25 through n = 45, backend-specific failures emerging at n = 50 and n = 60, and complete compilation failure for all 23 selected instances at n = 75 and n = 100, where the CL-QUBO circuit qubit requirements exceeded the coupling map capacity of all three backends (133 qubits for FakeTorino, 156 for FakeFez and FakeMarrakesh). This paper does not claim quantum advantage.
This work evaluates Constraint-Level QUBO (CL-QUBO) circuit execution on IBM Quantum hardware for 34 reactor-scale fault tree subtrees spanning 5–8 basic events, selected from the 776-member quantum-feasible candidate pool established in Paper 9 (Peters, 2026). Circuits were constructed using the CL-QUBO encoding and QAOA Alternating Operator Ansatz at depth p = 1, transpiled to both ibm_torino (133 qubits) and ibm_marrakesh (156 qubits), and executed under three IBM Runtime Sampler configurations (RL0, RL1, RL2) with identical bound parameters (β = 0.2, γ = 0.2) across all resilience levels. A total of six hardware jobs consumed 476 seconds (7.93 minutes) of quantum runtime across 8,192 shots per circuit. The results demonstrate that at this circuit scale, 10–16 logical qubits transpiling to 78–150 two-qubit gates at depths of 165–338, hardware output distributions are overwhelmingly noise-dominated by standard distributional metrics. Neither RL1 nor RL2 produces improvement; RL1 actively degrades output quality relative to RL0 on both backends. However, direct comparison of hardware top-probability outcomes against SCRAM-validated prime implicants from Paper 9 reveals substantial above-random minimal cut set (MCS) enrichment relative to the uniform-random baseline in the n = 8 groups (6.2× and 3.8× expected random rate in the top-200 outcomes), demonstrating that CL-QUBO circuits produce detectable MCS-correlated structure even in distributions that appear noise-dominated by aggregate metrics. These findings characterize the current observed performance ceiling for this CL-QUBO configuration on the tested IBM backends and provide both distributional and MCS-correctness baselines against which future hardware improvements can be measured.
This paper presents a topology-aware feasibility roadmap for quantum probabilistic risk assessment (PRA) under bounded study conditions. The roadmap synthesizes three experimental phases applied to constraint-level quadratic unconstrained binary optimization (CL-QUBO) encodings of nuclear fault tree structures. Phase A establishes fidelity threshold behavior for the quantum approximate optimization algorithm with feasibility-preserving mixer (QAOA+) across four topology classes—Class A (anchored at n = 5), Class B (n = 6), Class C (n = 8, variant a), and Class D (n = 8, variant b)—derived from prior structural classification work. Phase B provides measured circuit-depth scaling evidence across target sizes from 5 to 20 basic events, including a deterministic constructor amendment that closes a previously missing Class B measured family. Phase C synthesizes measured and projected requirement rows into a 28-row requirements matrix spanning four topology classes and seven target sizes, with explicit evidence-tier marking distinguishing 19 measured rows from 9 projected rows. A public hardware capability screen maps the roadmap’s required-qubit count (equal to the number of basic events n in each encoded instance) against publicly reported qubit counts for Google Willow (105 qubits) [31], IBM Heron r2 (156 qubits) [32], IonQ Forte Enterprise (36 qubits) [33], and Quantinuum H2 (56 qubits) [34]; the required-qubit count does not exceed the published qubit counts for any mapped platform. A bounded C3 utility bridge links the roadmap outputs to local PRA importance-measure behavior across Fussell–Vesely, Risk Achievement Worth, and Birnbaum importance families, with interpretation restricted to the studied setting. The roadmap identifies topology class as the dominant differentiator of threshold and scaling behavior: Classes A and C are threshold-favorable under the tested conditions, while Classes B and D are threshold-unfavorable. Pooled treatment across topology classes would mask these real structural differences. This paper does not claim quantum advantage, does not include live IBM hardware execution, and does not make deployment readiness or commercialization forecasts.
This paper presents a reproducible, audit-ready quantum hardware experiment for minimal cut set (MCS) inference on reactor fault tree subtrees using IBM Quantum hardware. Eight two-qubit subtrees were selected from a Phase 2B reactor-scale fault tree corpus spanning four nuclear hazard families (EQK, LOCA, TRANS, SGTR). Classical baselines were computed with SCRAM 0.16.2, yielding two order-1 MCS per instance. Shallow p = 1 Quantum Alternating Operator Ansatz (QAOA+) circuits were constructed using the Constraint-Level QUBO (CL-QUBO) encoding from Peters (2026b), transpiled to ibm_torino, and executed as batch jobs totaling 57,344 shots across four experiments. Raw hardware results showed apparent infeasible leakage of 13.2% on the hw = 0 state. A dedicated four-circuit readout calibration protocol revealed that this leakage was almost entirely attributable to readout error: after confusion-matrix correction (κ = 1.56), the baseline experiment concentrates 98.3% of probability mass on the MCS manifold (hw = 1), with residual infeasible mass of 0.5%. Extension experiments substantially broaden the empirical foundation. Cross-pair validation on three additional qubit pairs (ibm_torino pairs 61–62 and 36–48; ibm_marrakesh pair 6–7) confirms that corrected MCS fidelity exceeds 95% across all tested physical qubit assignments (range 95.2%–98.3%), with the best pairs achieving 98.2% (ibm_marrakesh 6–7) and 97.9% (ibm_torino 61–62). A QAOA depth sweep (p ∈ {1, 2, 3}) on ibm_torino pair 0–1 quantifies noise–depth tradeoffs: because the mixer is inactive (β = 0), the observed redistribution from hw = 2 toward hw = 1 (7.8% at p = 1, 25.6% at p = 2, 40.9% at p = 3) is attributable to gate noise rather than productive mixing, with infeasible hw = 0 mass rising concurrently from 0.2% to 7.2%. A three-qubit exactly-one constraint experiment on ibm_torino triple 0–1–2 achieves 92.2% corrected hw = 1 mass from a feasible initialization, demonstrating that the CL-QUBO framework extends beyond two-qubit OR gates to richer constraint types on quantum hardware. Hard-start initialization experiments confirm that p = 1 circuits do not induce sufficient mixing to recover MCS states from non-minimal initializations, with this conclusion stable across independent replication and all tested qubit pairs. Complete experimental artifacts with SHA-256 verification are provided under the DOI above.
Quadratic Unconstrained Binary Optimization formulations for fault tree analysis encode gate logic through penalty terms, but prior work has demonstrated that these encodings fail to preserve fault tree semantics at scale: across 80 extended fault tree instances, only 7.5% of Rosenberg-based soft QUBO solutions match the constrained exact baseline, while 27.5% produce outright semantic violations. This paper develops two complementary methods to restore semantic correctness. A Hierarchical Semantic Validator and repair framework achieves 100% semantic validity across all 80 cohort instances through structure-aware bit-flip correction, improving the exact match rate from 7.5% to 28.75%. A constraint-level QUBO encoding eliminates penalty-based failures entirely by restricting optimization to the feasible subspace, reducing qubit requirements by a factor of 1.85x relative to Rosenberg encodings. Validation through Qiskit mixer circuits implementing a feasibility-preserving Quantum Alternating Operator Ansatz confirms zero probability leakage onto infeasible states for representative instances. These methods establish that semantic-preserving quantum optimization for fault tree minimal cut set identification is achievable with current algorithmic tools. Complete experimental artifacts with SHA-256 verification are provided under the DOI above.
This paper evaluates quantum recovery of minimal cut set (MCS) structure across eight IBM hardware runs spanning four runtime arms (A1–A4) and two backends (ibm_torino and ibm_marrakesh), using an independent raw-counts recomputation as the authoritative analysis layer. Each arm combines a resilience level (RL0, RL1, or RL2) with a dynamical decoupling (DD) setting (on or off), applied to CL-QUBO fault tree circuits encoding 8 reactor-scale pilot subtrees from a prior hardware study. Each run submitted 8 primitive unified blocs (pubs), one per subtree, at 8,192 shots each with bind parameters [0.2, 0.2]. The canonical analysis spans 64 pubs and 12,800 top-200 rows with zero unresolved issues. The principal finding is that the IBM hardware runs produced nonzero exact and nonzero superset MCS recovery. Across the study, mean top-200 exact hits were 16.6 per pub (range 10.4–22.6 across runs), mean exact MCS mass was 0.074, mean exact-or-superset mass was 0.820, and mean superset-nonexact mass was 0.746. Recovery is present but is not dominated by exact MCS outcomes: approximately 91% of the recovered exact-or-superset probability mass lies in superset-nonexact structure. ibm_torino showed descriptively stronger exact recovery (mean exact hits 20.8 versus 12.5 for ibm_marrakesh), while ibm_marrakesh showed descriptively stronger broad superset-heavy recovery (mean superset hits 146.4 versus 134.3 for ibm_torino). An earlier scorer-layer analysis yielded a zero-recovery interpretation; the independent raw-counts recomputation showed that this was an artifact of a contract mismatch and supersedes the earlier result. This paper does not claim quantum advantage.
Fault-tree analysis is a core component of probabilistic risk assessment (PRA), and quadratic unconstrained binary optimization (QUBO) provides a direct interface for evaluating fault-tree optimization problems on quantum annealers. A prior size-stratified study of an 80-instance fault-tree cohort observed sharp degradation in direct quantum-processing-unit (QPU) minimum-cardinality truth recovery as QUBO size increased, but the direct-QPU arms used a single anneal duration and did not isolate embedding, chain-strength, logical-variable relabelling, or chain-break explanations. This follow-on study prospectively pre-specified and SHA-256-locked a controlled robustness experiment on the same frozen penalty-QUBO cohort using D-Wave Advantage2 hardware. Eighty instances spanning 16, 25, 33, and 42 QUBO variables were evaluated across five forward-anneal durations and three deterministic fixed embeddings, with additional chain-strength controls on chained embeddings and four deterministic logical-variable relabelling diagnostics at 42 variables. The campaign completed 1,408 of 1,408 pre-specified conditions without execution or artifact failures and preserved 1,408,000 physical and 1,408,000 logical reads. Parameter selection affected recovery at smaller sizes: all 16- and 25-variable instances were truth-positive under at least one core condition. In contrast, only 18 of 20 33-variable instances and 3 of 20 42-variable instances were ever recovered across the fifteen anneal-time × embedding conditions, so 17 of 20 42-variable instances were never truth-positive. No tested anneal-time or chain-strength condition met the pre-specified material-rescue criterion, and four 42-variable relabelling diagnostics recovered zero instances. Only one of 1,408,000 logical reads exhibited a nonzero chain-break fraction, and that read was infeasible and not truth-positive. The results show size-dependent tuning leverage rather than parameter invariance: ordinary direct-QPU controls improve recovery within the smaller-size regime but do not materially rescue the large-size recovery frontier on this cohort and hardware epoch. Because the design fixes read count rather than QPU access time, anneal-duration comparisons are interpreted under equal read budgets rather than equal time. The study does not claim quantum advantage, universal formulation failure, full minimal-cut-set enumeration, or any time-to-solution or speedup result.