OSIRIS Physical QPU Validation Campaign Deliverable (v1.0) This deposition contains the complete empirical evidence, raw shot count dictionaries, instruction-set architecture (ISA) compiled circuits, physical schedule audits, analysis scripts, publication figures, and LaTeX manuscript for the OSIRIS Staggered Dynamical Decoupling (STAG_XY8) Validation Campaign executed on ibm_marrakesh, a 156-qubit IBM Quantum Heron r2 processor. Across four independent hardware acquisition jobs comprising 648 ISA circuits, 663,552 physical shots, and 192 seconds of real QPU compute, this campaign provides rigorous hardware validation of staggered dynamical decoupling in preserving two-qubit Bell state entanglement (|Φ+> = (|00> + |11>)/√2) against multi-qubit crosstalk and environmental dephasing. Definitive Scientific & Hardware Findings: Resolution of Historical Pulse Omission: Byte-level forensic audit of historical job dblr6lhkbkrc73co9h30 proved that prior 'YY suppression' claims arose because unspaced consecutive pulses collapsed algebraically during transpilation, executing zero physical DD pulses. All present circuits enforce calibrated 4.0 ns dt physical scheduling with explicit delay instructions. Massive Entanglement Protection over Bare Idle: Across all seven heavy-hex coupling edges, dynamical decoupling dramatically outperforms natural decoherence. Under 4.0 μs evolution on Edge (14, 15), Bell state coherence collapsed to ⟨XX⟩ = +0.5059 under IDLE, whereas STAG_XY8 preserved ⟨XX⟩ = +0.9419 ± 0.0104 (Fidelity F = 0.9492), an entanglement advantage of +0.4360. Statistically Significant Preservation Gain on Edge (14, 15): Across 10 independent paired hardware acquisition blocks, STAG_XY8 achieved a statistically significant correlation preservation gain over standard synchronous decoupling (SYNC_XY8): Δ⟨XX⟩ = +0.0186, with a 95% bootstrap confidence interval of [+0.0107, +0.0250] strictly excluding zero (p < 0.0001, 100% probability of superiority). Rigorous Non-Inferiority Verification Across 42 Paired Observations: Synthesizing all 42 paired hardware observations across all 7 physical edges, STAG_XY8 demonstrated strict statistical non-inferiority to standard synchronous decoupling (p = 0.00000 against a prespecified margin δ = -0.0200), achieving an overall mean Δ⟨XX⟩ = +0.0051 ± 0.0298 and an 86.0% global probability of superiority. Coupler-Dependent Stagger Landscape (Experiment C): An 8-offset sweep (Δ ∈ [0, 800] ns under 8.0 μs evolution) demonstrated that staggering does not rely on a singular delta-function resonance at 160 ns, but operates across an optimal physical protective band between 80 ns and 240 ns. SYS-021 Governed Execution: Every operational dispatch was authorized via immutable Ed25519 payload-bound grants signed by operator Devin Phillip Davis / Enki, anchored in a 5-block cryptographic ledger (evidence_ledger.db) and a 20-entry write-ahead hash ledger (ledger.jsonl). The deposition package includes the standalone LaTeX paper (OSIRIS_QPU_STAG_XY8_VALIDATION.tex), publication-ready vector figures, raw count dictionaries for all 648 circuits, compiled QPY binaries, and reproducible analysis evaluation code.
Zero-Trust Quantum Benchmarking: Cryptographic Pre-Registration via the OSIRIS Write-Ahead Ledger Author: Devin Phillip Davis Affiliation: OSIRIS Architecture Group Date: September 2026 DOI Reference: 10.5281/zenodo.23045494 Abstract As quantum hardware scales toward practical fault tolerance, the empirical validation of quantum advantage claims faces a systemic replication crisis. Traditional benchmarking methodology relies heavily on post-hoc error mitigation, unverified post-selection, and opaque calibration timing. We present Zero-Trust Quantum Benchmarking, a methodological paradigm and open protocol that eliminates retrospective bias by enforcing immutable, pre-execution cryptographic commitments. Using the OSIRIS Continuous Relativistic State Matrix (CRSM) framework, transpiled quantum circuit manifests and hypothesis thresholds are hashed (
SHA-256) into an append-only write-ahead ledger prior to dispatch to physical Quantum Processing Units (QPUs). We validate this protocol through empirical execution on IBM Quantum's 156-qubit Heron r2 hardware (ibm_marrakesh, Job ID: dau0q3qhcrkc73durtgg). The pre-registered manifest bound a novel bipartite-staggered dynamical decoupling sequence (xy8_stag) targeting residual
ZZ-crosstalk. On an 8-qubit chain, the pre-registered trial achieved a mean survival probability
P(+)=0.8998 at
T=32 μs, representing a +30.5% gain over bare idle (
P(+)=0.5945) and a +6.5% gain over standard simultaneous dynamical decoupling (
P(+)=0.8342), satisfying all pre-registered non-overlapping 95% bootstrap confidence intervals without post-hoc fitting. I. Introduction & The Crisis of Provenance Quantum computing research currently lacks an end-to-end chain of custody for experimental data. Due to environmental noise fluctuation, thermal drift, and cross-talk, QPU performance changes dynamically on time scales ranging from minutes to hours. This instability introduces three major vulnerabilities into published quantum benchmarks: Calibration Arbitrage: Experiments executed across hundreds of QPU calls can selectively showcase runs coinciding with transient calibration peaks while silently discarding noisy trials. Post-Hoc Hypothesis Modification: Error mitigation models and threshold parameters are frequently tuned after observing raw state-vector outputs, confusing exploratory curve fitting with confirmatory validation. Data Loss & Black-Box Execution: Published results rarely preserve transpiled machine-level pulse schedules alongside raw hardware counts and system calibration logs, rendering independent third-party replication practically impossible. To establish verifiable quantum advantage, the field requires a shift to Zero-Trust Quantum Benchmarking, wherein hardware execution permissions are contingent upon prior, tamper-evident pre-registration of experimental intent. II. The OSIRIS Write-Ahead Ledger Protocol The OSIRIS framework enforces experimental integrity via a write-ahead append-only ledger architecture integrated directly into the CI/CD pipeline and QPU submission harness. ┌─────────────────────────────────────────────────────────────────────────┐ │ OSIRIS PRE-REGISTRATION PIPELINE │ └─────────────────────────────────────────────────────────────────────────┘ │ 1. Circuit Synthesis ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Transpile Target Topology & Gate Schedule │ └─────────────────────────────────────────────────────────────────────┘ │ 2. Manifest Hashing ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Hash (Transpiled Circuit + Hypotheses + Metrics) -> SHA-256 │ └─────────────────────────────────────────────────────────────────────┘ │ 3. Ledger Write Ahead ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Append Hash to Write-Ahead Ledger (ledger.jsonl) & Update Head │ └─────────────────────────────────────────────────────────────────────┘ │ 4. QPU Job Submission ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Dispatch to Hardware (IBM Heron r2: ibm_marrakesh) │ └─────────────────────────────────────────────────────────────────────┘ │ 5. Verification & Audit ▼ ┌─────────────────────────────────────────────────────────────────────┐ │ Bind Raw QPU Counts to Ledger Entry and Publish Artifact Package │ └─────────────────────────────────────────────────────────────────────┘ A. Manifest Schema A Pre-registration Manifest (
M) is defined as an immutable JSON document containing: Circuit State: Unrolled OpenQASM 3.0 / Qiskit compiled instructions, physical qubit mappings, and pulse duration definitions. Target Environment: Target backend identifier, scheduled execution window, and expected calibration parameters. Pre-declared Hypotheses: Exact quantitative thresholds (e.g., minimum target fidelity gain
ΔFtarget) and statistical evaluation functions (e.g., 95% bootstrap CI parameters). The manifest vector is serialized into a canonical UTF-8 byte stream and hashed using
SHA-256:
HM=SHA-256(Canonicalize(M)) B. Append-Only Ledger Chaining Each entry
i in the OSIRIS ledger (
Li) contains the hash of the current manifest
HM,i, a UTC timestamp
ti, the state of the preceding block head
HL,i−1, and execution metadata:
HL,i=SHA-256(HL,i−1∥HM,i∥ti) This cryptographic chaining guarantees that modifying, deleting, or reordering any pre-registration attempt breaks the ledger head hash
HL,head, preventing silent trial deletion. III. Structural Comparison FeatureTraditional Quantum BenchmarkingOSIRIS Zero-Trust Benchmarking Execution TriggerAd-hoc script / manual notebook executionAutomated, deterministic CI/CD pipeline lock Circuit CommitmentMalleable, often post-processedImmutable pre-registered SHA-256 manifest hash Noisy Trial PolicyDiscarded or filtered unrecordedAppended permanently to immutable audit trail Verification BasisTrust in institutional reputationCryptographic verification (
HM↔JobID↔Counts) Fitting IntegrityPost-hoc curve fitting allowedPre-declared quantitative pass/fail thresholds IV. Empirical Hardware Validation: IBM Heron r2 (ibm_marrakesh) To validate the Zero-Trust protocol under production conditions, we pre-registered and executed a quantum control experiment on IBM Quantum's 156-qubit Heron r2 processor (ibm_marrakesh). A. Experimental Setup & Cryptographic Provenance Job ID: dau0q3qhcrkc73durtgg Target Backend: ibm_marrakesh (Heron r2, 156 Qubits) Execution Date: 2026-09-29 19:10:20 UTC QPU Execution Duration: 5.0 seconds Calibration Hash: 63f10bd484207c5044237b4115a46a0d29856036c923a2cde165baed57d15c9c Pre-registration Manifest SHA-256: 2d4c19a4a53301a1ac42459acd8b5b0d8cba0d588fa2523ed0994e5e1612d2f9 Ledger Head Hash: 6d7fd1390c1bab25b52f3e5e07be893aaa7194d8e3bd81db8466085da6e38d37 B. Dynamical Decoupling Physics: Bipartite Staggering Static and residual dynamic
ZZ-crosstalk on heavy-hex hardware topologies remains a primary source of decoherence during multi-qubit idle periods. Standard textbook dynamical decoupling applies simultaneous
π-pulses (e.g., CPMG, XY4) across all active qubits. However, simultaneous pulse execution on neighboring qubits induces pulse-collision errors and driven cross-resonance noise. OSIRIS introduces Bipartite-Staggered Dynamical Decoupling (xy4x2_stag, xy8_stag). The 8-qubit linear chain
[1,2,3,4,5,6,7,8] is partitioned into two disjoint sublattices:
SA={1,3,5,7},SB={2,4,6,8} π-pulse schedules are temporal phase-shifted between
SA and
SB, ensuring that no two adjacent qubits undergo simultaneous rotations, canceling crosstalk while preserving coherence. Sublattice A (Q1, Q3, Q5, Q7): ──[ X ]──────────────[ Y ]──────────────[ X ]── Sublattice B (Q2, Q4, Q6, Q8): ──────────[ X ]──────────────[ Y ]────────────── τ_stag τ_stag τ_stag τ_stag C. Empirical Results The experimental trial evaluated coherence retention across four conditions at time delays
T=16.0 μs and
T=32.0 μs. Effective loss rate
Γ was derived using
Γ=−T1lnP(+). Hardware Execution Summary Table ConditionT (µs)Mean Survival P(+)95% Bootstrap CIEffective Loss Rate Γ (µs⁻¹) none (Idle)16.00.6382[0.6313, 0.6450]0.0280 none (Idle)32.00.5945[0.5942, 0.5947]0.0162 cpmg816.00.9139[0.9075, 0.9204]0.0056 cpmg832.00.8344[0.8289, 0.8398]0.0056 xy4x2 (Simultaneous)16.00.9135[0.9097, 0.9172]0.0056 xy4x2 (Simultaneous)32.00.8342[0.8291, 0.8394]0.0056 xy4x2_stag (OSIRIS)16.00.9313[0.9307, 0.9319]0.0044 xy4x2_stag (OSIRIS)32.00.8997[0.8945, 0.9048]0.0033 xy8_stag (OSIRIS)16.00.9318[0.9309, 0.9326]0.0044 xy8_stag (OSIRIS)32.00.8998[0.8982, 0.9014]0.0033 SURVIVAL PROBABILITY AT T = 32 µs 1.00 ┌──────────────────────────────────────────────────────────────────┐ │ █████████ █████████ │ 0.80 │ █████████ █████████ ██ xy4x2 │ │ xy8 │ │ │ │ cpmg8 │ │ xy4x2 │ │ _stag │ │ _stag │ │ 0.60 │ █
This paper presents the experimental validation and execution of the EIEZ Language (Version 3) on real physical quantum hardware. Deployed across IBM Quantum processors (ibm_fez, ibm_marrakesh, and ibm_torino, featuring 133 to 156 physical qubits), the EIEZ v3 framework introduces hybrid compilation targeting OpenQASM 2.0 and OpenQASM 3.0, adaptive classical control flow (while, repeat-until with rich CondExpr logic), and hardware topology validation (EIEZTopologyError). The test series evaluated 2- and 3-qubit entanglement circuits (Bell State, GHZ State), quantum algorithms (Deutsch), and depth-scaling tests (
H×1 to
H×10), executed with up to 4,096 shots per job. Key Results: Full Compilation Compatibility: Seamless execution flow from EIEZ source code to OpenQASM and IBM Quantum hardware. High Entanglement Fidelity: Average fidelity of ~95% across Bell State, GHZ, and Deutsch algorithm executions on physical QPUs. Critical Decoherence Point: Empirical observation of quantum interference breakdown at depth
H×3 (~50% deviation from the ideal EIEZ simulator), providing physical evidence of criticality and confirming the applicability of the EIE/ZIE adaptive control framework (Patent BR 10 2025 024459 4). Transpiler Depth Recovery: Fidelity restoration to ~99.7% at depth
H×10 driven by internal sequence optimization in Qiskit transpilation. Open FAIR Dataset: Release of machine-readable raw measurement counts (JSON/CSV), UTC timestamps, and IBM Job IDs for open verification. Links & Resources: IBM Quantum Cloud Platform: https://quantum.cloud.ibm.com/ Raw Execution Counts (JSON / CSV): https://github.com/joemerson/eiez-lang/blob/main/eiez-lang/Teste_rodados_IBM_/JSON.json Local Simulation Notebooks (Zenodo): https://doi.org/10.5281/zenodo.19078764 EIEZ Compiler Source Code (GitHub): https://github.com/joemerson/eiez-lang Complete EIE/ZIE Theory & Framework (Zenodo): https://doi.org/10.5281/zenodo.19005280 Zenodo DOI: https://doi.org/10.5281/zenodo.19078829
OSIRIS-HP-001 Preregistration Protocol v1.0 This protocol establishes a formal, pre-registered, and falsifiable quantum information recovery benchmark based on the Hayden-Preskill thought experiment (Hayden & Preskill 2007; Yoshida & Kitaev 2017). Designed for execution on IBM Quantum Heron r2 processors (ibm_marrakesh) following deterministic Stage 1 CPU simulation. Core Thesis: Investigates whether an unknown quantum state can be reconstructed by a restricted-access decoder operating strictly on early radiation and newly emitted late radiation after scrambling across an entangled register, and quantifies recovery degradation under calibrated physical noise. Three Controlled Experimental Arms: Arm A (Identity Recovery Control): Full-access reversible control establishing the SPAM ceiling and hardware noise baseline (unit fidelity prediction). Arm B (Restricted-Access Recovery): Message entangled with reference R; black hole B entangled with early radiation E. Scrambler U acts on M + B. Remnant C and Reference R are strictly quarantined. Decoder V_ED operates exclusively on E + D, outputting decoded message M'. Evaluates entanglement fidelity F_rec = <Phi+| rho_RM' |Phi+> reconstructed via XX, YY, and ZZ tomography. Arm C (Noise Degradation Sweep): Calibrated physical noise sweep (depolarizing, dephasing, relaxation) evaluating recovery resilience. Formal Pre-Registered Hypotheses: H1 (Reversible Control): Full-access inverse achieves F >= 0.999 in noiseless simulation. H2 (Restricted Recovery): Decoder on E + D achieves F_rec > 0.50 (quantum entanglement witness) with >10 pp advantage over unentangled controls. H3 (Page Transition): Monotonic fidelity scaling as late radiation size crosses the Page threshold (kD = 1 < kD = 2 < kD = 3 = 1.0). H4 (Noise Sensitivity): Monotonic degradation under physical noise channels. Stage 1 CPU simulation passed all acceptance criteria across N = 20 Haar-random trials (Arm B F = 0.9097 vs. unentangled control F = 0.7223, advantage +18.74 pp, p = 9.05e-12).
Abstract This paper reports the first end-to-end fault-tolerant quantum computing stack to clear all four strict-FTQC requirements simultaneously on commodity superconducting NISQ silicon, rented through standard IBM Quantum cloud subscription with no purpose-built research machine, no custom decoder, and no magic-state distillation factory. The four requirements: (i) surface-code quantum error correction at distance d≥3 with logical-error rate below the unencoded baseline; (ii) a universal Clifford+T gate set executed via magic-state injection, with no arbitrary angle physical rotation carrying non-Clifford content on the wire (the algorithm-determined non-Clifford angle never fires on the silicon; the native RZ(θphys) on Heron fires only at Clifford-multiple angles required to compose H, S, T); (iii) heterogeneous primitive composition (teleportation, lattice-surgery CNOT, T-gate, logical memory) on a persistent encoded register; and (iv) runtime admissibility verification on every committed result. All five chips, five chemistry workloads spanning four molecules, and twenty-two governed runs in this paper were executed on the same primitive engine without architectural change. The architectural shift that makes this work on today’s hardware is the d=1 inversion: a 150-qubit governed encoded register held at substrate distance d=1 on the chip’s physical qubits, with logical fidelity preserved by Seed IQ execution governance over the encoded layer rather than by a larger code distance. Where the standard surface-code paradigm grows physical d quadratically to drive the logical-error rate down—and pays for it with magic-state fidelity that degrades as gate depth scales—Seed IQ governance acts as an operational substitute for code distance: it delivers the equivalent error-rate reduction in software while leaving the per-gate channel fidelity available for T-gate injection and Clifford operations intact. The result: the four strict-FTQC requirements hold simultaneously at approximately one physical qubit per logical qubit, against the ∼ 625 physical qubits per logical qubit required by the IBM 2029 roadmap target of d=25 surface code at comparable logical fidelity. Seed IQ is an Active Inference and Adaptive Multiagent Autonomous Control (AMAC) platform from AIX Global Innovations. Campaign summary. Eight stages, April through June 2026, across five IBM Heron processors (r2: IBM Fez, IBM Kingston, IBM Marrakesh, IBM Pittsburgh; r3: IBM Boston). April 9 — surface-code QEC: −88.5% LER reduction at d=3 on IBM Fez, −93.1% at d=5 where the MWPM+UF baseline collapsed, −60.9% at d=3 on 1.28°ø dirtier IBM Pittsburgh silicon. April 23–25 — all four universal FTQC primitives cleared the classical 2/3 entanglement bound at F≈0.99. April 25–26 — heterogeneous TELE→CNOT→T→CNOT→TELE°ø2 composition: 22,500 circuits at Fgoverned=1.0000, zero detected logical errors. May 7–9 — H2, 10 runs across 3 chips, 10/10 inside chem-acc, best ΔE=+0.0157mHa, two chips bit-identical to twelve decimals. May 23 —LiH, 3 runs across 3 chips, 3/3 inside chem-acc, two chips tied at ΔE=+0.056mHa. May 28–30 — H2O, 3 runs across 3 chips, 3/3 inside chem-acc at ΔE=+0.051mHa, all three bit-identical to twelve decimals. May 30–31 — BeH2 equilibrium, 3 runs across 2 chips, 3/3 inside chem-acc at ΔE=+0.000595mHa (2690.9°ø inside, the only sub-wavenumber QPU chemistry commit on record), all three bit-identical to twelve decimals. June 1 — BeH2 transition state (|cHF |2≈0.5 strong multireference, the canonical territory where single-reference CCSD breaks), 3 runs across two Heron processor generations at two Newton optimization depths on the rank-5 C2v trial-state subspace, 3/3 inside chem-acc on a 62-Pauli-term Hamiltonian; the two 2-D Newton runs (IBM Boston Heron r3, IBM Kingston Heron r2) commit bit-identical to twelve decimals at ΔE=+0.018189mHa, and the 4-D Newton run commits at the deeper fixed point at ΔE=+0.012643mHa (126.6°ø inside chem-acc, 1.6°ø inside the CCSD(T) gold band). Aggregate: twenty-two runs, 22/22 inside chemical accuracy. No prior NISQ-chemistry or partial-FTQC-chemistry result on commodity hardware has cleared this combination of accuracy and cross-chip reproducibility. Full per-stage detail in Åò4–Åò12.8. Compliance. All twenty-two committed chemistry runs and every primitive composition stage passed the four-requirement FTQC compliance check: closed Clifford+T compilation, magicstate-injected T-gates, encoded-register fidelity preservation, runtime admissibility verification. Fgoverned=1.0000 is the runtime admissibility pass-rate—every committed primitive cleared every admissibility check across the composition pipeline (22,500 composed circuits per run, replicated across two independent calibration windows for 45,000 circuits total) and the twenty-two chemistry runs, with zero detected logical errors, computed from per-shot stabilizer-syndrome statistics, entanglement-witness measurements, and the three-stage admissibility check under live IBM Heron hardware noise (Åò7, Åò13.13). The twelve-decimal cross-chip identity is the engineered signature of Seed IQ’s admissibility-and-projection contract: the three-stage envelope is designed so that noisy QPU measurement vectors from materially different chips identify the same Newton fixed point on the trial-state subspace; the committed energy is then the Hamiltonian sum E=Pi ci⟨Pi⟩ at that shared fixed point evaluated directly from each chip’s own QPU shot record by direct bitstring counting at the continuous coordinate—no binning, no precomputed energy curve, no offline lookup. IEEE 754 doubles are just the number format the energies are reported in; what makes the twelve decimal places physically meaningful is that materially different chips, with materially different noise, agree at all twelve. That agreement is the operational evidence the envelope is delivering what it was engineered to: an admissibility-and-projection contract that maps independent noisy QPU measurement vectors to the same fixed point on the trial-state subspace (Åò13.10, Åò14).
We present an analysis of quantum circuit fidelity across the full compilation stack, from high-level gate optimization through pulse-level control. We connect a C++ circuit optimizer to a per-gate Lindblad master-equation fidelity model whose decoherence channels are cross-validated against qiskit-dynamics and whose absolute predictions are benchmarked against execution on real hardware. Across a campaign of 4,452 experiment runs over 371 benchmark circuits, gate cancellation provides the dominant improvement (
d=1.66, 72% of circuits improved), while circuit size and pulse duration are the strongest negative predictors of process fidelity (input gates
r=−0.78; pulse duration
r=−0.73,
R2=0.53). A formal ablation study shows that pass ordering has no significant effect on two-qubit gate reduction (Kruskal--Wallis
p=0.302). Comparing against Qiskit transpilation levels, we show that two-qubit gate count, not total gate count, is the hardware-relevant metric: our optimizer attains superior two-qubit reduction on structured circuits (87.8% on QFT, 100% on QAOA) whereas Qiskit's larger total-gate reduction is dominated by single-qubit (
u3) consolidation. Finally, executing eight circuits on the IQM Resonance Garnet processor (8/8 jobs completed, job identifiers released) reveals that the model is a consistent upper bound: it preserves the relative difficulty ordering of circuits but overestimates absolute fidelity by a mean of 0.49, quantifying the error budget (crosstalk, leakage, readout) outside a
T1/
T2/depolarizing model. We release the framework, data, and scripts as open source.