Amendment 5 (2026-10-09), deposited before any S2 data. The registered question, estimand, test, seeds (1000-1079), shots (2,000), backend and qubit rules and 600 s ceiling are unchanged. What changes is how sampler calls become IBM jobs: one job per call (960 jobs, about 2,900 billed seconds) cannot fit the ceiling because of per-job billing, so seeds run in two blocks of 40 and every round of a block is one multi-pub job (12 jobs, about 540 s expected). Both arms of a seed share each job; the resulting shared-job exposure is accepted, with the primary test unchanged and per-block estimates reported as a secondary diagnostic. There is no statistical stopping and no interim analysis. Author decisions (shots, blocks, exposure) were made on 2026-10-09. Files: S2_AMENDMENT_5.md, AMENDMENT_5_MANIFEST.json (hashes of the implementation snapshot, commit 3332e893, and of the documents) and rqc-s2-amendment5-5fc50b0c.zip (code, documents and tests at commit 5fc50b0c). The original pre-registration and its frozen tooling are included unchanged. Not approved for execution: a run requires a recorded approval bound to the exact run payload. Pre-registration, deposited before any hardware job. On one IBM Heron backend (alphabetical-first rule; lowest-CZ-error 8-qubit path), with depth, two-qubit gate count, shots and session equal, does feedback-driven local search over single-qubit angles raise the fresh-re-measured, circuit-normalized XEB of the selected circuit compared with random search, at equal output concentration? Primary estimand: β0 of d = β0 + β1·Δc (one-sided, α = 0.05); 80 fresh seeds (1000–1079); 10-minute QPU ceiling. Simulation (S1) on an ibm_fez noise model and on Google's Willow noise model disagreed (β0 +0.010 and −0.003, both intervals include 0); the test is powered for effects of about 0.012 or larger and a null does not rule out smaller ones. Code frozen at github.com/osiris-dnalang/osiris-cli commit 86e3a3f4 (archive included).
Amendment 5 (2026-10-09), deposited before any S2 data. The registered question, estimand, test, seeds (1000-1079), shots (2,000), backend and qubit rules and 600 s ceiling are unchanged. What changes is how sampler calls become IBM jobs: one job per call (960 jobs, about 2,900 billed seconds) cannot fit the ceiling because of per-job billing, so seeds run in two blocks of 40 and every round of a block is one multi-pub job (12 jobs, about 540 s expected). Both arms of a seed share each job; the resulting shared-job exposure is accepted, with the primary test unchanged and per-block estimates reported as a secondary diagnostic. There is no statistical stopping and no interim analysis. Author decisions (shots, blocks, exposure) were made on 2026-10-09. Files: S2_AMENDMENT_5.md, AMENDMENT_5_MANIFEST.json (hashes of the implementation snapshot, commit 3332e893, and of the documents) and rqc-s2-amendment5-5fc50b0c.zip (code, documents and tests at commit 5fc50b0c). The original pre-registration and its frozen tooling are included unchanged. Not approved for execution: a run requires a recorded approval bound to the exact run payload. Pre-registration, deposited before any hardware job. On one IBM Heron backend (alphabetical-first rule; lowest-CZ-error 8-qubit path), with depth, two-qubit gate count, shots and session equal, does feedback-driven local search over single-qubit angles raise the fresh-re-measured, circuit-normalized XEB of the selected circuit compared with random search, at equal output concentration? Primary estimand: β0 of d = β0 + β1·Δc (one-sided, α = 0.05); 80 fresh seeds (1000–1079); 10-minute QPU ceiling. Simulation (S1) on an ibm_fez noise model and on Google's Willow noise model disagreed (β0 +0.010 and −0.003, both intervals include 0); the test is powered for effects of about 0.012 or larger and a null does not rule out smaller ones. Code frozen at github.com/osiris-dnalang/osiris-cli commit 86e3a3f4 (archive included).
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.
Fresh IBM Fez platform-lock pre-registration for executing the (Z_2)^3 prediction under the Stage 1c topological gate (DOI 10.5281/zenodo.20404635). Locks: backend ibm_fez, qubits (15, 2, 23), calibration snapshot of 2026-05-27T02:18:29Z (SHA-256 3f69b12d793b7c0cfc1f7cb343b3a0b8c40f04ae3a6239f7e3edd48192dadd1d), analysis script SHA-256 69c5e040c96f8b0f3fd50bc5014a63b4d461129d2e2affb0297f54887d871534, execution parameters (16,000 shots per circuit, 36 circuits total, bootstrap seed 20260526), and outcome reporting commitment.The Stage 1c gate authority (R_gap = (τ - σ_2) / std(σ_2^bootstrap) ≥ 3.0 with m̂_0 = 1) replaces Stage 1b §6.2's union-bound mundane gate. All other Stage 1b provisions (predictions 7/8 vs 8/9, operational f̂ definition, statistical-power requirement, Bayes-factor decision rule) remain in force.This Stage 2c is distinct from Stage 2 (DOI 10.5281/zenodo.20360347) which locked qubits (15, 25, 56) against a 2026-05-23 calibration epoch and yielded the INDETERMINATE Stage 3 outcome (DOI 10.5281/zenodo.20360386) under the old gate. The present Stage 2c lock targets a fresh calibration epoch and a freshly-quality-ranked qubit triple, and the certified execution under this lock will produce a Stage 3c result-of-execution report.Files in this deposit:uct_prediction_2_pregist_stage2c_fez.md — platform pre-registration document (SHA-256: f37062bc98e9429ffe6e92fea135ad6ff729a56c00606337747872d0a4b00dc9, 10320 bytes)ibm_fez_cal_snapshot_2026-05-26.json — locked Fez calibration snapshot (SHA-256: 3f69b12d793b7c0cfc1f7cb343b3a0b8c40f04ae3a6239f7e3edd48192dadd1d, 19485 bytes)Calibration validity window: Fez job to be submitted within 24 hours of snapshot time (by 2026-05-28T02:18:29Z). Beyond that window this Stage 2c is invalidated and a fresh Stage 2 must be deposited.Lock chain:Stage 1: 10.5281/zenodo.20360004Stage 1b: 10.5281/zenodo.20360259Stage 1c: 10.5281/zenodo.20404635 (gate authority)Stage 2: 10.5281/zenodo.20360347 (historical — different qubits and cal epoch)Stage 3: 10.5281/zenodo.20360386 (INDETERMINATE under old gate — preserved as historical record)
Version 2: pre-registration addendum for Phase D Outcome of the registered gate (G0) The G0 gate failed for every dataset, window family and null. No twin built from independent error mechanisms with circuit-local supports reproduces the bulk of the window-count distributions in the public data from Google Willow, Google Sycamore or Rigetti. For larger codes the twin cannot even be simulated. As the protocol requires, hypotheses H1–H3 are therefore not tested. This version adds pre-registration addendum 1. It fixes the analyses run instead, before either touches the test halves: • Model-free certificate (T3), on the test halves. It covers every registered configuration that has a circuit (the Google archives and Rigetti D6e). Windows are whole-patch windows of 1 and of 5 rounds, separated by one unused round, and the disjointness of their fault-location sets is checked from each circuit. Each stratum (archive, code family, code distance, window family) gets a premise curve ε_lo(k) on the grid k = c·j, j = 1–16, with Bonferroni correction at family-wise α = 0.05.• Threshold values for the certificate. ε* = 7.4 × 10⁻⁴ (Fowler, PRL 109, 180502, 2012) is the primary value; 2.73 × 10⁻⁵ (Aliferis, Gottesman and Preskill, QIC 6, 97, 2006) is a sensitivity check. Certificates against ε* are computed for surface-code strata only. Repetition-code, colour-code and stability strata get premise curves only.• Bursts. The primary analysis uses all windows; a secondary one excludes the windows flagged by the frozen burst classifier. B1/B2 event rates are reported descriptively.• Cat-qubit case study (exploratory). The model-based premise meter is applied to the AWS cat-qubit (D4) distance-3 configurations whose twin was simulable in G0. It reports R(k) intervals and k_cert, with the H1 reading (consistent if R_hi ≤ 3 for all k ≤ k_cert). It is labelled exploratory because D4's own G0 verdict is a fail. Status of the data when version 2 was created G0, which uses only the bulk bins, has run on the test halves. Its stored histograms include tail bins, but no tail statistic has been computed or examined. Both new analyses were dry-run on fit halves as pipeline checks. One choice was made after that dry run, and it is recorded in the addendum: ε* certificates were limited to surface-code strata, and strata were split by code family. The dry run had shown repetition-code and stability strata crossing ε* at k = c, i.e. at their base error rate, where Fowler's surface-code theorem does not apply. The model-based certification horizon is not computed, because it needs a twin tail. Files added in version 2 • phaseD_addendum.json: the machine-readable addendum. SHA-256: a458bcb40aa474d94a882a563a38a1a152d7bfb4404df9299f99fb020ab78834• ADDENDUM.md: the readable version of the addendum.• qpremise_code_phaseD_ade59b0.zip: the code that will run. The addendum's code_sha256 (794122ae1557c009664127e1c2e6b109781d5a71efcc566bc637b991c0403ab6) can be recomputed from it as the SHA-256 over the files matching qpremise/**/*.py, phaseD/scripts/*.py and phaseC/scripts/run_g0.py, taken in path order: each file's relative path, then its bytes with LF line endings.• SHA256SUMS_addendum.txt: checksums of the three files above. The version 1 files are unchanged. The original registration text follows. ──────────────────────────── Version 1 registration (2026-10-01) What this registers The analysis protocol of the premise meter. It tests whether public quantum-error-correction syndrome data agree with an independent-noise "twin" fitted to the same data. It also measures how far each dataset can certify the local-stochastic premise of the threshold theorem. Every analysis choice is fixed in frozen_protocol.json:• configuration eligibility, and the pre-registered subset in g0_selection.json;• the interleaved fit/test split;• the window families;• twin construction: candidate mechanisms from each circuit, an exact parity-moment fit, and a signed quasi-probability simulation with local weights;• the G0 gate decision rule;• the burst classifiers B1 and B2 with their validation targets;• the excess-tail-ratio interval and the certification-horizon conditions;• the model-free certificate's window rule. qpremise_code_at_freeze_79dbf14.zip holds the analysis code at the freeze. The protocol's code_sha256 can be recomputed from it: the SHA-256 over every qpremise/**/*.py file in path order, each file's relative path followed by its bytes with LF line endings. Hypotheses analysed after this registration (on test halves only) H1. After removing windows flagged by the frozen burst classifier, the excess tail ratio R(k) = P_obs(K ≥ k) / P_twin(K ≥ k) has an upper 95% confidence bound ≤ 3 for all k ≤ k_cert. Failure: a lower bound > 3 that replicates on the held-out half. H2. Including burst windows, R(k) > 10 for k ≥ k_b in at least one dataset, and a burst-mixture model fitted to the flagged windows predicts the published repetition-code error floor within a factor of 10. H3. The empirical horizon (power ≥ 0.8 at α = 0.05 against a factor-5 excess) agrees with the exact binomial computation within ±1. At least one dataset certifies k ≥ 10 in whole-patch windows. These are evaluated only on (dataset, window family) pairs that pass the G0 gate under both the stationary (N1) and drift-aware (N5) twins. The model-free certificate (T3) does not depend on the twin. Its threshold ε* is fixed before any certificate is computed. Timing and what had been seen Frozen 2026-10-01 17:31 IST (git commit 79dbf14). Before the freeze, only fit halves had been analysed. The G0 gate (bulk of the window-count distributions only; decision rule frozen) began on the test halves minutes after the freeze. When this record was created, no tail statistic (R(k), H1–H3, burst rates, certificates) had been computed from the test halves, and their tail bins had not been examined. The planned cloud-hardware contrast experiment (H4, H5) is not part of this registration and will be registered separately before any hardware run. Full details are in PREREGISTRATION.md. Protocol SHA-256: 5f7458cfdbe0e203fd9e2bf5d579703509c8374bae53096c37f8f1530540707a
Two registered experiments with the QITE equilibrium law on the IBM Heron processor ibm_marrakesh, one day apart in nothing but the place where the law runs: outside the processor on a microcontroller board, and inside one shot in the processor's own feed-forward. Each experiment has its own registration, hashed before its first registered job, its own frozen scripts, complete raw data, verdict and write-up; the two archives in this record are independent of each other. QITE Hold (zenodo_qite_hold_20260923.zip, SHA-256 97853e20d86c146c16d6011191e9c038dddc743dfd5392476993187654f6e1d3; write-up custodia_paper_v1.pdf; working name Custodia). A microcontroller board (ESP32-C3) holds one pair of numbers per qubit for 144 qubits and turns each pair into a rotation angle. Every tick, one circuit of 144 single-qubit rotations is measured 4096 times; the fraction of ones per qubit goes to the board, the board updates its numbers by its fixed law and returns the angles of the next circuit; it never reads the processor's calibration. A registered programme of eight blocks ran over 280 ticks and 290 jobs: square waves, a hold, a staircase, a checkerboard of 18 zones up and 18 down, two state shocks written into the board, two disturbances written into the circuits, and a comparison with an open-loop reference of frozen angles. Of the seven binding lines, six were run and held; the seventh (drift against the open-loop reference) could not be run because the device did not drift by the registered minimum. The square waves came back with a gain of 0.231 of the commanded swing (the law: 0.25), the checkerboard put 98.5 % of (tick, zone) pairs on the commanded side, the disturbances were rejected to 0.557 and 0.539 of their open-loop size (the law: 4/7). A first registration (v1.0) ended at tick 130 through a design flaw of the host and is included in full. Registration SHA-256 1de82ab12a53c1da349196e8ef07851e6b2f176efc6bd1ca6ba14cacd1f7d54b. QITE In-Shot (zenodo_qite_inshot_20260923.zip, SHA-256 a087f88a95f17c6f8023d5ff40aff35901b5e3e87db531dcd76728511f7ae944; write-up qite_inshot_paper_v1.pdf). On each of 54 qubits, twenty rounds of a measurement followed by a rotation conditioned on that measurement, with angles that set the target level and the memory g; the records of a qubit form a two-state Markov chain whose second eigenvalue is 1 - g. The lines test that eigenvalue, not the level: the autocorrelations of the records for g = 0.3, 0.6 and 1.0 were +0.607, +0.366 and +0.046, the two memories in the ratio 1.657 (the law: 1.75); the relaxation from |0> came back at 0.690 and 0.446 per round (the law: 0.70 and 0.40, lowered by T1 during a round); a step of the target proceeded at 0.658 per round and, with g = 1, completed in one round; a kick of the state was followed by a return to within 0.012 of the unkicked hold; over the same twenty rounds an open-loop state lost 0.451 while the closed loop held within 0.006; 98 % of the qubits with a clean read-out showed their own rate within the registered band. All seven binding lines held; 17 jobs. The size is what the service's compiler accepted on the day (144, 72 and 64 qubits failed with an internal compiler error; every attempt is recorded with its job id). Registration SHA-256 51933de4196bfdd7998e6a5305f7576bb7d35ac137e8b6ce0109965372b4fe5c. Nothing here is a claim of quantum advantage: the observables are classical bits and the circuits contain no two-qubit gate. The claim of both experiments is one of control: a fixed law, registered in advance, holding a public quantum processor at commanded levels with the numbers the law says, once from a board over minutes and once inside the coherence time of the qubits. The board's firmware and the serial link layer are not part of the record; both are identified by their SHA-256 in the registration of QITE Hold. Licence: CC BY 4.0.
Eight verified quantum computing jobs executed on IBM Quantum hardware (ibm_fez Heron R2, 156 qubits; ibm_torino Heron R1, 133 qubits) between January 27 and March 15, 2026. User ID: IBMid-692001DJRD. Experiments include: 1. Bell State Entanglement — 96.3% fidelity on ibm_fez Heron R2 (Concurrence C = 0.926, Tangle T = 0.858, 1,000 shots). Cross-platform benchmark: Heron R2 vs Heron R1 (+8.3 pp fidelity advantage, noise ratio 2.43×). 2. Reproducibility Test — Two independent runs of identical circuit (χ² = 2.70, p = 0.44, df = 3). H₀ not rejected: statistically indistinguishable results at 95% confidence. 3. BB84 Quantum Key Distribution — Full Alice/Eve/Bob protocol implementation. Alice baseline error 0.60% → Bob QBER 49.0% under eavesdropping (82× degradation). Experimental demonstration of the quantum no-cloning theorem. Control group design isolates eavesdropper signal from hardware noise baseline. 4. Variational Quantum Circuit (VQC) — 2-qubit circuit, 10 trained parameters with tied weights (θ₃ = θ₄), 8 CZ gates in 4 entangling layers. 4-qubit ansatz: Shannon entropy 3.885/4.000 bits (97.1%), ground-state bias confirmed (χ² = 300.94, p ≈ 0). 5. Quantum Random Number Generation (QRNG) — 8-bit outputs, 10/10 unique values per shot (range 16–254). Total: 39,010 quantum measurements across 8 jobs and 10 circuits. QPU time: 4.8 seconds. Job completion rate: 100%. All results decoded from raw IBM SamplerV2 BitArray binary archives (zlib + base64 + NumPy .npy pipeline). No simulations. Statistical validation applied throughout (Wilson 95% CIs, chi-squared tests). Stack: Qiskit Runtime SamplerV2 · QPY · OpenQASM 2.0 · Python · NumPy · SciPy Repository: https://github.com/dinohatibovicWhitepaper: https://dinohatibovic.github.io (Doc QAI-WP-2026-01-28-V4)
Stage 2 platform-and-execution lock for the (Z_2)^3 branch of the UCT compression-interface theorem at d = 3 / m = 3, to be tested on IBM Fez. Companion to Stage 1 (DOI 10.5281/zenodo.20360004) and Stage 1b (DOI 10.5281/zenodo.20360259). Locks: backend = ibm_fez; qubits = [15, 25, 56]; calibration epoch = 2026-05-23T21:39:41Z (calibration CSV SHA-256 ca91f71a3e81d97e51c082ea95326f222963c6186ac1b470bb3495aac1901c4a); analysis script uct_d3_fez_test.py SHA-256 69e5f1dd042f53545e10102d1a14e2d8a3c340ac40bf177a81e053ad724272a0; N_each = 16000; bootstrap seed = 20260523; SVD threshold fraction = 0.05. Architecture is (Z_2)^3 per Stage 1b Section 4.3 (Z.1–Z.5 satisfied). This deposit tests the (Z_2)^3 discriminator branch with predicted f = 7/8 = 0.8750; U(3) primary prediction remains locked at Stage 1b awaiting qudit-capable hardware. Job to be submitted within 24-hour calibration validity window. Result reporting commitment includes INDETERMINATE outcomes at equal prominence. SHA-256 of Stage 2 pre-registration file: 2ec0a56f83541ab93ee843382591c0172dab49e8c7a1b55c94306e02dfdd2a2dByte count: 7334