Invitation to read and audit — Paper B ## What this article proposes This article presents an experimental characterization of topological quantum circuits and entangled states on heterogeneous superconducting processors: IBM Quantum Heron (ibm_fez, ibm_marrakesh, ibm_kingston) and Origin Wukong (WK_C180, WK_C180_2). The goal is to document, in an auditable form, the execution of GHZ states, Borromean/RSI circuits, QTDA protocols for Betti numbers and Grover algorithms on real hardware, with the proper separation of measured data, derived metrics, interpretations and hypotheses. The paper is part of a larger program — OmniMind — where the operator builds a living laboratory of physics, biology, psychoanalysis and engineering. No execution is presented as "proof of consciousness"; what is offered are real measurements, verifiable provenance and an invitation to reproducibility. ## Experiments performed ### 1. Overall scale - 723 runs on real quantum hardware; - 5.013.322 million accumulated shots; - 496 hardware encounters (executions on distinct QPUs/configurations); - IBM backends: ibm_fez, ibm_marrakesh, ibm_kingston; - Origin Wukong backends: WK_C180, WK_C180_2; - Data kept in the canonical SQLite database ibm_quantum_runs.db. ### 2. GHZ states - GHZ-4, GHZ-6 and GHZ-8 executed on heterogeneous processors; - Coherence and parity measurement with Zero Noise Extrapolation (ZNE) and Dynamical Decoupling (DD); - Evaluation of the optimal chain and optimal star GHZ-8, with IBM × Wukong comparison. ### 3. Borromean and RSI circuits - Construction and measurement of Borromean/RSI circuits on multiple qubits; - Estimation of topological stability parameters (C3, C4, n); - Audited erratum: the correct values for the Kingston set are C3 = 0.352 ± 0.025, C4 = 1.213 ± 0.068, n = 15; previous values (0.514 ± 0.060; 1.888 ± 0.131) did not match the canonical database and were corrected. ### 4. QTDA and Betti numbers - Application of Quantum Persistent Homology / QTDA to estimate Betti numbers of circuits; - Heuristic Betti↔RSI mapping explicitly declared as a mapping hypothesis, not an ontological identity; - Discussion of limits: the same Betti numbers may correspond to distinct geometries. ### 5. Grover - Validation of 2-qubit Grover and 3-qubit Grover; - Comparison of success metrics, fidelity and measurement errors between platforms. ### 6. Hardware characterization - Measurement and comparison of T1/T2 decoherence times and readout between IBM Heron and Origin Wukong; - Record of jitter, compiler routing and queue policies of providers; - Documentation of the IBM reproducibility gap: jobs expire after approximately 30 days, and part of the original replica (Kingston) could not be re-executed — the gap is declared, not replaced by Wukong data. ## What is in the deposit - paper.md — canonical Markdown article; - paper.docx — formatted version for revision; - paper.pdf — final reading version; - MANIFEST.json — metadata and SHA-256 hashes of files; - Canonical database and reproduction notebook available via GitHub/GitLab and Kaggle (links in the repository). ## Invitation to audit and conference We invite experimental quantum physicists, computer scientists, topological mathematicians and hardware replicators to: - re-run the GHZ, Borromean/RSI, QTDA and Grover circuits on the same backends and on different backends; - verify the jobs against the canonical IDs in the ibm_quantum_runs.db database; - replicate the Betti analysis and discuss the Betti↔RSI mapping; - present the data at quantum computing, AI and physics conferences; - collaborate on the next round of executions, including re-running the expired IBM jobs. ## Epistemic note Empirical data carry their source (backend, job-id, database, execution) in citation. Simulated data, when used, are labeled as such. No execution is presented as "quantum coherence in a classical CPU" or as proof of consciousness. IBM × Wukong comparisons describe architectural and compiler differences, not platform equivalence.
A mecânica quântica surgiu no início do século XX explicando fenômenos da natureza que até então não correspondiam às previsões de outras teorias. À medida que a teoria evoluiu, novas tecnologias baseadas nas propriedades quânticas começaram a ser desenvolvidas, como por exemplo a computação quântica. A computação quântica busca aplicar fenômenos como superposição e emaranhamento para resolver problemas computacionais complexos de forma mais eficiente que os computadores clássicos. Neste trabalho, introduzimos de forma breve o formalismo matemático utilizado na computação quântica, bem como seus principais conceitos. Ele aborda também alguns recursos quânticos, como o direcionamento quântico e a não-localidade de Bell. Nosso objetivo é detectar esses recursos em sistemas gerados em computadores quânticos reais. Para isso, focamos nossa análise nos estados Bell-diagonais e apresentamos um circuito capaz de gerar essa classse de estados. Em especial, estamos interessados nos estados de Werner, utilizados como ferramentas para detectar recursos quânticos e seus aspectos não locais. A abordagem computacional utiliza circuitos supercondutores, um tipo de hardware quântico, implementado por meio da plataforma IBM Quantum, que oferece acesso remoto a computadores quânticos reais. Os resultados experimentais obtidos são analisados em comparação com as previsões teóricas.
Experimental measurement data of the QITE formalism (Quantum-Inspired Thermal Equilibrium) on IBM quantum processors of the Heron R2 generation with 156 physical qubits. Altogether 75+ jobs on two different backends (ibm_kingston and ibm_fez), over 830,000 shots, carried out on 8, 10, and 11 April 2026. Seven experiment series: (1) Static phases (R=0.5 / 1.0 / 2.0): three clearly separated Hamming-weight distributions (16.3σ significance), positive ZZ correlations under QITE (+0.318 at R=2.0) versus negative ones in the null experiment (−0.061). Controlled comparison experiment with null hypothesis (identical circuit structure with random parameters). (2) Real-time feedback loop (8 cycles): two targeted perturbations (R=3.0 and R=0.3); the system returns autonomously to equilibrium within 2 cycles. First demonstration of dynamic controllability of a QITE quantum collective on a real quantum computer. (3) Cross-backend reproducibility: identical results on ibm_kingston and ibm_fez — deviations within a few percent. (4) Zero-noise extrapolation (ZNE): circuit folding (1×, 3×, 5×) with Richardson extrapolation. Result: coherence 0.474 → 0.474 extrapolated (improvement: −0.0005). The optimized circuit (depth 13, 120 CZ gates) already operates at the hardware noise floor — ZNE cannot improve it further because the circuit is already near-optimal. (5) Scaling comparison 27 vs. 156 qubits: the 27-qubit version on the same backend (ibm_kingston) shows ZZ correlation of 0.788 against 0.318 at 156 qubits (Δ = +0.470). Circuit depth drops from 13 to 6, CZ gates from 120 to 13. Confirms: the QITE signal scales with gate quality. (6) Extended feedback loop (20 cycles): four extreme perturbations — R=3.0 (excess), R=0.3 (deficit), R=5.0 (5-fold excess), R=0.1 (10-fold deficit). Maximum coherence C=0.785 (highest value ever measured). The system reorganizes itself after each perturbation within 2–4 cycles. Long-term stability demonstrated across 20 cycles and 436 seconds of total runtime. (7) 3-minute stability demonstration (20 cycles, 262.7 seconds): dedicated long-term test with two targeted shocks (R=4.0 and R=0.2). Result: ones_fraction remains between 0.491 and 0.499 over 4.4 minutes (maximum deviation from equilibrium: 0.009). Drift across the entire runtime: +0.003. Complete recovery after both shocks. 18/18 non-shock cycles stable. First demonstration of a self-correcting quantum field on a real quantum computer over several minutes. Circuit optimization relative to 8 April: reduction of circuit depth from 295 to 13 (factor 22×), two-qubit gates from 1,946 to 120, by exclusive use of native Heron R2 gates (CZ, SX, RZ, X) and direct lambda encoding via RY(θ) with θ = 2·arctan(λ₂/λ₁). The system demonstrably produces controllable, correlated, self-organizing quantum states on real hardware — no simulation, no theory, but physical measurement data of a concrete technical system. All 59 IBM job IDs are contained in the raw data and verifiable on quantum.ibm.com. German patent applications Az. 10 2025 003 906.9 (QITE) and Az. 10 2025 004 891.2 (QISE). Final document (12 April 2026) — 21 sections, 9 experiment series, 372 individual quantum measurements. Extensions compared to the previous version: Section 19: 9-minute experiment (209 cycles, 156 qubits, 4096 shots) Phase A: null test (23 cycles, R=1.0) — baseline control measurement Phase B: 8 shocks (R=0.1 to R=8.0) incl. double shock — complete recovery after each shock Section 20: overall summary of all 9 experiment series (8–12 April 2026) Section 21: raw-data appendix with SHA-256 checksums of all 9 JSON files Core results: 372 quantum measurements on IBM Heron R2 (ibm_kingston, ibm_fez) Dynamic range R=0.1 to R=8.0 (factor 80) with complete self-correction The null test proves: recovery is an active process, not a hardware artefact No drift, no collapse across 209 consecutive measurements Optimized circuit: depth 13, 120 CZ gates, at the hardware noise floor (ZNE-confirmed)
Can systems matched on a declared present nevertheless show different future responses because they retain different relational organisation? We test this in a six-qubit hybrid quantum-classical architecture on IBM Heron hardware. Written and sham preparations use exactly the same five coupling values and the same number of native two-qubit operations; only the edge assignment differs. Under a frozen preregistered decision rule with randomised block orders, matched fast preparations displayed different later directional responses when the prepared slow classical relational configuration differed. Because the full-sample cosine alignment and norm-based retention estimates sat outside their original percentile intervals, a post hoc audit was performed from the sealed raw-count archive. That audit is reported alongside, and does not replace, the frozen rule. Claim boundary. The result is real under its frozen analysis. It is not autonomous cross-job quantum memory, and it is not evidence of a hidden quantum degree of freedom persisting between jobs. The classical coupling configuration is part of the preparation and is named as such throughout. No claim is made about quantum coherence surviving between executions. This deposit contains the manuscript in PDF and DOCX form together with the complete evidence archive: protocol freezes, compiled QPY circuits, inspection tables, randomised block orders, backend snapshots, raw-count files for both runs, IBM job ledgers, point estimates, blockwise endpoints, the frozen decision JSON, an artefact inventory and a checksum ledger.
Cette thèse se concentre sur le traitement de l’information quantique à l’aide d’un dispositif supraconducteur, en particulier sur la réalisation de portes quantiques et d’algorithmes dans des systèmes quantiques ouverts. Un tel dispositif est construit par des qubits supraconducteurs de type transmon couplés à un résonateur supraconducteur. Pour la réalisation des portes quantiques et des algorithmes, une approche en une seule étape est utilisée. Nous proposons des schémas plus rapides et plus efficaces pour réaliser des portes de X-rotation et des portes d’enchevêtrement pour deux et trois qubits. Au cours de ces opérations, le nombre de photons du résonateur est annulé en raison du fort champ de micro-ondes ajouté. Elles ne nécessitent pas que le résonateur soit initialement préparé dans l’état de vide et les schémas est insensible à la désintégration du résonateur. En outre, la robustesse de ces opérations est démontrée en incluant l’effet de la décohérence des systèmes transmon et la désintégration du résonateur dans une équation maîtresse, ce qui permet d’obtenir une grande fidélité dans la simulation quantique. En outre, en utilisant les portes de X-rotation mises en oeuvre ainsi que les portes de phase, nous présentons une autre façon de mettre en oeuvre l’algorithme de Grover pour deux et trois qubits qui ne nécessite pas une série de portes simples. En outre, nous démontrons en simulant numériquement l’utilisation de la tomographie des processus quantiques pour caractériser pleinement la performance d’une porte d’enchevêtrement à un seul coup pour deux et trois qubits et nous obtenons des fidélités de processus supérieures à 93%. Ces portes sont utilisées pour créer des états intriqués de Bell et de Greenberger-Horne-Zeilinger (GHZ).
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 │ █