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

OSIRIS-HP-001: Hayden–Preskill Quantum Information Recovery Benchmark (Preregistration Protocol v1.0)

Devin Phillip Davis

Published Nov 5, 2026• 0 citations
Publisher

Abstract

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).

DOI
10.5281/zenodo.23982137

Related papers

Hayden-Preskill model via local quenches

Weibo Mao, Tadashi Takayanagi B

A bstract We model the Hayden-Preskill (HP) information recovery protocol in 2d CFTs via local joining quenches. Euclidean path integrals with slits prepare the HP subsystems: the message M , its reference N , the Page-time black hole B , the early radiation E , and the late radiation R ; the remaining black hole after emitting R is denoted as B ′ . The single-slit geometry provides an analytically tractable toy model, while the bounded-slit geometry more closely captures the HP setup. In the free Dirac fermion 2d CFT, the mutual information I ( N : B ′ ) shows quasi-particle dynamics with partial or full revivals, whereas that in holographic 2d CFTs, which are expected to be maximally chaotic, exhibits sharp transitions: in the bounded-slit case, when the size of the late radiation becomes comparable to that of the reference N , I ( N : B ′ ) vanishes at late time, otherwise it remains finite. This contrast between free CFTs and holographic CFTs gives a clear characterization of the HP recovery threshold.

arXiv:2510.05853•Journal of High Energy Physics•Mar 24, 2026•1 citation

Six Quantum Hardware Protocols Testing Boundary Signatures of the ER=EPR Conjecture on IBM Marrakesh

Horacio Sebastian Caceres

Six quantum circuit experiments performed on ibm_marrakesh (IBM Quantum, 156 qubits, Heron R2 architecture) are reported, designed to test boundary signatures of the ER=EPR conjecture within the AdS₂/JT gravity framework, with the Sachdev-Ye-Kitaev (SYK) model as the holographic dual of the black hole horizon. The experiments were executed iteratively: each result raised new questions that directly motivated the next protocol. In order of execution they implement: tripartite entanglement certification via the Mermin operator (|⟨M⟩| = 3.885); a traversable wormhole baseline using a Bell-pair thermofield double (F(g=π/2) = 1.000); black hole evaporation unitarity via the Hayden-Preskill protocol (F_rec = 0.9983, with the decoder reduced to zero two-qubit gates by the compiler); a corrected traversable wormhole using genuine SYK scrambling and exact Majorana coupling (F(g=0) = 0.020, F(g=π/2) = 0.953, GJW gain = 0.933); quantum chaos via out-of-time-order correlators (λ_L = 1.975 ± 0.294, 54.8% of the Maldacena-Shenker-Stanford bound); and black hole entropy under information absorption, where the hardware reproduces the entropy growth S(t) of SYK formation on top of a noise floor and the energy response to Alice’s input (correlation 0.998 with simulation), while the predicted area growth consistent with the Bekenstein law is obtained in simulation but is not resolved above noise on hardware. Total QPU time across all experiments: 7 minutes 2 seconds. Five of the six experiments reproduce the boundary predictions of the ER=EPR framework on hardware; the sixth reproduces them in simulation and only partially on hardware. Version 3 corrects Experiments 2 and 3 following the original laboratory reports. Exp. 2 reports the raw F(g=π/2) = 1.01 ± 0.01 instead of the clipped 1.000. In Exp. 3 the fused U†U circuit is identity by construction; its fidelity (0.9983) is reported as a noise-floor control, not as hardware recovery. The hardware scrambling result (F_scr = 0.530 vs. 0.532 in simulation) is kept; recovery is demonstrated in simulation. Experiments 2b, 5 and 6 are unchanged. Code and data: https://github.com/horca17/er-epr-six-protocols

•Jun 5, 2026•0 citations

Zero-Trust Quantum Benchmarking: Cryptographic Pre-Registration via the OSIRIS Write-Ahead Ledger

Devin Phillip Davis

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 ($\text{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\ \mu\text{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 ($\mathcal{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 $\Delta F_{\text{target}}$) 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 $\text{SHA-256}$: $$H_{\mathcal{M}} = \text{SHA-256}(\text{Canonicalize}(\mathcal{M}))$$ B. Append-Only Ledger Chaining Each entry $i$ in the OSIRIS ledger ($\mathcal{L}_i$) contains the hash of the current manifest $H_{\mathcal{M}, i}$, a UTC timestamp $t_i$, the state of the preceding block head $H_{\mathcal{L}, i-1}$, and execution metadata: $$H_{\mathcal{L}, i} = \text{SHA-256}(H_{\mathcal{L}, i-1} \mathbin{\Vert} H_{\mathcal{M}, i} \mathbin{\Vert} t_i)$$ This cryptographic chaining guarantees that modifying, deleting, or reordering any pre-registration attempt breaks the ledger head hash $H_{\mathcal{L}, \text{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 ($H_{\mathcal{M}} \leftrightarrow \text{JobID} \leftrightarrow \text{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 $\pi$-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: $$\mathcal{S}_A = \{1, 3, 5, 7\}, \quad \mathcal{S}_B = \{2, 4, 6, 8\}$$ $\pi$-pulse schedules are temporal phase-shifted between $\mathcal{S}_A$ and $\mathcal{S}_B$, 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\ \mu\text{s}$ and $T = 32.0\ \mu\text{s}$. Effective loss rate $\Gamma$ was derived using $\Gamma = -\frac{1}{T} \ln P(+)$. 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 │ █

•Sep 29, 2026•1 citation

Microscopic Side Information Controls Ordered Hayden--Preskill Recovery

Joao V. R. Alencar, Allan R. P. Moreira, Joao B. R. Silva

In the Hayden--Preskill protocol, the decoder is usually assumed to know the microscopic identity of the collected output qubits. We study what happens when these labels are unavailable and only the relative order of the received qubits is preserved. The resulting order-preserving deletion channel maps an $n$-qubit scrambled register to a subsequence of length $\ell$. For a diary of fixed size $k$, we prove that the optimal entanglement fidelity converges to the no-output value $4^{-k}$ when $\ell=o(n^{2/3})$, uniformly over the scrambling unitary. For a Haar-random scrambling unitary, it converges to one when $\ell=ω(n^{2/3})$ and $\ell=o(n)$. Monotonicity then gives the fixed-error recovery scale $\ell_{\mathrm{rec}}=Θ(n^{2/3})$. We also consider partial position information obtained by dividing the register into $B$ consecutive blocks and revealing the block of origin of each received qubit. The recovery scale becomes $\ell_{\mathrm{rec}}(n,B)\asymp n^{2/3}B^{-1/3}$ for $B\leq\sqrt n$ and $\ell_{\mathrm{rec}}(n,B)\asymp n/B$ for $B\geq\sqrt n$. The exponent $2/3$ is traced to rank-aligned coincidences between random subsequences, which control both the converse and the recovery argument. Thus, even purely classical information about the origin of the received subsystems can change the amount of quantum output required for Hayden--Preskill recovery.

quant-pharXiv:2607.15537•Jul 20, 2026•0 citations

Information retrieval from Hawking radiation in the non-isometric model of black hole interior: Theory and quantum simulation

Ran Li, Xuanhua Wang, Kun Zhang +1 more

The nonisometric holographic model of the black hole interior stands out as a potential resolution of the long-standing black hole information puzzle since it remedies the friction between the effective calculation and the microscopic description. In this study, combining the final-state projection model, the nonisometric model of black hole interior, and Hayden-Preskill thought experiment, we investigate the information recovery from decoding Hawking radiation and demonstrate the emergence of the Page time in this setup. We incorporate the effective modes into the scrambling inside the horizon, which are usually disregarded in Hayden-Preskill protocols, and show that the Page time can be identified as the transition of information transmission channels from the EPR projection to the local projections. This offers a new perspective on the Page time. We compute the decoupling condition under which retrieving information is feasible and show that this model computes the black hole entropy consistent with the quantum extremal surface calculation. Assuming the full knowledge of the dynamics of the black hole interior, we show how Yoshida-Kitaev decoding strategy can be employed in the modified Hayden-Preskill protocol. Furthermore, we perform experimental tests of both probabilistic and Grover’s search decoding strategies on the seven-qubit IBM quantum processors to validate our analytical findings and confirm the feasibility of retrieving information in the nonisometric model. This study would stimulate more interest to explore black hole information problem on the quantum processors. Published by the American Physical Society 2024

arXiv:2307.01454•Physical review. D/Physical review. D.•Feb 5, 2024•7 citations

The Sovereign Dual-Substrate Architecture: Governed Execution, Automated Falsification, and Quantum Hardware Control on Constrained Consumer Silicon

Devin Phillip Davis

OSIRIS v4.8.0 Monograph & Governed Release Package This release encapsulates the sovereign architecture, operational history, and empirical verification of the OSIRIS and dna::}{::lang project, featuring the complete prospective quantum control campaign on IBM Heron r2 hardware (ibm_marrakesh) and the resolution of the OSIRIS vs. Qiskit dynamical decoupling benchmark. Key Empirical & Architectural Additions in v4.8.0: Resolution of the OSIRIS vs. Qiskit Ideal Benchmark: Established through 3-engine numerical simulation (analytical toggling frame, SciPy matrix exponentiation, and Qiskit Aer) that ideal commuting ZZ crosstalk cancellation is governed by toggling-frame exposure bisection (A_uv = 0). Proved that Qiskit configured with matched sublattice staggering achieves identical perfect refocusing (agreement within 3.93e-7 Aer / 1.58e-12 ODE), confirming that the advantage lies in hardware-aware scheduling policies rather than SDK-level limitations. Forensic Post-Mortem of Prospective Experiment E2: Documented the empirical falsification of Adaptive Scheduler v1.0 on 4 held-out couplers, identifying that single-qubit maximum dephasing thresholds improperly defaulted to synchronous control, while bilateral partner dephasing governs CPMG breakdown. Cluster-robust inference (G=4, df=3) demonstrated that Fixed 80ns stagger outperformed synchronous XY8 by +0.446 +- 0.113 pp (p_2s = 0.0289). OSIRIS Control Compiler v2 (Risk-Aware Graph Surrogate): Formulated a cost-sensitive objective J(s) = F_hat(s) - lambda*sigma_F(s) - gamma*C(s). In open-system Lindblad master equation benchmarks across all 14 ibm_marrakesh couplers (28 cells with finite pulse width tau_p = 36ns, detuning, T1/T2, and filter leakage), OSIRIS v2 achieved +1.825 pp over Fixed 80ns (p_2s = 0.0004) and +2.356 pp over synchronous XY8 (p_2s = 0.0069). On a connected 5-qubit heavy-hex chain (Q12-Q19), shifting only the central vertex Q15 beat uniform staggering by +2.24 pp. Prospective Physical Hardware Validation (Experiment E3 Pilot): Executed under SYS-021 Ledger Block #15 on ibm_marrakesh (Job dbm00gd8mdtc73d6vjcg, 216 ISA circuits, 221,184 physical shots across 3 unseen physical couplers), OSIRIS Control Compiler v2 achieved 78.529% mean Bell-state fidelity, beating the primary Fixed 80ns baseline (77.878%) by +0.651 pp (block-clustered p_1s = 0.0348, positive in all 3 blocks) and beating synchronous XY8 (78.003%) by +0.526 pp (p_2s = 0.0454, positive in all 3 blocks). Compiler Performance Benchmark: Across 5 heavy-hex workloads (2 to 12 qubits), OSIRIS delivered 6.80x mean compilation speedup vs. Qiskit Opt-1 + PadDynamicalDecoupling, 13.87x speedup and 3.71x lower memory vs. Qiskit Opt-3 + Staggered PadDynamicalDecoupling, with verified exact unitary preservation (|1 - F_Statevector| <= 3.3e-15). The release bundle includes the complete Monograph with Amendment 3, compiled PDFs, executable benchmark suites, staged QPY archives, raw QPU bitstring counts, and cryptographic authorization receipts.

•Oct 31, 2026•0 citations
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).
A bstract We model the Hayden-Preskill (HP) information recovery protocol in 2d CFTs via local joining quenches. Euclidean path integrals with slits prepare the HP subsystems: the message M , its reference N , the Page-time black hole B , the early radiation E , and the late radiation R ; the remaining black hole after emitting R is denoted as B ′ . The single-slit geometry provides an analytically tractable toy model, while the bounded-slit geometry more closely captures the HP setup. In the free Dirac fermion 2d CFT, the mutual information I ( N : B ′ ) shows quasi-particle dynamics with partial or full revivals, whereas that in holographic 2d CFTs, which are expected to be maximally chaotic, exhibits sharp transitions: in the bounded-slit case, when the size of the late radiation becomes comparable to that of the reference N , I ( N : B ′ ) vanishes at late time, otherwise it remains finite. This contrast between free CFTs and holographic CFTs gives a clear characterization of the HP recovery threshold.
Six quantum circuit experiments performed on ibm_marrakesh (IBM Quantum, 156 qubits, Heron R2 architecture) are reported, designed to test boundary signatures of the ER=EPR conjecture within the AdS₂/JT gravity framework, with the Sachdev-Ye-Kitaev (SYK) model as the holographic dual of the black hole horizon. The experiments were executed iteratively: each result raised new questions that directly motivated the next protocol. In order of execution they implement: tripartite entanglement certification via the Mermin operator (|⟨M⟩| = 3.885); a traversable wormhole baseline using a Bell-pair thermofield double (F(g=π/2) = 1.000); black hole evaporation unitarity via the Hayden-Preskill protocol (F_rec = 0.9983, with the decoder reduced to zero two-qubit gates by the compiler); a corrected traversable wormhole using genuine SYK scrambling and exact Majorana coupling (F(g=0) = 0.020, F(g=π/2) = 0.953, GJW gain = 0.933); quantum chaos via out-of-time-order correlators (λ_L = 1.975 ± 0.294, 54.8% of the Maldacena-Shenker-Stanford bound); and black hole entropy under information absorption, where the hardware reproduces the entropy growth S(t) of SYK formation on top of a noise floor and the energy response to Alice’s input (correlation 0.998 with simulation), while the predicted area growth consistent with the Bekenstein law is obtained in simulation but is not resolved above noise on hardware. Total QPU time across all experiments: 7 minutes 2 seconds. Five of the six experiments reproduce the boundary predictions of the ER=EPR framework on hardware; the sixth reproduces them in simulation and only partially on hardware. Version 3 corrects Experiments 2 and 3 following the original laboratory reports. Exp. 2 reports the raw F(g=π/2) = 1.01 ± 0.01 instead of the clipped 1.000. In Exp. 3 the fused U†U circuit is identity by construction; its fidelity (0.9983) is reported as a noise-floor control, not as hardware recovery. The hardware scrambling result (F_scr = 0.530 vs. 0.532 in simulation) is kept; recovery is demonstrated in simulation. Experiments 2b, 5 and 6 are unchanged. Code and data: https://github.com/horca17/er-epr-six-protocols
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\text{SHA-256}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 ZZZZZZ-crosstalk. On an 8-qubit chain, the pre-registered trial achieved a mean survival probability P(+)=0.8998P(+) = 0.8998P(+)=0.8998 at T=32 μsT = 32\ \mu\text{s}T=32 μs, representing a +30.5% gain over bare idle (P(+)=0.5945P(+) = 0.5945P(+)=0.5945) and a +6.5% gain over standard simultaneous dynamical decoupling (P(+)=0.8342P(+) = 0.8342P(+)=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\mathcal{M}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\Delta F_{\text{target}}Δ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\text{SHA-256}SHA-256: HM=SHA-256(Canonicalize(M))H_{\mathcal{M}} = \text{SHA-256}(\text{Canonicalize}(\mathcal{M}))HM​=SHA-256(Canonicalize(M)) B. Append-Only Ledger Chaining Each entry iii in the OSIRIS ledger (Li\mathcal{L}_iLi​) contains the hash of the current manifest HM,iH_{\mathcal{M}, i}HM,i​, a UTC timestamp tit_iti​, the state of the preceding block head HL,i−1H_{\mathcal{L}, i-1}HL,i−1​, and execution metadata: HL,i=SHA-256(HL,i−1∥HM,i∥ti)H_{\mathcal{L}, i} = \text{SHA-256}(H_{\mathcal{L}, i-1} \mathbin{\Vert} H_{\mathcal{M}, i} \mathbin{\Vert} t_i)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,headH_{\mathcal{L}, \text{head}}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↔CountsH_{\mathcal{M}} \leftrightarrow \text{JobID} \leftrightarrow \text{Counts}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 ZZZZZZ-crosstalk on heavy-hex hardware topologies remains a primary source of decoherence during multi-qubit idle periods. Standard textbook dynamical decoupling applies simultaneous π\piπ-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][1, 2, 3, 4, 5, 6, 7, 8][1,2,3,4,5,6,7,8] is partitioned into two disjoint sublattices: SA={1,3,5,7},SB={2,4,6,8}\mathcal{S}_A = \{1, 3, 5, 7\}, \quad \mathcal{S}_B = \{2, 4, 6, 8\}SA​={1,3,5,7},SB​={2,4,6,8} π\piπ-pulse schedules are temporal phase-shifted between SA\mathcal{S}_ASA​ and SB\mathcal{S}_BSB​, 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 μsT = 16.0\ \mu\text{s}T=16.0 μs and T=32.0 μsT = 32.0\ \mu\text{s}T=32.0 μs. Effective loss rate Γ\GammaΓ was derived using Γ=−1Tln⁡P(+)\Gamma = -\frac{1}{T} \ln P(+)Γ=−T1​lnP(+). 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 │ █
In the Hayden--Preskill protocol, the decoder is usually assumed to know the microscopic identity of the collected output qubits. We study what happens when these labels are unavailable and only the relative order of the received qubits is preserved. The resulting order-preserving deletion channel maps an nnn-qubit scrambled register to a subsequence of length ℓ\ellℓ. For a diary of fixed size kkk, we prove that the optimal entanglement fidelity converges to the no-output value 4−k4^{-k}4−k when ℓ=o(n2/3)\ell=o(n^{2/3})ℓ=o(n2/3), uniformly over the scrambling unitary. For a Haar-random scrambling unitary, it converges to one when ℓ=ω(n2/3)\ell=ω(n^{2/3})ℓ=ω(n2/3) and ℓ=o(n)\ell=o(n)ℓ=o(n). Monotonicity then gives the fixed-error recovery scale ℓrec=Θ(n2/3)\ell_{\mathrm{rec}}=Θ(n^{2/3})ℓrec​=Θ(n2/3). We also consider partial position information obtained by dividing the register into BBB consecutive blocks and revealing the block of origin of each received qubit. The recovery scale becomes ℓrec(n,B)≍n2/3B−1/3\ell_{\mathrm{rec}}(n,B)\asymp n^{2/3}B^{-1/3}ℓrec​(n,B)≍n2/3B−1/3 for B≤nB\leq\sqrt nB≤n​ and ℓrec(n,B)≍n/B\ell_{\mathrm{rec}}(n,B)\asymp n/Bℓrec​(n,B)≍n/B for B≥nB\geq\sqrt nB≥n​. The exponent 2/32/32/3 is traced to rank-aligned coincidences between random subsequences, which control both the converse and the recovery argument. Thus, even purely classical information about the origin of the received subsystems can change the amount of quantum output required for Hayden--Preskill recovery.
The nonisometric holographic model of the black hole interior stands out as a potential resolution of the long-standing black hole information puzzle since it remedies the friction between the effective calculation and the microscopic description. In this study, combining the final-state projection model, the nonisometric model of black hole interior, and Hayden-Preskill thought experiment, we investigate the information recovery from decoding Hawking radiation and demonstrate the emergence of the Page time in this setup. We incorporate the effective modes into the scrambling inside the horizon, which are usually disregarded in Hayden-Preskill protocols, and show that the Page time can be identified as the transition of information transmission channels from the EPR projection to the local projections. This offers a new perspective on the Page time. We compute the decoupling condition under which retrieving information is feasible and show that this model computes the black hole entropy consistent with the quantum extremal surface calculation. Assuming the full knowledge of the dynamics of the black hole interior, we show how Yoshida-Kitaev decoding strategy can be employed in the modified Hayden-Preskill protocol. Furthermore, we perform experimental tests of both probabilistic and Grover’s search decoding strategies on the seven-qubit IBM quantum processors to validate our analytical findings and confirm the feasibility of retrieving information in the nonisometric model. This study would stimulate more interest to explore black hole information problem on the quantum processors. Published by the American Physical Society 2024
OSIRIS v4.8.0 Monograph & Governed Release Package This release encapsulates the sovereign architecture, operational history, and empirical verification of the OSIRIS and dna::}{::lang project, featuring the complete prospective quantum control campaign on IBM Heron r2 hardware (ibm_marrakesh) and the resolution of the OSIRIS vs. Qiskit dynamical decoupling benchmark. Key Empirical & Architectural Additions in v4.8.0: Resolution of the OSIRIS vs. Qiskit Ideal Benchmark: Established through 3-engine numerical simulation (analytical toggling frame, SciPy matrix exponentiation, and Qiskit Aer) that ideal commuting ZZ crosstalk cancellation is governed by toggling-frame exposure bisection (A_uv = 0). Proved that Qiskit configured with matched sublattice staggering achieves identical perfect refocusing (agreement within 3.93e-7 Aer / 1.58e-12 ODE), confirming that the advantage lies in hardware-aware scheduling policies rather than SDK-level limitations. Forensic Post-Mortem of Prospective Experiment E2: Documented the empirical falsification of Adaptive Scheduler v1.0 on 4 held-out couplers, identifying that single-qubit maximum dephasing thresholds improperly defaulted to synchronous control, while bilateral partner dephasing governs CPMG breakdown. Cluster-robust inference (G=4, df=3) demonstrated that Fixed 80ns stagger outperformed synchronous XY8 by +0.446 +- 0.113 pp (p_2s = 0.0289). OSIRIS Control Compiler v2 (Risk-Aware Graph Surrogate): Formulated a cost-sensitive objective J(s) = F_hat(s) - lambda*sigma_F(s) - gamma*C(s). In open-system Lindblad master equation benchmarks across all 14 ibm_marrakesh couplers (28 cells with finite pulse width tau_p = 36ns, detuning, T1/T2, and filter leakage), OSIRIS v2 achieved +1.825 pp over Fixed 80ns (p_2s = 0.0004) and +2.356 pp over synchronous XY8 (p_2s = 0.0069). On a connected 5-qubit heavy-hex chain (Q12-Q19), shifting only the central vertex Q15 beat uniform staggering by +2.24 pp. Prospective Physical Hardware Validation (Experiment E3 Pilot): Executed under SYS-021 Ledger Block #15 on ibm_marrakesh (Job dbm00gd8mdtc73d6vjcg, 216 ISA circuits, 221,184 physical shots across 3 unseen physical couplers), OSIRIS Control Compiler v2 achieved 78.529% mean Bell-state fidelity, beating the primary Fixed 80ns baseline (77.878%) by +0.651 pp (block-clustered p_1s = 0.0348, positive in all 3 blocks) and beating synchronous XY8 (78.003%) by +0.526 pp (p_2s = 0.0454, positive in all 3 blocks). Compiler Performance Benchmark: Across 5 heavy-hex workloads (2 to 12 qubits), OSIRIS delivered 6.80x mean compilation speedup vs. Qiskit Opt-1 + PadDynamicalDecoupling, 13.87x speedup and 3.71x lower memory vs. Qiskit Opt-3 + Staggered PadDynamicalDecoupling, with verified exact unitary preservation (|1 - F_Statevector| <= 3.3e-15). The release bundle includes the complete Monograph with Amendment 3, compiled PDFs, executable benchmark suites, staged QPY archives, raw QPU bitstring counts, and cryptographic authorization receipts.