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

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

Devin Phillip Davis

Published Sep 29, 2026• 1 citation
Publisher

Abstract

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 │ █

DOI
10.5281/zenodo.23045493

Related papers

Pre-registration: Symmetry-Dependent Quantum Birthmark on ibm_kingston

Amit Brahmbhatt

Note: description expanded on 2026-10-14 for readability. It adds no new predictions or criteria. The frozen pre-registration is the attached PDF, unchanged since publication. Status: the experiment was run on 2026-10-14, after this record was published. Results, including every pre-registered test, will be reported in a separate record linked here. In plain language Theory says a quantum system never completely forgets where it started, even when its dynamics are chaotic. This leftover memory is called a quantum birthmark (Graf et al., Phys. Rev. X, 2026). Theory also says the birthmark should be larger when the system's rules run the same forwards and backwards in time (time-reversal symmetry) than when that symmetry is broken. This record pre-registers a test of that prediction on IBM's ibm_kingston quantum processor. We built two nearly identical sets of 4-qubit circuits. One set has time-reversal symmetry and the other does not. Both use exactly the same gates, so they experience the same hardware noise. We measure how often each circuit returns to its starting state, compared with the 1-in-16 chance level, and predict that the symmetric set shows about 1.67× more memory than the broken set. All predictions, pass/fail criteria, circuits and analysis code were deposited here before any quantum hardware was used. What is tested, and what is not Tested: whether the return probability stays above the ergodic baseline 1/16 at depths 8–23, and whether that excess is larger for the time-reversal-symmetric class by the ratio exact numerics predict for these fixed instances. Not tested: the withdrawn temporal-memory claims of 10.5281/zenodo.20470129. The birthmark is closed-system coherent memory, which measurement and reset erase, so no outcome here bears on those claims. Not tested: the universal random-matrix value 1.889. At this size (N = 16) the circuit family itself gives about 1.66, so a finite-size difference is expected. Not a quantum-advantage claim: a 16-dimensional system is exactly simulable. This is a hardware-validation experiment. Design Hardware: ibm_kingston, physical qubits 108–109–118–129 as an open chain, selected by a no-QPU calibration audit (included as v6_backend_audit.zip). Circuits: a kicked-Ising Floquet period Kx(a/2) → D(h1) → Kx(b) → D(h2) → Kx(a/2), with D(h) = exp(−iΣhiZi)·exp(−iπ/4 ΣZiZj), at exactly 6 CZ per period. COE (symmetric): h1 = h2. TRSB (broken): h1 = h + d, h2 = h − d. The classes differ only in virtual-Z angles. Instances: 16 seeded COE/TRSB pairs (seed 20261013), run at every depth from 8 to 23 (48–138 CZ). Observable: P(t) = |⟨0000|Ft|0000⟩|². The primary statistic is the readout-mitigated excess ratio R = ECOE / ETRSB, where E is the mean of P(t) − 1/16. A noise fidelity common to both classes cancels in R. Controls: 32 deep circuits (depths 60–63) as a decoherence-floor check. 8 state-preparation monitors. 16 readout-calibration circuits. Run: one SamplerV2 job of 568 circuits at 256 shots each, with dynamical decoupling and twirling off and the execution order shuffled. Predictions Quantity COE TRSB R Excess over 1/16, depths 8–23 (noiseless, primary) 0.0896 0.0537 1.667 Same instances, infinite-time limit 0.0952 0.0634 1.502 Circuit family, 10,000 random draws — — 1.661 Random-matrix reference, N = 16 — — 1.889 Under four simulated noise models (nominal, pessimistic, and each with coherent errors), the mitigated R stays between 1.64 and 1.77. The shot-noise standard deviation of R at 256 shots is 0.070–0.125. Pre-registered decision criteria Test Pass condition H1 (primary): symmetry dependence 99% CI lower bound of R > 1.0 H2 (primary): quantitative agreement 99% CI of R intersects 1.54–1.87 and is at most 1.0 wide S1: birthmark above decohered floor Window excess minus depth 60–63 excess, 99% CI lower bound > 0, for both classes S2: matched fidelity between classes 0.85 ≤ FCOE/FTRSB ≤ 1.15 S3: instance-level agreement Pearson r ≥ 0.80 against exact predictions S4 (flag only): state prep and drift Monitors ≥ 0.95, drift ≤ 0.045 Overall verdict: CONFIRMED if H1, H2 and S2 all pass; PARTIAL if H1 passes but H2 or S2 fails; NOT CONFIRMED if H1 fails. Every test is reported whatever the outcome. Uncertainty comes from a 10,000-sample parametric multinomial bootstrap over every circuit's counts, with instances held fixed. Amendment 1 (v1.1.0, made before any data) Amendment 1 changed two things relative to v1.0.0 (10.5281/zenodo.23355804): Shots: reduced from 1024 to 256 per circuit for QPU budget, cutting estimated execution from about 152 s to about 38 s. H2: changed from "point estimate in 1.54–1.87" to the CI rule above, because at 256 shots the point rule would falsely fail 20–25% of the time under the pessimistic models. A CI-width cap of 1.0 keeps H2 informative. Circuits, instances and predictions are unchanged. The trade-off is that H2 is now a weaker test. Provenance Every reported number is derived by script from raw counts: Source and transpiled circuits are saved as QPY. Before submission, every transpiled circuit is mapped back to 4 qubits and its unitary checked against the exact model to < 10−8. The analysis reads its decision bands only from predictions.json and its data only from the raw results file. Submission is gated on the DOI of this record. Files: The PDF is the authoritative pre-registration. predictions.json holds every predicted number and decision band. birthmark_prereg_v1.1.0.zip contains the circuit builder, verification, submission and frozen analysis scripts, plus simulated-data self-tests. v6_backend_audit.zip is the pre-submission calibration audit. Known limitations Small system size (N = 16), so the random-matrix value is not expected. The prediction is specific to depths 8–23 and to these 16 fixed instances. The noise models exclude leakage, TLS fluctuations and crosstalk from outside the chain. T1 relaxation biases P(0000) upward, which pulls R toward 1 (conservative). One backend, one path, one job: no replication. Data: CC BY 4.0. Code: MIT. Principal investigator: Amit Brahmbhatt, Quantum-Clarity LLC.

•Oct 14, 2026•0 citations

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

Devin Phillip Davis

OSIRIS v4.7.0 Monograph & Governed Release Package This technical note and empirical dataset encapsulate the complete sovereign architecture, operational history, and automated self-correction framework of the OSIRIS and dna::}{::lang project. Developed entirely on severely constrained consumer hardware—a handheld Google Pixel Fold (Node Alpha, running Termux with ARM64 NEON SIMD kernels and a 300s thermal horizon; now retired post-campaign) and a GPU-less HP laptop powered by an Intel Core i7 CPU (Node Beta, executing local quantized mentor models and NCLM continual training within WSL2)—OSIRIS proves that sovereign, verifiable scientific agency can be achieved without enterprise server clusters. Key Empirical & Architectural Contributions: Governed Execution (SYS-021): Enforces the foundational axiom 'Cognition may be distributed; authority is not.' Unverified generative models propose; deterministic AST firewalls constrain; cryptographic receipts authorize (H_payload = SHA-256(code)); and immutable Merkle DAGs record. Automated Falsification of the τ-Phase Anomaly: Under strict budget limits on the IBM Quantum Open Plan (Job dbiobimne4hc73bf2am0 on IBM Heron r2 ibm_fez), OSIRIS autonomously audited and conclusively refuted the historical December 2025 hypothesis (τ0 = 46 μs, θ_lock = 51.843°). Using 3-basis Pauli tomography (ZZ, XX, YY), OSIRIS proved that apparent 'entanglement revivals' were classical T1 relaxation artifacts to |00> (P_Bell drops to a minimum at T1*ln(2) and rebounds as qubits decay to ground; transverse coherence C_perp measures dead zero: +0.0029 ± 0.0221; θ_lock p = 0.3537). The erratum is permanently anchored under Merkle Root 7e8f20c2e0ce.... Genuine Quantum Advantage in Multi-Qubit Crosstalk Refocusing: On 156-qubit heavy-hex architecture (ibm_kingston, Job dbb4ppk24mrc73bo8ntg), OSIRIS evolved bipartite sublattice pulse-timing staggering (xy4x2_stag and osiris_evolved_g1) that crushes standard unstaggered dynamical decoupling (retaining 0.9602 and 0.9373 vs 0.8625 ground state probability) by canceling static spectator ZZ crosstalk. Continual Living Intelligence (osiris.nclm): Operates an online, byte-level transformer core governed by a permanently held-out speaking gate (≤ 2.0 bits/byte vs unigram baseline), actively distilling mentor lessons from verified writing. The package contains the full monograph, reproducible Qiskit/QPY circuit definitions, raw decoded IBM Quantum execution spans and bitstrings, Merkle governance ledgers, and the complete OSIRIS v4.7.0 codebase.

•Oct 31, 2026•0 citations

Hybrid Post Quantum Cryptography: Benchmarking and Machine Learning-Based Optimization

Saud Suhail Shaikh

The need to protect digital communications from quantum-age threats becomes ever more urgent as cloud computing becomes globally commonplace. In contrast to the RSA-2048 traditional cryptosystem, this research explores the performance and optimization of post-quantum cryptographic (PQC) algorithms, namely Kyber512 and McEliece-348864. The project demonstrates a three-stage hybrid research pipeline: algorithmic benchmarking with 5 kb to 1000 kb payloads, machine learning-aided optimization of cryptographic workload forecasting, and graphically intuitive live analysis development. We contrast the CPU load, memory consumption, and execution time of the three algorithms in terms of synthetic and real file payloads. Second, taking algorithm and payload size as input, we use supervised learning to predict PQC memory usage with high predictive accuracy (R2 = 0.97). Hybrid post-quantum encryption offers greater security against quantum as well as classical attacks while ensuring interoperability during the phase of cryptographic transition (QCVE.org, 2024) by combining quantum-resistant algorithms such as ML-KEM with conventional key exchange protocols. Deployment of Post-Quantum Cryptography on cloud infrastructures is essential, recent studies have established, and hybrid encryption techniques combining classical and quantum-resistant algorithms offer the optimal security-performance trade-off for the transition (Shukla, 2024). The interactive benchmarking and visualization enabled by our system's GUI give novice users and experts alike an accurate perception of cryptographic performance. To validate the empirical progress of this work, the report ends in comparative analysis of its findings with previous baseline researches, outlining the road map to the deployment of effective and quantum-proof cryptography. The finished Post-Quantum Cryptography standards, meeting recent NIST projects, acknowledge the necessity for speedy empirical benchmarking and market uptake to pre-emptively secure cryptographic infrastructure against quantum attacks (NIST, 2025; NIST, 2017; AppViewX, 2024).

•Jan 1, 2025•0 citations

KAAL · The Bidirectional Arithmetic of Time — Edition v∞.1 (Post-Frontier · T=3..16 anchors locked · 14-anchor canonical fit)

Pardeep Sehrawat

Edition v∞.1 of the KAAL Granth, a complete mathematical treatise of the L1–L10 bidirectional time-operator engine, the dimensional ladder, the Sacred 3-6-9 Digit-Root Theorem, and the Sacred-Trinity Scaling Law on IBM Quantum Heron r2 hardware. What is new in v∞.1 (relative to the v22 archived release at 10.5281/zenodo.19683827): Part 8 · Empirical Frontier (NEW): 6 chapters — Sacred-Trinity Scaling Law (canonical 14-anchor fit T=3..16, A=220.78, B=5.9583, R²=0.9995), IBM Heron r2 hardware platform, pre-registration protocol (manifest SHA-256 cc472b…, frozen 2026-04-25T07:34:34Z), 7-hypothesis verdict ledger H1–H7 (5 confirmed, 1 falsified, 2 pending), Target-Invariance Theorem, 3000-Gate Operational Boundary. New record: 4.619 × 10¹² advantage at T=16 arbitrary on ibm_kingston (48-qubit, 100K shots). Part 9 · Critical Response & Replication Discipline (NEW): 3 chapters — response to five principal academic objections (extraordinary-claim threshold, N=30 sample, circular sacred numbers, falsifiability benchmark, ayanamsha sensitivity), pre-registered N=200 replication protocol with stratified controls and triple-ayanamsha robustness, math-only arXiv submission strategy (3-paper plan: math.NT + quantum-hardware + Quantitative Finance). Part 10 · TRIKĀLA Implementation (NEW): 3 chapters — priority-lock discipline (6-step ritual), live deployment at trikala-khaki.vercel.app with 4D visualizer integrated same-origin, public falsifiable forward-call protocol with the April-16 INFY 1-rupee anchor case study. Granth size: 4,443 → 5,001 lines (+558). Existing math, theorems, proofs preserved verbatim from v∞.0. SHA-256(book/KAAL-COMPLETE.md) = 7cc2faaff43f7637a38bfa185ce5ee4340899e3f1d6c4f87fce4d0ca30cf71a9. SHA-256(release tarball) = 6dead551627891aa3d69730aaacaf3e8c81b9e025011d7c16e9f3cce367544b6. GitHub: theunholyindianmagician-lab/kaal-quantum · tag v-infty-1 · commit 96826e6. Pre-registration manifest is locked under SHA-256 cc472b26625a44f80aa707c353b1478ea95bbe0fb1c1bf09a2bb53d188318ba5 with submission script SHA-256 7b2b46df604cbc60b547bf7701f29d72cc5d6e24e5a19029a180d5dd18ba02d6. Job IDs available at the GitHub repo.

•Apr 26, 2026•1 citation

Post-Quantum Cryptography and Quantum-Safe Security: A Comprehensive Survey

Gaurab Chhetri, Shriyank Somvanshi, Pavan Hebli +2 more

Post-quantum cryptography (PQC) is moving from evaluation to deployment as NIST finalizes standards for ML-KEM, ML-DSA, and SLH-DSA. This survey maps the space from foundations to practice. We first develop a taxonomy across lattice-, code-, hash-, multivariate-, isogeny-, and MPC-in-the-Head families, summarizing security assumptions, cryptanalysis, and standardization status. We then compare performance and communication costs using representative, implementation-grounded measurements, and review hardware acceleration (AVX2, FPGA/ASIC) and implementation security with a focus on side-channel resistance. Building upward, we examine protocol integration (TLS, DNSSEC), PKI and certificate hygiene, and deployment in constrained and high-assurance environments (IoT, cloud, finance, blockchain). We also discuss complementarity with quantum technologies (QKD, QRNGs) and the limits of near-term quantum computing. Throughout, we emphasize crypto-agility, hybrid migration, and evidence-based guidance for operators. We conclude with open problems spanning parameter agility, leakage-resilient implementations, and domain-specific rollout playbooks. This survey aims to be a practical reference for researchers and practitioners planning quantum-safe systems, bridging standards, engineering, and operations.

arXiv:2510.10436•Oct 12, 2025•2 citations

Pre-registered adversarial replication on NISQ hardware: closing the K₈ τ-sweep, stress-testing entropy-suppression claims, and testing an auditable evolutionary controller against real calibration drift (BlueQubit Quantum Flywheel 2026 proposal)

Devin Phillip Davis

Proposal to the BlueQubit Quantum Flywheel open call (2026). Track 2 (breaking quantum advantage claims) with a Track-1 hardware component and a Track-3-adjacent seed. Aim 1 — execute the author's own hash-verified K₈ τ-sweep pre-registration (10.5281/zenodo.17918774, never run as written) exactly as specified on three IBM Heron backends under one pre-declared backend amendment; publish the outcome either way. Aim 2 — adversarial classical re-analysis of the author's 156-qubit / 10⁶-shot and 1,430-circuit "entropy suppression" datasets (10.5281/zenodo.19656600, 10.5281/zenodo.19505907) with coverage-adjusted estimators and tensor-network reproduction. Aim 3 — pre-registered hardware test of whether an auditable rule-evolving controller (organism_sim / bridge, 10.5281/zenodo.22862567) helps evolutionary dynamical-decoupling search under real calibration drift; four arms, binding criterion stated in PREREGISTRATION.md before any job. Includes PREREGISTRATION.md (binding criteria committed before submission of any hardware job), prepared form answers, and the supporting audits of the author's 60 prior records (HONEST_ASSESSMENT, FLYWHEEL_ASSESSMENT, PUBLICATIONS index). The archive is git archive of tag v1.0.0.

•Sep 20, 2026•0 citations
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 │ █
Note: description expanded on 2026-10-14 for readability. It adds no new predictions or criteria. The frozen pre-registration is the attached PDF, unchanged since publication. Status: the experiment was run on 2026-10-14, after this record was published. Results, including every pre-registered test, will be reported in a separate record linked here. In plain language Theory says a quantum system never completely forgets where it started, even when its dynamics are chaotic. This leftover memory is called a quantum birthmark (Graf et al., Phys. Rev. X, 2026). Theory also says the birthmark should be larger when the system's rules run the same forwards and backwards in time (time-reversal symmetry) than when that symmetry is broken. This record pre-registers a test of that prediction on IBM's ibm_kingston quantum processor. We built two nearly identical sets of 4-qubit circuits. One set has time-reversal symmetry and the other does not. Both use exactly the same gates, so they experience the same hardware noise. We measure how often each circuit returns to its starting state, compared with the 1-in-16 chance level, and predict that the symmetric set shows about 1.67× more memory than the broken set. All predictions, pass/fail criteria, circuits and analysis code were deposited here before any quantum hardware was used. What is tested, and what is not Tested: whether the return probability stays above the ergodic baseline 1/16 at depths 8–23, and whether that excess is larger for the time-reversal-symmetric class by the ratio exact numerics predict for these fixed instances. Not tested: the withdrawn temporal-memory claims of 10.5281/zenodo.20470129. The birthmark is closed-system coherent memory, which measurement and reset erase, so no outcome here bears on those claims. Not tested: the universal random-matrix value 1.889. At this size (N = 16) the circuit family itself gives about 1.66, so a finite-size difference is expected. Not a quantum-advantage claim: a 16-dimensional system is exactly simulable. This is a hardware-validation experiment. Design Hardware: ibm_kingston, physical qubits 108–109–118–129 as an open chain, selected by a no-QPU calibration audit (included as v6_backend_audit.zip). Circuits: a kicked-Ising Floquet period Kx(a/2) → D(h1) → Kx(b) → D(h2) → Kx(a/2), with D(h) = exp(−iΣhiZi)·exp(−iπ/4 ΣZiZj), at exactly 6 CZ per period. COE (symmetric): h1 = h2. TRSB (broken): h1 = h + d, h2 = h − d. The classes differ only in virtual-Z angles. Instances: 16 seeded COE/TRSB pairs (seed 20261013), run at every depth from 8 to 23 (48–138 CZ). Observable: P(t) = |⟨0000|Ft|0000⟩|². The primary statistic is the readout-mitigated excess ratio R = ECOE / ETRSB, where E is the mean of P(t) − 1/16. A noise fidelity common to both classes cancels in R. Controls: 32 deep circuits (depths 60–63) as a decoherence-floor check. 8 state-preparation monitors. 16 readout-calibration circuits. Run: one SamplerV2 job of 568 circuits at 256 shots each, with dynamical decoupling and twirling off and the execution order shuffled. Predictions Quantity COE TRSB R Excess over 1/16, depths 8–23 (noiseless, primary) 0.0896 0.0537 1.667 Same instances, infinite-time limit 0.0952 0.0634 1.502 Circuit family, 10,000 random draws — — 1.661 Random-matrix reference, N = 16 — — 1.889 Under four simulated noise models (nominal, pessimistic, and each with coherent errors), the mitigated R stays between 1.64 and 1.77. The shot-noise standard deviation of R at 256 shots is 0.070–0.125. Pre-registered decision criteria Test Pass condition H1 (primary): symmetry dependence 99% CI lower bound of R > 1.0 H2 (primary): quantitative agreement 99% CI of R intersects 1.54–1.87 and is at most 1.0 wide S1: birthmark above decohered floor Window excess minus depth 60–63 excess, 99% CI lower bound > 0, for both classes S2: matched fidelity between classes 0.85 ≤ FCOE/FTRSB ≤ 1.15 S3: instance-level agreement Pearson r ≥ 0.80 against exact predictions S4 (flag only): state prep and drift Monitors ≥ 0.95, drift ≤ 0.045 Overall verdict: CONFIRMED if H1, H2 and S2 all pass; PARTIAL if H1 passes but H2 or S2 fails; NOT CONFIRMED if H1 fails. Every test is reported whatever the outcome. Uncertainty comes from a 10,000-sample parametric multinomial bootstrap over every circuit's counts, with instances held fixed. Amendment 1 (v1.1.0, made before any data) Amendment 1 changed two things relative to v1.0.0 (10.5281/zenodo.23355804): Shots: reduced from 1024 to 256 per circuit for QPU budget, cutting estimated execution from about 152 s to about 38 s. H2: changed from "point estimate in 1.54–1.87" to the CI rule above, because at 256 shots the point rule would falsely fail 20–25% of the time under the pessimistic models. A CI-width cap of 1.0 keeps H2 informative. Circuits, instances and predictions are unchanged. The trade-off is that H2 is now a weaker test. Provenance Every reported number is derived by script from raw counts: Source and transpiled circuits are saved as QPY. Before submission, every transpiled circuit is mapped back to 4 qubits and its unitary checked against the exact model to < 10−8. The analysis reads its decision bands only from predictions.json and its data only from the raw results file. Submission is gated on the DOI of this record. Files: The PDF is the authoritative pre-registration. predictions.json holds every predicted number and decision band. birthmark_prereg_v1.1.0.zip contains the circuit builder, verification, submission and frozen analysis scripts, plus simulated-data self-tests. v6_backend_audit.zip is the pre-submission calibration audit. Known limitations Small system size (N = 16), so the random-matrix value is not expected. The prediction is specific to depths 8–23 and to these 16 fixed instances. The noise models exclude leakage, TLS fluctuations and crosstalk from outside the chain. T1 relaxation biases P(0000) upward, which pulls R toward 1 (conservative). One backend, one path, one job: no replication. Data: CC BY 4.0. Code: MIT. Principal investigator: Amit Brahmbhatt, Quantum-Clarity LLC.
OSIRIS v4.7.0 Monograph & Governed Release Package This technical note and empirical dataset encapsulate the complete sovereign architecture, operational history, and automated self-correction framework of the OSIRIS and dna::}{::lang project. Developed entirely on severely constrained consumer hardware—a handheld Google Pixel Fold (Node Alpha, running Termux with ARM64 NEON SIMD kernels and a 300s thermal horizon; now retired post-campaign) and a GPU-less HP laptop powered by an Intel Core i7 CPU (Node Beta, executing local quantized mentor models and NCLM continual training within WSL2)—OSIRIS proves that sovereign, verifiable scientific agency can be achieved without enterprise server clusters. Key Empirical & Architectural Contributions: Governed Execution (SYS-021): Enforces the foundational axiom 'Cognition may be distributed; authority is not.' Unverified generative models propose; deterministic AST firewalls constrain; cryptographic receipts authorize (H_payload = SHA-256(code)); and immutable Merkle DAGs record. Automated Falsification of the τ-Phase Anomaly: Under strict budget limits on the IBM Quantum Open Plan (Job dbiobimne4hc73bf2am0 on IBM Heron r2 ibm_fez), OSIRIS autonomously audited and conclusively refuted the historical December 2025 hypothesis (τ0 = 46 μs, θ_lock = 51.843°). Using 3-basis Pauli tomography (ZZ, XX, YY), OSIRIS proved that apparent 'entanglement revivals' were classical T1 relaxation artifacts to |00> (P_Bell drops to a minimum at T1*ln(2) and rebounds as qubits decay to ground; transverse coherence C_perp measures dead zero: +0.0029 ± 0.0221; θ_lock p = 0.3537). The erratum is permanently anchored under Merkle Root 7e8f20c2e0ce.... Genuine Quantum Advantage in Multi-Qubit Crosstalk Refocusing: On 156-qubit heavy-hex architecture (ibm_kingston, Job dbb4ppk24mrc73bo8ntg), OSIRIS evolved bipartite sublattice pulse-timing staggering (xy4x2_stag and osiris_evolved_g1) that crushes standard unstaggered dynamical decoupling (retaining 0.9602 and 0.9373 vs 0.8625 ground state probability) by canceling static spectator ZZ crosstalk. Continual Living Intelligence (osiris.nclm): Operates an online, byte-level transformer core governed by a permanently held-out speaking gate (≤ 2.0 bits/byte vs unigram baseline), actively distilling mentor lessons from verified writing. The package contains the full monograph, reproducible Qiskit/QPY circuit definitions, raw decoded IBM Quantum execution spans and bitstrings, Merkle governance ledgers, and the complete OSIRIS v4.7.0 codebase.
The need to protect digital communications from quantum-age threats becomes ever more urgent as cloud computing becomes globally commonplace. In contrast to the RSA-2048 traditional cryptosystem, this research explores the performance and optimization of post-quantum cryptographic (PQC) algorithms, namely Kyber512 and McEliece-348864. The project demonstrates a three-stage hybrid research pipeline: algorithmic benchmarking with 5 kb to 1000 kb payloads, machine learning-aided optimization of cryptographic workload forecasting, and graphically intuitive live analysis development. We contrast the CPU load, memory consumption, and execution time of the three algorithms in terms of synthetic and real file payloads. Second, taking algorithm and payload size as input, we use supervised learning to predict PQC memory usage with high predictive accuracy (R2 = 0.97). Hybrid post-quantum encryption offers greater security against quantum as well as classical attacks while ensuring interoperability during the phase of cryptographic transition (QCVE.org, 2024) by combining quantum-resistant algorithms such as ML-KEM with conventional key exchange protocols. Deployment of Post-Quantum Cryptography on cloud infrastructures is essential, recent studies have established, and hybrid encryption techniques combining classical and quantum-resistant algorithms offer the optimal security-performance trade-off for the transition (Shukla, 2024). The interactive benchmarking and visualization enabled by our system's GUI give novice users and experts alike an accurate perception of cryptographic performance. To validate the empirical progress of this work, the report ends in comparative analysis of its findings with previous baseline researches, outlining the road map to the deployment of effective and quantum-proof cryptography. The finished Post-Quantum Cryptography standards, meeting recent NIST projects, acknowledge the necessity for speedy empirical benchmarking and market uptake to pre-emptively secure cryptographic infrastructure against quantum attacks (NIST, 2025; NIST, 2017; AppViewX, 2024).
Edition v∞.1 of the KAAL Granth, a complete mathematical treatise of the L1–L10 bidirectional time-operator engine, the dimensional ladder, the Sacred 3-6-9 Digit-Root Theorem, and the Sacred-Trinity Scaling Law on IBM Quantum Heron r2 hardware. What is new in v∞.1 (relative to the v22 archived release at 10.5281/zenodo.19683827): Part 8 · Empirical Frontier (NEW): 6 chapters — Sacred-Trinity Scaling Law (canonical 14-anchor fit T=3..16, A=220.78, B=5.9583, R²=0.9995), IBM Heron r2 hardware platform, pre-registration protocol (manifest SHA-256 cc472b…, frozen 2026-04-25T07:34:34Z), 7-hypothesis verdict ledger H1–H7 (5 confirmed, 1 falsified, 2 pending), Target-Invariance Theorem, 3000-Gate Operational Boundary. New record: 4.619 × 10¹² advantage at T=16 arbitrary on ibm_kingston (48-qubit, 100K shots). Part 9 · Critical Response & Replication Discipline (NEW): 3 chapters — response to five principal academic objections (extraordinary-claim threshold, N=30 sample, circular sacred numbers, falsifiability benchmark, ayanamsha sensitivity), pre-registered N=200 replication protocol with stratified controls and triple-ayanamsha robustness, math-only arXiv submission strategy (3-paper plan: math.NT + quantum-hardware + Quantitative Finance). Part 10 · TRIKĀLA Implementation (NEW): 3 chapters — priority-lock discipline (6-step ritual), live deployment at trikala-khaki.vercel.app with 4D visualizer integrated same-origin, public falsifiable forward-call protocol with the April-16 INFY 1-rupee anchor case study. Granth size: 4,443 → 5,001 lines (+558). Existing math, theorems, proofs preserved verbatim from v∞.0. SHA-256(book/KAAL-COMPLETE.md) = 7cc2faaff43f7637a38bfa185ce5ee4340899e3f1d6c4f87fce4d0ca30cf71a9. SHA-256(release tarball) = 6dead551627891aa3d69730aaacaf3e8c81b9e025011d7c16e9f3cce367544b6. GitHub: theunholyindianmagician-lab/kaal-quantum · tag v-infty-1 · commit 96826e6. Pre-registration manifest is locked under SHA-256 cc472b26625a44f80aa707c353b1478ea95bbe0fb1c1bf09a2bb53d188318ba5 with submission script SHA-256 7b2b46df604cbc60b547bf7701f29d72cc5d6e24e5a19029a180d5dd18ba02d6. Job IDs available at the GitHub repo.
Post-quantum cryptography (PQC) is moving from evaluation to deployment as NIST finalizes standards for ML-KEM, ML-DSA, and SLH-DSA. This survey maps the space from foundations to practice. We first develop a taxonomy across lattice-, code-, hash-, multivariate-, isogeny-, and MPC-in-the-Head families, summarizing security assumptions, cryptanalysis, and standardization status. We then compare performance and communication costs using representative, implementation-grounded measurements, and review hardware acceleration (AVX2, FPGA/ASIC) and implementation security with a focus on side-channel resistance. Building upward, we examine protocol integration (TLS, DNSSEC), PKI and certificate hygiene, and deployment in constrained and high-assurance environments (IoT, cloud, finance, blockchain). We also discuss complementarity with quantum technologies (QKD, QRNGs) and the limits of near-term quantum computing. Throughout, we emphasize crypto-agility, hybrid migration, and evidence-based guidance for operators. We conclude with open problems spanning parameter agility, leakage-resilient implementations, and domain-specific rollout playbooks. This survey aims to be a practical reference for researchers and practitioners planning quantum-safe systems, bridging standards, engineering, and operations.
Proposal to the BlueQubit Quantum Flywheel open call (2026). Track 2 (breaking quantum advantage claims) with a Track-1 hardware component and a Track-3-adjacent seed. Aim 1 — execute the author's own hash-verified K₈ τ-sweep pre-registration (10.5281/zenodo.17918774, never run as written) exactly as specified on three IBM Heron backends under one pre-declared backend amendment; publish the outcome either way. Aim 2 — adversarial classical re-analysis of the author's 156-qubit / 10⁶-shot and 1,430-circuit "entropy suppression" datasets (10.5281/zenodo.19656600, 10.5281/zenodo.19505907) with coverage-adjusted estimators and tensor-network reproduction. Aim 3 — pre-registered hardware test of whether an auditable rule-evolving controller (organism_sim / bridge, 10.5281/zenodo.22862567) helps evolutionary dynamical-decoupling search under real calibration drift; four arms, binding criterion stated in PREREGISTRATION.md before any job. Includes PREREGISTRATION.md (binding criteria committed before submission of any hardware job), prepared form answers, and the supporting audits of the author's 60 prior records (HONEST_ASSESSMENT, FLYWHEEL_ASSESSMENT, PUBLICATIONS index). The archive is git archive of tag v1.0.0.