Examines a new method for residue hunt in quantum computing, suggesting implications for future discoveries.
We deposit, prior to any hardware execution, a fully frozen preregistration for a residue hunt on IBM Quantum processors. Legible (redundant) and globally scrambled records of the same which-path bit are each compared against their OWN frozen quantitative standard prediction (a modular rival built from Sagawa-Ueda / del Rio / Faist conditional-information bounds, the programme's Hamming-decay theorem placed on the rival's side, and a three-component calibrated noise model), under a certified-equal local channel on the source. The dimensionless primary observable is xi_0 = deficit of recoverable information per minted accessible bit, preregistered as a candidate phenomenological coefficient WITHOUT a-priori derivation (Theory Sprint verdict, sealed with an anti-post-hoc lock). Written death conditions include a sign NO-GO, a powered bound NO-GO with a pre-drafted negative title, and INDETERMINATE-by-model/-by-power states. The claimed novelty is methodological; within the declared sweep (general search engines and accessible academic repositories; no structured Scopus/Web-of-Science sweep was performed) no occupant of the full crossing was located; any physical novelty depends exclusively on an out-of-sample residue surviving a frozen rival and a discovery-to-prediction ladder. Phase-0 modules (M0-M3) use placeholder calibration and validate implementation, identifiability, decision rules and synthetic power; they are not hardware data and constitute no evidence for or against a nonzero xi_0. The IBM Calibration Lock will be deposited as a new version of this record, under the same concept DOI, before any confirmatory hardware block.
No takes yet. Share an insight, caveat, or question.
Arturo Cerezo (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: