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

A Bounded Quantum Integration Capability for OpenPRA: Validated Preparation, Recovery, and User-Facing Workflows on Reactor-Scale Fault Trees

Peters Devin

Published Apr 22, 2026• 0 citations
Publisher

Abstract

This paper presents a bounded quantum integration capability for the OpenPRA probabilistic risk assessment (PRA) monorepo, validated across a seven-workstream project covering preparation, recovery, broader cohort validation, bounded importance measures, execution reporting, and user-facing workflows. Building on a prior three-case recovery migration case study [1], this paper extends the evidence base to a 34-case validated baseline spanning topology classes A, C, and D, supported by 120-case reference artifact validation and 120-case statevector verification. The preparation and recovery services are demonstrated through direct REST endpoint evidence on real baseline-derived cases. Bounded importance and execution reporting pass explicit acceptance criteria through 10 automated checks including 7 Jest test suites. A user-facing quantum readiness review page renders populated recovery data including primary recovery mode, per-tier recovery counts, and boundedness statements through six backend endpoints, all returning HTTP 200 with populated payloads. All seven project workstreams are closed with documented acceptance gates, holdout adjudication, and exception disposition. The integration is explicitly bounded: it does not claim quantum advantage, production readiness, or live hardware execution from the web interface. The contribution is a validated, auditable integration framework demonstrating how quantum-identified fault tree MCS recovery results can be surfaced through a structured PRA platform while preserving semantic parity with prior validated outcomes and enforcing boundedness constraints throughout the user-facing stack.

DOI
10.5281/zenodo.19674063

Related papers

Bounded Quantum Execution and Structural Scaling Limits in Quantum Encodings of OpenPRA Fault Tree Analysis

Devin Peters

This study presents a bounded, auditable quantum execution framework for probabilistic risk assessment (PRA) using OpenPRA-derived fault tree encodings and provides the first platform-integrated empirical characterization of structural scaling limits within the OpenPRA quantum execution workflow. A tri-provider architecture integrating local structural validation, IBM gate-based quantum hardware, and a D-Wave-ready interface is applied to 132 constraint-level QUBO (CL-QUBO) export artifacts retained from the OpenPRA quantum-feasible candidate pool. A systematic scaling gap analysis reveals that all 132 cases occupy exactly two qubit levels—5 qubits (23 cases, 17.4%) and 8 qubits (109 cases, 82.6%)—with zero semantically valid same-root expansions beyond 8 qubits. IBM Quantum hardware validation on ibm_marrakesh confirms bounded MCS recovery at both qubit levels, including exact hardware recovery (3/3 reference MCS) at 5 qubits and partial recovery (3/4 reference MCS) at 8 qubits, with job-level provenance for every execution. A hybrid filtering framework generates 4,692 synthetic cross-root expansion candidates, of which zero preserve semantic PRA validity; 14 selected 16-qubit candidates are validated through a deterministic structural execution validator, and three are executed on IBM hardware as stress tests (156 physical qubits after transpilation, 205–220 unique bitstrings observed per job). These results establish strong evidence that the observed 8-qubit ceiling is a property of the current CL-QUBO export pipeline applied to real reactor-scale fault trees, that scaling beyond this ceiling requires structural decomposition or alternative execution paradigms, and that the integrated OpenPRA quantum platform can execute, validate, and bundle evidence across the full pipeline with auditable provenance. No claim of quantum advantage or production PRA quantification is made.

•Apr 30, 2026•0 citations

A Package-Based Quantum Recovery Workflow for OpenPRA: Executed-Only Validation on Three Reactor-Scale Fault Tree Subtree Cases

Devin Peters

This paper presents a migration case study: moving quantum-identified minimal cut set (MCS) recovery processing from ad hoc research scripts into a structured package within the OpenPRA monorepo, and validating the migration on an executed-only cohort of three reactor-scale fault tree subtrees from a Generic Pressurized Water Reactor model. Two of the three validated cases (0698, 1037) share the same structural subtree (root gate G:G348, topology Class A, 5 basic events) and achieved tier 1 exact hardware recovery (3/3 reference MCS each). The third case (0905, topology Class C, 8 basic events) achieved union sensitivity recovery (tier 1: 3/4, union: 4/4) with operator attention required. The package-based workflow achieved semantic parity with the accepted legacy script-era artifacts on all three cases, preserving recovery outcomes and recommendations while producing a cleaner package-native output format. The paper defines and defends semantic parity as the appropriate migration criterion for this workflow, establishes a traceable artifact acceptance chain, and demonstrates that executed-only filtering is necessary for a defensible validation cohort in this mixed-evidence batch to prevent conflating validated recovery evidence with unevidenced diagnostic candidates. Because the cohort comprises only two unique structural configurations, the findings are limited to migration correctness on a narrow validated set rather than broad workflow robustness. This paper does not claim quantum advantage or deployment readiness.

•Apr 13, 2026•0 citations

Quantum PRA Feasibility Roadmap: Topology-Aware Threshold Behavior, Scaling Requirements, and Public Hardware Compatibility Screening for CL-QUBO Fault Tree Optimization

Devin Peters

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.

•Mar 25, 2026•0 citations

Quantum-Identified Minimal Cut Sets for Quantitative PRA: Importance Measures and Risk Metric Validation Against Classical Baselines for Reactor-Scale Fault Tree Subtrees

Devin Peters

This paper presents the first end-to-end evaluation of whether quantum-identified minimal cut sets (MCS) from physical IBM Quantum hardware can preserve standard probabilistic risk assessment (PRA) importance measures when compared against frozen SCRAM-validated classical baselines. It consumes frozen CL-QUBO hardware outputs from Paper 10 and propagates recovered MCS through two defensible probability-assignment tracks: a primary direct-component track based on NUREG/CR-6928 original component unreliability data and a secondary CCF extension track based on the 2020 NRC/INL common cause failure update using alpha factor methodology. Of 21 selected representative subtrees, 16 are promoted into the formal quantitative analysis set (10 primary, 6 extension), while five additional subtrees remain executed but quarantined in exploratory holdout lanes. Exact MCS recovery remains incomplete across both tracks. At the shared controlled operating point (ibm_marrakesh RL1 top-k = 10), the primary track achieves mean recovery fraction 0.225 with mean top-event absolute error 4.52 × 10⁻⁷, while the extension track achieves mean recovery fraction 0.292 with mean RAW Spearman 0.488, Birnbaum Spearman 0.438, FV Spearman 0.236, and mean top-event absolute error 7.50 × 10⁻⁷. Across the promoted set, tighter extraction windows generally outperform wider windows, set Jaccard is more informative than simple recovery fraction for downstream utility within this study, and the extension-track advantage survives common-support restriction but remains conditional and metric-dependent. The resulting pipeline therefore shows measurable but limited PRA utility: enough for screening-level assessment of relative component significance under favorable conditions, but not enough for standalone regulatory-grade quantification.

•Mar 13, 2026•0 citations

End-to-End Validation of Quantum-Identified Minimal Cut Sets for Reactor PRA: Exact-MCS Enrichment and Importance-Measure Preservation Across 66 Subtrees on IBM Quantum Hardware

Devin Peters

Minimal cut set (MCS) identification is central to fault-tree-based probabilistic risk assessment (PRA), but quantum MCS methods have largely remained simulation-based or require Grover-style depths that are not executable on current hardware. This study reports an end-to-end IBM Quantum validation using shallow, fixed-parameter alternating-operator constraint-level QUBO (CL-QUBO) sampling circuits. The primary campaign executed 132 full-paired raw RL0 cells across 66 SCRAM-derived reactor fault-tree subtrees on two IBM devices, with 12 mapping-replicate controls held separate. Under an independently locked little-endian decoding convention, top-200 hardware outputs produced 2,596 exact-MCS state matches against 778 expected under a matched random-projection baseline, a 3.34× enrichment with 0.901 aggregate unique-MCS recovery. A 2,000-trial matched random-state null placed the all-campaign observed count outside the null distribution (empirical p < 5.0 × 10⁻⁴). Recovered cut sets preserved local PRA importance rankings with high fidelity, with mean Spearman correlations of 0.969 for Fussell-Vesely, 0.950 for Risk Reduction Worth, 0.934 for Birnbaum, and 0.920 for Risk Achievement Worth. A post-primary, pre-registered attribution ladder showed that removing the CL-QUBO cost phase collapsed the hardware result to the random/no-cost simulation scale (top-200 ratio 0.985), while the full p = 1 circuit remained at 3.34×. The results support cost-phase attribution for exact-MCS enrichment on current hardware, while making no claim of quantum advantage, plant-level risk quantification, or uniform behavior across all subtree classes.

•Jun 15, 2026•0 citations

QUBO-MCS Equivalence Framework: A Validation Methodology for Quantum Fault Tree Analysis

Devin Peters

This paper presents a formal validation framework establishing equivalence between Quadratic Unconstrained Binary Optimization (QUBO) formulations and classical minimal cut set (MCS) identification for fault tree analysis in probabilistic risk assessment. The framework develops a 21-gate hierarchical verification system that proves QUBO ground states correspond exactly to minimal cut sets computed by the SCRAM fault tree solver. The validation methodology employs exhaustive enumeration for tractable models and conservative spot checks for larger instances, achieving PASS status across all verification gates. The theoretical contribution formalizes MCS identification as a constrained Boolean satisfiability problem amenable to quantum optimization. Fault trees with OR-of-ANDs structure are encoded into QUBO form with penalty terms enforcing logic constraints. The encoding preserves semantic equivalence: valid QUBO ground states map bijectively to classical minimal cut sets. Empirical validation demonstrates the framework on a canonical test case (TOP = A ∨ B ∨ (C ∧ D)) using QAOA simulation with plateau-based convergence methodology. The quantum circuit correctly identifies valid MCS configurations with p_opt = 0.01058 (95% CI: [0.00972, 0.01151]). Hardware feasibility is demonstrated through execution on IBM's ibm_torino 133-qubit Heron processor, where all circuits passed sanity and interpretation checks despite noise distributing probability across 110-120 unique states. The framework establishes foundational infrastructure for quantum PRA research by providing: (1) formal QUBO-MCS bijection verification against ground truth, (2) a reproducible classical baseline using the SCRAM solver, (3) plateau-based convergence criteria for stochastic quantum optimization, and (4) a hierarchical verification gate system ensuring scientific defensibility. No claim of quantum advantage is made; results are evaluated solely for semantic correctness, reproducibility, and NISQ feasibility.

•Jan 30, 2026•0 citations
This paper presents a bounded quantum integration capability for the OpenPRA probabilistic risk assessment (PRA) monorepo, validated across a seven-workstream project covering preparation, recovery, broader cohort validation, bounded importance measures, execution reporting, and user-facing workflows. Building on a prior three-case recovery migration case study [1], this paper extends the evidence base to a 34-case validated baseline spanning topology classes A, C, and D, supported by 120-case reference artifact validation and 120-case statevector verification. The preparation and recovery services are demonstrated through direct REST endpoint evidence on real baseline-derived cases. Bounded importance and execution reporting pass explicit acceptance criteria through 10 automated checks including 7 Jest test suites. A user-facing quantum readiness review page renders populated recovery data including primary recovery mode, per-tier recovery counts, and boundedness statements through six backend endpoints, all returning HTTP 200 with populated payloads. All seven project workstreams are closed with documented acceptance gates, holdout adjudication, and exception disposition. The integration is explicitly bounded: it does not claim quantum advantage, production readiness, or live hardware execution from the web interface. The contribution is a validated, auditable integration framework demonstrating how quantum-identified fault tree MCS recovery results can be surfaced through a structured PRA platform while preserving semantic parity with prior validated outcomes and enforcing boundedness constraints throughout the user-facing stack.
This study presents a bounded, auditable quantum execution framework for probabilistic risk assessment (PRA) using OpenPRA-derived fault tree encodings and provides the first platform-integrated empirical characterization of structural scaling limits within the OpenPRA quantum execution workflow. A tri-provider architecture integrating local structural validation, IBM gate-based quantum hardware, and a D-Wave-ready interface is applied to 132 constraint-level QUBO (CL-QUBO) export artifacts retained from the OpenPRA quantum-feasible candidate pool. A systematic scaling gap analysis reveals that all 132 cases occupy exactly two qubit levels—5 qubits (23 cases, 17.4%) and 8 qubits (109 cases, 82.6%)—with zero semantically valid same-root expansions beyond 8 qubits. IBM Quantum hardware validation on ibm_marrakesh confirms bounded MCS recovery at both qubit levels, including exact hardware recovery (3/3 reference MCS) at 5 qubits and partial recovery (3/4 reference MCS) at 8 qubits, with job-level provenance for every execution. A hybrid filtering framework generates 4,692 synthetic cross-root expansion candidates, of which zero preserve semantic PRA validity; 14 selected 16-qubit candidates are validated through a deterministic structural execution validator, and three are executed on IBM hardware as stress tests (156 physical qubits after transpilation, 205–220 unique bitstrings observed per job). These results establish strong evidence that the observed 8-qubit ceiling is a property of the current CL-QUBO export pipeline applied to real reactor-scale fault trees, that scaling beyond this ceiling requires structural decomposition or alternative execution paradigms, and that the integrated OpenPRA quantum platform can execute, validate, and bundle evidence across the full pipeline with auditable provenance. No claim of quantum advantage or production PRA quantification is made.
This paper presents a migration case study: moving quantum-identified minimal cut set (MCS) recovery processing from ad hoc research scripts into a structured package within the OpenPRA monorepo, and validating the migration on an executed-only cohort of three reactor-scale fault tree subtrees from a Generic Pressurized Water Reactor model. Two of the three validated cases (0698, 1037) share the same structural subtree (root gate G:G348, topology Class A, 5 basic events) and achieved tier 1 exact hardware recovery (3/3 reference MCS each). The third case (0905, topology Class C, 8 basic events) achieved union sensitivity recovery (tier 1: 3/4, union: 4/4) with operator attention required. The package-based workflow achieved semantic parity with the accepted legacy script-era artifacts on all three cases, preserving recovery outcomes and recommendations while producing a cleaner package-native output format. The paper defines and defends semantic parity as the appropriate migration criterion for this workflow, establishes a traceable artifact acceptance chain, and demonstrates that executed-only filtering is necessary for a defensible validation cohort in this mixed-evidence batch to prevent conflating validated recovery evidence with unevidenced diagnostic candidates. Because the cohort comprises only two unique structural configurations, the findings are limited to migration correctness on a narrow validated set rather than broad workflow robustness. This paper does not claim quantum advantage or deployment readiness.
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 the first end-to-end evaluation of whether quantum-identified minimal cut sets (MCS) from physical IBM Quantum hardware can preserve standard probabilistic risk assessment (PRA) importance measures when compared against frozen SCRAM-validated classical baselines. It consumes frozen CL-QUBO hardware outputs from Paper 10 and propagates recovered MCS through two defensible probability-assignment tracks: a primary direct-component track based on NUREG/CR-6928 original component unreliability data and a secondary CCF extension track based on the 2020 NRC/INL common cause failure update using alpha factor methodology. Of 21 selected representative subtrees, 16 are promoted into the formal quantitative analysis set (10 primary, 6 extension), while five additional subtrees remain executed but quarantined in exploratory holdout lanes. Exact MCS recovery remains incomplete across both tracks. At the shared controlled operating point (ibm_marrakesh RL1 top-k = 10), the primary track achieves mean recovery fraction 0.225 with mean top-event absolute error 4.52 × 10⁻⁷, while the extension track achieves mean recovery fraction 0.292 with mean RAW Spearman 0.488, Birnbaum Spearman 0.438, FV Spearman 0.236, and mean top-event absolute error 7.50 × 10⁻⁷. Across the promoted set, tighter extraction windows generally outperform wider windows, set Jaccard is more informative than simple recovery fraction for downstream utility within this study, and the extension-track advantage survives common-support restriction but remains conditional and metric-dependent. The resulting pipeline therefore shows measurable but limited PRA utility: enough for screening-level assessment of relative component significance under favorable conditions, but not enough for standalone regulatory-grade quantification.
Minimal cut set (MCS) identification is central to fault-tree-based probabilistic risk assessment (PRA), but quantum MCS methods have largely remained simulation-based or require Grover-style depths that are not executable on current hardware. This study reports an end-to-end IBM Quantum validation using shallow, fixed-parameter alternating-operator constraint-level QUBO (CL-QUBO) sampling circuits. The primary campaign executed 132 full-paired raw RL0 cells across 66 SCRAM-derived reactor fault-tree subtrees on two IBM devices, with 12 mapping-replicate controls held separate. Under an independently locked little-endian decoding convention, top-200 hardware outputs produced 2,596 exact-MCS state matches against 778 expected under a matched random-projection baseline, a 3.34× enrichment with 0.901 aggregate unique-MCS recovery. A 2,000-trial matched random-state null placed the all-campaign observed count outside the null distribution (empirical p < 5.0 × 10⁻⁴). Recovered cut sets preserved local PRA importance rankings with high fidelity, with mean Spearman correlations of 0.969 for Fussell-Vesely, 0.950 for Risk Reduction Worth, 0.934 for Birnbaum, and 0.920 for Risk Achievement Worth. A post-primary, pre-registered attribution ladder showed that removing the CL-QUBO cost phase collapsed the hardware result to the random/no-cost simulation scale (top-200 ratio 0.985), while the full p = 1 circuit remained at 3.34×. The results support cost-phase attribution for exact-MCS enrichment on current hardware, while making no claim of quantum advantage, plant-level risk quantification, or uniform behavior across all subtree classes.
This paper presents a formal validation framework establishing equivalence between Quadratic Unconstrained Binary Optimization (QUBO) formulations and classical minimal cut set (MCS) identification for fault tree analysis in probabilistic risk assessment. The framework develops a 21-gate hierarchical verification system that proves QUBO ground states correspond exactly to minimal cut sets computed by the SCRAM fault tree solver. The validation methodology employs exhaustive enumeration for tractable models and conservative spot checks for larger instances, achieving PASS status across all verification gates. The theoretical contribution formalizes MCS identification as a constrained Boolean satisfiability problem amenable to quantum optimization. Fault trees with OR-of-ANDs structure are encoded into QUBO form with penalty terms enforcing logic constraints. The encoding preserves semantic equivalence: valid QUBO ground states map bijectively to classical minimal cut sets. Empirical validation demonstrates the framework on a canonical test case (TOP = A ∨ B ∨ (C ∧ D)) using QAOA simulation with plateau-based convergence methodology. The quantum circuit correctly identifies valid MCS configurations with p_opt = 0.01058 (95% CI: [0.00972, 0.01151]). Hardware feasibility is demonstrated through execution on IBM's ibm_torino 133-qubit Heron processor, where all circuits passed sanity and interpretation checks despite noise distributing probability across 110-120 unique states. The framework establishes foundational infrastructure for quantum PRA research by providing: (1) formal QUBO-MCS bijection verification against ground truth, (2) a reproducible classical baseline using the SCRAM solver, (3) plateau-based convergence criteria for stochastic quantum optimization, and (4) a hierarchical verification gate system ensuring scientific defensibility. No claim of quantum advantage is made; results are evaluated solely for semantic correctness, reproducibility, and NISQ feasibility.