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

Experimental Verdict Governance for Quantum Traction Theory

Attar Ali

Published Aug 3, 2026• 0 citations
Publisher

Abstract

When does an experimental null actually count against a theory? An experimental verdict is meaningful only when the intended physical object was built, ordinary alternatives were controlled, the covariance and power were adequate, and the analysis was frozen before the target was opened. This paper turns those requirements into an executable governance object for Quantum Traction Theory (QTT). The registered test object is \[ \boxed{ \mathfrak T=(\mathcal O,\mathcal P,\mathcal C,\mathcal D,q,\Sigma, H_0,H_{\rm QTT},\mathcal K) } \] and its eligibility is the logical product \[ \boxed{ G_{\rm eligible} =G_{\rm physical}G_{\rm ordinary}G_{\rm covariance} G_{\rm power}G_{\rm chronology}. } \] If any gate is zero, the packet is ineligible and carries no theory verdict. If all gates pass, the executor must retain five distinct possibilities: registered falsification, QTT candidate, qualified other/cross-channel anomaly, underpowered result, or ineligible packet. A reproducible effect outside the primary channel is preserved rather than silently discarded or relabelled. \[ \boxed{ \text{protect against wrong falsification} \Longleftrightarrow \text{protect against post-result theory immunization}. } \] The paper also defines a scope lattice: failure of a registered access row does not automatically falsify a source theorem or the whole framework unless a prospectively printed dependency theorem proves that propagation. The same discipline prevents a favorable but ineligible result from becoming evidence. The audit applies this standard to the current deposited QTT test families and provides prospective successor specifications for the older A2 tabletop and HVP blind-lock packets without altering their frozen targets, hashes, or historical seals. Stable anchors: Concept DOI: 10.5281/zenodo.21775175 Main book: Quantum Traction Theory: Main Book v10.01 Website: quantumtraction.org Included files: PDF paper, Version 1.0 Reconstruction ZIP containing LaTeX source, validator, audit table, example packet, metadata, render audit, and SHA-256 manifest

DOI
10.5281/zenodo.21775175

Related papers

Artian's Completed-Record Fan-Out and Timing-Access Reference Framework

Attar Ali

A timing signature is not physics until its reference operator survives a representation audit. \[ \boxed{ \mathcal C_V^\star=F_R^2, \qquad \mathcal U_T^\star=1-F_R^2, \qquad \mathcal C_V^\star+\mathcal U_T^\star=1 } \] This framework separates three objects that must not be merged: a completed historical event, the record support still accessible to a laboratory, and a separately calibrated timing observable. Standard quantum theory closes the optimized coherent-recovery envelope. QTT adds a distinct, falsifiable timing complement only after a physical intertwining certificate proves that the laboratory record operator and the central timing projector are the same physical object in two representations. A public 11,009-trace test of explanatory burden Version 1.4 executes the complete usable public archive associated with Gosling et al., Probing the memory of a superconducting qubit environment. Every trace is split chronologically into training, a discarded guard interval, and held-out testing. The ordinary one-TLS Solomon camera learns two rates per trace, while the memoryless comparator learns one. \[ \boxed{ \operatorname{median}\!\left( \frac{\mathrm{RMSE}_{0}-\mathrm{RMSE}_{\rm TLS}} {\mathrm{RMSE}_{0}} \right)=0.36015, \qquad P(\mathrm{TLS\ wins})=\frac{10{,}169}{11{,}009}=0.92370 } \] The fitted TLS camera is therefore a successful held-out effective model. Its resolved trajectory is not a parameter-free derivation: the values of \(\Gamma_q\) and \(\Gamma_{qt}\) are learned from each target-bearing trace's training segment. Version 1.4 makes that distinction machine-auditable through the target-fit burden vector \[ \boxed{ \mathbf B_M=(N_c,N_d,N_w,N_n,N_u,N_h), \qquad \mathbf B_M\ne\mathbf0 \Longrightarrow \text{the fitted output is not derived parameter-free.} } \] The QTT result A public QTT source statement from 12 November 2025, before the Gosling preprint, already required complete reset to erase distributed record support beyond the visible carrier. That statement contains no Gosling-fitted rate, hidden-mode count, target window, or trajectory coefficient. The resulting comparative verdict is \[ \boxed{ \texttt{QTT-ZERO-FIT-SOURCE-EXPLANATORY-VICTORY} \;/\; \texttt{TRAJECTORY-VERDICT-OPEN}. } \] This is a scientific victory at the source/ontology layer, not a claim that QTT has already predicted the same resolved qubit trajectory. The stronger same-observable verdict remains locked because the public archive does not independently provide the residual record fidelity \(F_{\rm res}\), leakage diagnostic \(D\), timing complement \(\mathcal U_T\), or physical intertwiner \(W\). The paper prints the exact next experiment that would close or falsify that bridge. Reproducibility 11,009 row-level held-out results are included. The 840 traces favoring or tying the memoryless camera are retained. No false significance is assigned to correlated sweep windows. All three official archive objects pass their published MD5 checks. The release verifier passes 30/30 scientific and provenance checks. Three adversarial reviews cover observable equality, leakage and selection, chronology, and claim scope. Version: 1.4 Concept DOI: 10.5281/zenodo.21902886 Author: Ali Attar Website: quantumtraction.org Reader anchors Completed-record timing blind test Dynamic-circuit record-timing extension Observation as Access Quantum Traction Theory: Main Book Gosling public data archive The PDF is the default preview. The reconstruction archive contains the LaTeX source, row-level CSV, public-data integrity receipt, chronology certificate, fit-burden certificate, analysis scripts, exact source checks, adversarial and render audits, metadata, and checksum manifest.

•Aug 12, 2026•2 citations

Observation as Access: A Quantum Traction Theory Dissolution of the Measurement Problem

Attar Ali

When does a laboratory record belong to the source, and when does it belong to the measurement camera? Stable concept DOI: 10.5281/zenodo.20114403 The paper's native algebra starts from a completed-address access law, not from a fitted collapse rate: \[ [\hat X,\hat P]=J\hbar(I-\hat M_w),\qquad \eta=\operatorname{Tr}(\rho\hat M_w),\qquad \Delta X\,\Delta P\geq\frac{\hbar}{2}(1-\eta). \] Observation is exact source-observer address co-location. Measurement is that event plus a calibrated pointer and a durable redundant record. Conditional Lüders projection is recovered as the laboratory description of the completed record; no stochastic collapse force, localization length, observer trigger, or target-fitted measurement coefficient is introduced. Version 11.0 closes the operational object behind the Access Law. A coherent-survival kernel and a positive unital address-centralization map construct a lawful central effect: \[ A_w(\mathfrak L) =I-Z_w\!\left[K_{\rm coh}(\mathfrak L)^\dagger K_{\rm coh}(\mathfrak L)\right], \qquad 0\preceq A_w\preceq I, \qquad \eta=\operatorname{Tr}(\rho A_w). \] For a complete physical instrument, the same independently constructed effect family carries an exact information identity, a thermodynamic work ceiling, and the registered uncertainty floor: \[ i_A=\frac1N I(K{:}Q),\qquad 0\le i_A\le\frac1N\sum_j h_2(\eta_j)\le h_2(\bar\eta), \] \[ w_E\le\bar w_R+\int_{s_R-i_A}^{s_R}T(s)\,ds, \qquad \Delta X_j\,\Delta P_j\ge\frac{\hbar}{2}(1-\eta_j). \] The theorem also proves \(i_A\neq\eta\) in general. An observed work gain cannot be inverted into a convenient QTT operator. The kernel, centralization map, complete instrument, and physical label transport must be frozen before either target is opened. When \(A_w^2=A_w=A_w^\dagger\), the original Central-Projector Representation Theorem is recovered exactly; no sharp result is retired. Retrospective receipt: 8,407/8,407 deterministic checks pass. Published information-thermodynamic work data and an independent finite-chain reconstruction confirm the standard state-plus-access work architecture. They do not by themselves test the QTT commutator. Prospective discriminator: the QTT-exclusive common-effect cross-lock is frozen in the Same-Central-Effect Work-Quadrature Loop Preregistration. It reads the work quadrature and coherent loop from one hardware module with no target feedback. Scientific result: a QTT zero-fit source-explanatory victory for the measurement ontology and common access object. The standard information-theory components retain their standard ownership; the completed-address source law, central effect constructor, and same-effect cross-lock are QTT-native. Version 11.0: 58 pages; named effect-level theorem; exact sharp-projector recovery; scalar-inversion no-go; retrospective access-work audit; prospective same-effect test bridge; three adversarial reviews passed.

•Sep 2, 2026•0 citations

QTT Carrier-Deletion Finite-Window and Timing-Access Blind Test Extension

Attar Ali

Erase the apparent carrier. Recover the qubit from its halo. Then ask a different clock. This preregistration separates an ordinary quantum-memory qualification from a distinct timing test. Test A evolves a logical qubit through a frozen local channel, physically resets its original carrier, and asks whether a finite surrounding window can recover it. Test B asks whether that independently reconstructed channel fidelity controls a separate timing-covariance frontier. Test A: where is the recoverable channel? \[ \mathcal R_i(\omega)=|0\rangle\!\langle0|_i\otimes\operatorname{Tr}_i\omega, \] \[ Q_{\rm del}=2F_{\rm avg}(\mathcal N_{\rm del},\operatorname{id})-1, \qquad \boxed{F_e^{\rm del}=\frac{1+3Q_{\rm del}}4.} \] Target-only and every smaller halo subwindow remain optimized counterfactuals. A physical reset, sham reset, hidden-record injection, boundary ladder, and complete terminal record are required before the recovery layer qualifies. Test B: does the memory verifier intertwine with an independent timing projector? \[ \boxed{W^\dagger M_eW=P_{\rm align}}, \qquad \eta_T=\operatorname{Tr}(\rho P_{\rm align}), \] \[ \mathcal U_T^\star =\inf 2\sqrt{\det\Sigma_{T\Omega}}. \] On the certified canonical branch, the sealed QTT target is \[ \boxed{ \eta_T=F_e^{\rm del}, \qquad \mathcal U_T^\star=1-F_e^{\rm del}. } \] No complement coefficient is fitted. Five fidelity corridors, a radius/depth ladder, one-third untouched holdouts, topology twins, full covariance, global five-sigma decisions, at least 95% planned power, and transfer to a second record technology are frozen before data. The external computation is a feasibility anchor, not the timing target An, Cao, and Cui report carrier-deletion recovery in a local kicked-Ising memory. Their result qualifies the plausibility of Test A. Their reported \(Q=0.516\) is explicitly forbidden from constructing Test B. The public source archive lacks the exact arrays and scripts, so exact replication remains pending. Five terminal outcomes INELIGIBLE_NO_THEORY_VERDICT REGISTERED_QTT_CONSEQUENCE_FALSIFIED QTT_CANDIDATE QUALIFIED_OTHER_OR_CROSS_CHANNEL_ANOMALY AMBIGUOUS_OR_UNDERPOWERED Any failed eligibility gate terminates without a theory verdict. A positive result requires the full multirung shape, not one selected point. An off-target anomaly is preserved rather than discarded or used as a post-hoc rescue. Immutable protocol seal eb0640b25c1d0bde56cacc7f25d9ce4304594833e4aa937ed50293a1faafc849 This is a separate sealed extension. It changes no target, threshold, classifier, protocol hash, or file in the parent test under concept DOI 10.5281/zenodo.21902885. Public anchors Completed-record fan-out and timing-access framework Observation as Access Quantum Traction Theory: Main Book External finite-window recovery paper The PDF is the default preview. The reconstruction archive contains the sealed JSON, classifier, eighteen-gate and raw-terminal templates, Stage-0 handoff, verifier, external audit, adversarial review, metadata, and checksums.

•Aug 14, 2026•0 citations

Observation as Access: A Quantum Traction Theory Dissolution of the Measurement Problem

Attar Ali

Collapse as conditioning on a recorded address sector Version: 4.0 First public release: 2026-05-11 Current release: 2026-06-26 Concept DOI: 10.5281/zenodo.20114403 Author: Ali Attar Website: quantumtraction.org Main book anchor: Quantum Traction Theory: Main Book v10.01 The measurement problem asks why a wavefunction that evolves smoothly appears to select one recorded outcome. This paper changes the primitive object: the laboratory wavefunction is not the source ledger itself, but a projection of a real- \(J\), address-indexed substrate amplitude, \[ \rho((x,n)\mid T). \] The laboratory wavefunction is the access readout \[ \Psi(x,\tau) = {1\over\sqrt{\mathcal N_\Psi}} \sum_{n\in\mathbb Z}\rho((x,n)\mid T(\tau)). \] Observation is address co-location, \[ a(S,T)=a(O,T)=n, \] and measurement is observation plus a calibrated durable record. The laboratory collapse rule becomes conditional access to the recorded sector: \[ \rho_{S\mid r}^{\mathrm{lab}} = {\operatorname{Tr}_{AE}\,\mathcal M_r(\rho_{SAE}) \over \operatorname{Tr}\,\mathcal M_r(\rho_{SAE})}. \] The access structure also gives the modified commutator and uncertainty floor \[ [\hat X,\hat P] =J\hbar(I-\hat M_w), \qquad \Delta X\,\Delta P \ge {\hbar\over2}(1-\eta), \qquad \eta=\operatorname{Tr}(\rho\hat M_w). \] The empirical timing/energy audit object is \[ R_{\mathrm{QTT}} = {\Delta t\,\Delta E \over (\hbar/2)(1-\eta)\Upsilon(N)} \ge1. \] Read this paper as a finite-access account of observation: no separate collapse force, no adjustable collapse rate, and no signalling channel from access modulation. The live experimental hinge is the locked variable- \(\eta\) Access-Law test.

•May 11, 2026•17 citations

QTT Record-Fan-Out Timing-Envelope Blind Test Preregistration

Attar Ali

A sealed timing test can only be judged after the physical reference operator is independently admitted. This preregistration separates ordinary coherent recovery from its independent timing test. The sealed object contains the observable, projector pair, camera, covariance, point hypotheses, and kill rule: \[ \mathfrak T=(O,P,C,D,q,\Sigma,H_0,H_{\rm QTT},K). \] Version 1.2 adds the upstream R0 representation gate. Before any of the numerical decision gates are evaluated, the candidate timing effect must be a bounded, idempotent, central physical projector on a declared direct sum and must remain unchanged under passive coordinate-seam relabeling. \[ G_{\rm eligible}=0 \quad\Longrightarrow\quad \texttt{INELIGIBLE\_NO\_THEORY\_VERDICT}. \] The historical hypotheses, ratio orientation, thresholds, terminal labels, and original protocol hash remain intact. A coordinate artifact is neither evidence for nor falsification of QTT; it is a failed representation preflight.

•Aug 12, 2026•1 citation

Preregistered Evaluation of an Upstream Conditioning Architecture in Quantum Error Correction

Cody Robert Gleason

This preregistration describes a confirmatory study of an upstream conditioning architecture in a quantum error-correction workflow. The project’s purpose is to test whether an intervention applied prior to the primary decoder produces a real and reproducible decoder-relevant effect, remains compatible with more than one downstream decoder family, generates a measurable exposed-observable statistical footprint, and improves or preserves performance across a preregistered regime rather than only at a single operating point. The study is intentionally limited to architecture-level evaluation, with the public claim set confined to exposed observables, frozen transformations, preregistered statistical tests, explicit negative controls, and bounded interpretation rules. The confirmatory design is organized around five preregistered tests: category existence, decoder compatibility, structural footprint, observable statistical signature, and regime robustness. Across these tests, the central comparison is between a baseline control pipeline and a conditioned pipeline in which the upstream intervention is applied while all non-conditioning settings are held fixed. The study uses frozen observables and frozen execution rules, including matched seeds, shot counts, code distances, physical error rates, geometry, and baseline decoder settings, so that any supported effect can be interpreted as evidence about the architecture under test rather than as a byproduct of post hoc tuning. To preserve a clean-room boundary, the registration restricts primary analysis to exposed, decoder-facing quantities only. These include logical failure, an exposed defect-count summary, and an exposed decoder-difficulty proxy, along with a locked scalar error-load construction derived from control-only standardization. The study does not rely on decoder-internal state variables, hidden confidence traces, or implementation-specific internal diagnostics in its primary confirmatory analyses. This structure is intended to let readers evaluate whether the architecture leaves a reproducible footprint in decoder-facing behavior without disclosing reconstruction-level mechanism details. Expected outcomes are defined in confirmatory rather than speculative terms. If the preregistered hypotheses are supported, the study is expected to provide evidence that an upstream conditioning intervention exists as a real architectural category in QEC, acts before the primary decoder, is compatible with downstream decoding, changes decoder-relevant exposed structure, and produces a reproducible observable statistical footprint in logical-failure behavior. If support is absent, mixed, or null, those outcomes will still be recorded under the frozen rules without rescue through post hoc metric changes, reweighting, or reinterpretation. In either case, the expected result of the registration is a bounded, auditable public record of whether this architecture class shows reproducible category-level behavior under a preregistered confirmatory design. The preregistration is not intended to establish a unique mechanism identity, identify a privileged implementation, disclose implementation-specific reconstruction details, or support claims about exact targeting logic, suppression laws, subset-sizing logic, telemetry-governed control, or broader cross-domain theory narratives. Public-facing interpretation is therefore intentionally limited to category validation and exposed-observable behavior. This is meant to support rigorous public evaluation while preserving strict clean-room limits around protected implementation detail.

•Jan 1, 2026•1 citation
When does an experimental null actually count against a theory? An experimental verdict is meaningful only when the intended physical object was built, ordinary alternatives were controlled, the covariance and power were adequate, and the analysis was frozen before the target was opened. This paper turns those requirements into an executable governance object for Quantum Traction Theory (QTT). The registered test object is [ \boxed{ \mathfrak T=(\mathcal O,\mathcal P,\mathcal C,\mathcal D,q,\Sigma, H_0,H_{\rm QTT},\mathcal K) } ] and its eligibility is the logical product [ \boxed{ G_{\rm eligible} =G_{\rm physical}G_{\rm ordinary}G_{\rm covariance} G_{\rm power}G_{\rm chronology}. } ] If any gate is zero, the packet is ineligible and carries no theory verdict. If all gates pass, the executor must retain five distinct possibilities: registered falsification, QTT candidate, qualified other/cross-channel anomaly, underpowered result, or ineligible packet. A reproducible effect outside the primary channel is preserved rather than silently discarded or relabelled. [ \boxed{ \text{protect against wrong falsification} \Longleftrightarrow \text{protect against post-result theory immunization}. } ] The paper also defines a scope lattice: failure of a registered access row does not automatically falsify a source theorem or the whole framework unless a prospectively printed dependency theorem proves that propagation. The same discipline prevents a favorable but ineligible result from becoming evidence. The audit applies this standard to the current deposited QTT test families and provides prospective successor specifications for the older A2 tabletop and HVP blind-lock packets without altering their frozen targets, hashes, or historical seals. Stable anchors: Concept DOI: 10.5281/zenodo.21775175 Main book: Quantum Traction Theory: Main Book v10.01 Website: quantumtraction.org Included files: PDF paper, Version 1.0 Reconstruction ZIP containing LaTeX source, validator, audit table, example packet, metadata, render audit, and SHA-256 manifest
A timing signature is not physics until its reference operator survives a representation audit. CV⋆=FR2,UT⋆=1−FR2,CV⋆+UT⋆=1 \boxed{ \mathcal C_V^\star=F_R^2, \qquad \mathcal U_T^\star=1-F_R^2, \qquad \mathcal C_V^\star+\mathcal U_T^\star=1 } CV⋆​=FR2​,UT⋆​=1−FR2​,CV⋆​+UT⋆​=1​ This framework separates three objects that must not be merged: a completed historical event, the record support still accessible to a laboratory, and a separately calibrated timing observable. Standard quantum theory closes the optimized coherent-recovery envelope. QTT adds a distinct, falsifiable timing complement only after a physical intertwining certificate proves that the laboratory record operator and the central timing projector are the same physical object in two representations. A public 11,009-trace test of explanatory burden Version 1.4 executes the complete usable public archive associated with Gosling et al., Probing the memory of a superconducting qubit environment. Every trace is split chronologically into training, a discarded guard interval, and held-out testing. The ordinary one-TLS Solomon camera learns two rates per trace, while the memoryless comparator learns one. median⁡ ⁣(RMSE0−RMSETLSRMSE0)=0.36015,P(TLS wins)=10,16911,009=0.92370 \boxed{ \operatorname{median}\!\left( \frac{\mathrm{RMSE}_{0}-\mathrm{RMSE}_{\rm TLS}} {\mathrm{RMSE}_{0}} \right)=0.36015, \qquad P(\mathrm{TLS\ wins})=\frac{10{,}169}{11{,}009}=0.92370 } median(RMSE0​RMSE0​−RMSETLS​​)=0.36015,P(TLS wins)=11,00910,169​=0.92370​ The fitted TLS camera is therefore a successful held-out effective model. Its resolved trajectory is not a parameter-free derivation: the values of Γq\Gamma_qΓq​ and Γqt\Gamma_{qt}Γqt​ are learned from each target-bearing trace's training segment. Version 1.4 makes that distinction machine-auditable through the target-fit burden vector BM=(Nc,Nd,Nw,Nn,Nu,Nh),BM≠0⟹the fitted output is not derived parameter-free. \boxed{ \mathbf B_M=(N_c,N_d,N_w,N_n,N_u,N_h), \qquad \mathbf B_M\ne\mathbf0 \Longrightarrow \text{the fitted output is not derived parameter-free.} } BM​=(Nc​,Nd​,Nw​,Nn​,Nu​,Nh​),BM​=0⟹the fitted output is not derived parameter-free.​ The QTT result A public QTT source statement from 12 November 2025, before the Gosling preprint, already required complete reset to erase distributed record support beyond the visible carrier. That statement contains no Gosling-fitted rate, hidden-mode count, target window, or trajectory coefficient. The resulting comparative verdict is QTT-ZERO-FIT-SOURCE-EXPLANATORY-VICTORY  /  TRAJECTORY-VERDICT-OPEN. \boxed{ \texttt{QTT-ZERO-FIT-SOURCE-EXPLANATORY-VICTORY} \;/\; \texttt{TRAJECTORY-VERDICT-OPEN}. } QTT-ZERO-FIT-SOURCE-EXPLANATORY-VICTORY/TRAJECTORY-VERDICT-OPEN.​ This is a scientific victory at the source/ontology layer, not a claim that QTT has already predicted the same resolved qubit trajectory. The stronger same-observable verdict remains locked because the public archive does not independently provide the residual record fidelity FresF_{\rm res}Fres​, leakage diagnostic DDD, timing complement UT\mathcal U_TUT​, or physical intertwiner WWW. The paper prints the exact next experiment that would close or falsify that bridge. Reproducibility 11,009 row-level held-out results are included. The 840 traces favoring or tying the memoryless camera are retained. No false significance is assigned to correlated sweep windows. All three official archive objects pass their published MD5 checks. The release verifier passes 30/30 scientific and provenance checks. Three adversarial reviews cover observable equality, leakage and selection, chronology, and claim scope. Version: 1.4 Concept DOI: 10.5281/zenodo.21902886 Author: Ali Attar Website: quantumtraction.org Reader anchors Completed-record timing blind test Dynamic-circuit record-timing extension Observation as Access Quantum Traction Theory: Main Book Gosling public data archive The PDF is the default preview. The reconstruction archive contains the LaTeX source, row-level CSV, public-data integrity receipt, chronology certificate, fit-burden certificate, analysis scripts, exact source checks, adversarial and render audits, metadata, and checksum manifest.
When does a laboratory record belong to the source, and when does it belong to the measurement camera? Stable concept DOI: 10.5281/zenodo.20114403 The paper's native algebra starts from a completed-address access law, not from a fitted collapse rate: [X^,P^]=Jℏ(I−M^w),η=Tr⁡(ρM^w),ΔX ΔP≥ℏ2(1−η). [\hat X,\hat P]=J\hbar(I-\hat M_w),\qquad \eta=\operatorname{Tr}(\rho\hat M_w),\qquad \Delta X\,\Delta P\geq\frac{\hbar}{2}(1-\eta). [X^,P^]=Jℏ(I−M^w​),η=Tr(ρM^w​),ΔXΔP≥2ℏ​(1−η). Observation is exact source-observer address co-location. Measurement is that event plus a calibrated pointer and a durable redundant record. Conditional Lüders projection is recovered as the laboratory description of the completed record; no stochastic collapse force, localization length, observer trigger, or target-fitted measurement coefficient is introduced. Version 11.0 closes the operational object behind the Access Law. A coherent-survival kernel and a positive unital address-centralization map construct a lawful central effect: Aw(L)=I−Zw ⁣[Kcoh(L)†Kcoh(L)],0⪯Aw⪯I,η=Tr⁡(ρAw). A_w(\mathfrak L) =I-Z_w\!\left[K_{\rm coh}(\mathfrak L)^\dagger K_{\rm coh}(\mathfrak L)\right], \qquad 0\preceq A_w\preceq I, \qquad \eta=\operatorname{Tr}(\rho A_w). Aw​(L)=I−Zw​[Kcoh​(L)†Kcoh​(L)],0⪯Aw​⪯I,η=Tr(ρAw​). For a complete physical instrument, the same independently constructed effect family carries an exact information identity, a thermodynamic work ceiling, and the registered uncertainty floor: iA=1NI(K:Q),0≤iA≤1N∑jh2(ηj)≤h2(ηˉ), i_A=\frac1N I(K{:}Q),\qquad 0\le i_A\le\frac1N\sum_j h_2(\eta_j)\le h_2(\bar\eta), iA​=N1​I(K:Q),0≤iA​≤N1​∑j​h2​(ηj​)≤h2​(ηˉ​), wE≤wˉR+∫sR−iAsRT(s) ds,ΔXj ΔPj≥ℏ2(1−ηj). w_E\le\bar w_R+\int_{s_R-i_A}^{s_R}T(s)\,ds, \qquad \Delta X_j\,\Delta P_j\ge\frac{\hbar}{2}(1-\eta_j). wE​≤wˉR​+∫sR​−iA​sR​​T(s)ds,ΔXj​ΔPj​≥2ℏ​(1−ηj​). The theorem also proves iA≠ηi_A\neq\etaiA​=η in general. An observed work gain cannot be inverted into a convenient QTT operator. The kernel, centralization map, complete instrument, and physical label transport must be frozen before either target is opened. When Aw2=Aw=Aw†A_w^2=A_w=A_w^\daggerAw2​=Aw​=Aw†​, the original Central-Projector Representation Theorem is recovered exactly; no sharp result is retired. Retrospective receipt: 8,407/8,407 deterministic checks pass. Published information-thermodynamic work data and an independent finite-chain reconstruction confirm the standard state-plus-access work architecture. They do not by themselves test the QTT commutator. Prospective discriminator: the QTT-exclusive common-effect cross-lock is frozen in the Same-Central-Effect Work-Quadrature Loop Preregistration. It reads the work quadrature and coherent loop from one hardware module with no target feedback. Scientific result: a QTT zero-fit source-explanatory victory for the measurement ontology and common access object. The standard information-theory components retain their standard ownership; the completed-address source law, central effect constructor, and same-effect cross-lock are QTT-native. Version 11.0: 58 pages; named effect-level theorem; exact sharp-projector recovery; scalar-inversion no-go; retrospective access-work audit; prospective same-effect test bridge; three adversarial reviews passed.
Erase the apparent carrier. Recover the qubit from its halo. Then ask a different clock. This preregistration separates an ordinary quantum-memory qualification from a distinct timing test. Test A evolves a logical qubit through a frozen local channel, physically resets its original carrier, and asks whether a finite surrounding window can recover it. Test B asks whether that independently reconstructed channel fidelity controls a separate timing-covariance frontier. Test A: where is the recoverable channel? Ri(ω)=∣0⟩ ⁣⟨0∣i⊗Tr⁡iω, \mathcal R_i(\omega)=|0\rangle\!\langle0|_i\otimes\operatorname{Tr}_i\omega, Ri​(ω)=∣0⟩⟨0∣i​⊗Tri​ω, Qdel=2Favg(Ndel,id⁡)−1,Fedel=1+3Qdel4. Q_{\rm del}=2F_{\rm avg}(\mathcal N_{\rm del},\operatorname{id})-1, \qquad \boxed{F_e^{\rm del}=\frac{1+3Q_{\rm del}}4.} Qdel​=2Favg​(Ndel​,id)−1,Fedel​=41+3Qdel​​.​ Target-only and every smaller halo subwindow remain optimized counterfactuals. A physical reset, sham reset, hidden-record injection, boundary ladder, and complete terminal record are required before the recovery layer qualifies. Test B: does the memory verifier intertwine with an independent timing projector? W†MeW=Palign,ηT=Tr⁡(ρPalign), \boxed{W^\dagger M_eW=P_{\rm align}}, \qquad \eta_T=\operatorname{Tr}(\rho P_{\rm align}), W†Me​W=Palign​​,ηT​=Tr(ρPalign​), UT⋆=inf⁡2det⁡ΣTΩ. \mathcal U_T^\star =\inf 2\sqrt{\det\Sigma_{T\Omega}}. UT⋆​=inf2detΣTΩ​​. On the certified canonical branch, the sealed QTT target is ηT=Fedel,UT⋆=1−Fedel. \boxed{ \eta_T=F_e^{\rm del}, \qquad \mathcal U_T^\star=1-F_e^{\rm del}. } ηT​=Fedel​,UT⋆​=1−Fedel​.​ No complement coefficient is fitted. Five fidelity corridors, a radius/depth ladder, one-third untouched holdouts, topology twins, full covariance, global five-sigma decisions, at least 95% planned power, and transfer to a second record technology are frozen before data. The external computation is a feasibility anchor, not the timing target An, Cao, and Cui report carrier-deletion recovery in a local kicked-Ising memory. Their result qualifies the plausibility of Test A. Their reported Q=0.516Q=0.516Q=0.516 is explicitly forbidden from constructing Test B. The public source archive lacks the exact arrays and scripts, so exact replication remains pending. Five terminal outcomes INELIGIBLE_NO_THEORY_VERDICT REGISTERED_QTT_CONSEQUENCE_FALSIFIED QTT_CANDIDATE QUALIFIED_OTHER_OR_CROSS_CHANNEL_ANOMALY AMBIGUOUS_OR_UNDERPOWERED Any failed eligibility gate terminates without a theory verdict. A positive result requires the full multirung shape, not one selected point. An off-target anomaly is preserved rather than discarded or used as a post-hoc rescue. Immutable protocol seal eb0640b25c1d0bde56cacc7f25d9ce4304594833e4aa937ed50293a1faafc849 This is a separate sealed extension. It changes no target, threshold, classifier, protocol hash, or file in the parent test under concept DOI 10.5281/zenodo.21902885. Public anchors Completed-record fan-out and timing-access framework Observation as Access Quantum Traction Theory: Main Book External finite-window recovery paper The PDF is the default preview. The reconstruction archive contains the sealed JSON, classifier, eighteen-gate and raw-terminal templates, Stage-0 handoff, verifier, external audit, adversarial review, metadata, and checksums.
Collapse as conditioning on a recorded address sector Version: 4.0 First public release: 2026-05-11 Current release: 2026-06-26 Concept DOI: 10.5281/zenodo.20114403 Author: Ali Attar Website: quantumtraction.org Main book anchor: Quantum Traction Theory: Main Book v10.01 The measurement problem asks why a wavefunction that evolves smoothly appears to select one recorded outcome. This paper changes the primitive object: the laboratory wavefunction is not the source ledger itself, but a projection of a real- JJJ, address-indexed substrate amplitude, ρ((x,n)∣T). \rho((x,n)\mid T). ρ((x,n)∣T). The laboratory wavefunction is the access readout Ψ(x,τ)=1NΨ∑n∈Zρ((x,n)∣T(τ)). \Psi(x,\tau) = {1\over\sqrt{\mathcal N_\Psi}} \sum_{n\in\mathbb Z}\rho((x,n)\mid T(\tau)). Ψ(x,τ)=NΨ​​1​∑n∈Z​ρ((x,n)∣T(τ)). Observation is address co-location, a(S,T)=a(O,T)=n, a(S,T)=a(O,T)=n, a(S,T)=a(O,T)=n, and measurement is observation plus a calibrated durable record. The laboratory collapse rule becomes conditional access to the recorded sector: ρS∣rlab=Tr⁡AE Mr(ρSAE)Tr⁡ Mr(ρSAE). \rho_{S\mid r}^{\mathrm{lab}} = {\operatorname{Tr}_{AE}\,\mathcal M_r(\rho_{SAE}) \over \operatorname{Tr}\,\mathcal M_r(\rho_{SAE})}. ρS∣rlab​=TrMr​(ρSAE​)TrAE​Mr​(ρSAE​)​. The access structure also gives the modified commutator and uncertainty floor [X^,P^]=Jℏ(I−M^w),ΔX ΔP≥ℏ2(1−η),η=Tr⁡(ρM^w). [\hat X,\hat P] =J\hbar(I-\hat M_w), \qquad \Delta X\,\Delta P \ge {\hbar\over2}(1-\eta), \qquad \eta=\operatorname{Tr}(\rho\hat M_w). [X^,P^]=Jℏ(I−M^w​),ΔXΔP≥2ℏ​(1−η),η=Tr(ρM^w​). The empirical timing/energy audit object is RQTT=Δt ΔE(ℏ/2)(1−η)Υ(N)≥1. R_{\mathrm{QTT}} = {\Delta t\,\Delta E \over (\hbar/2)(1-\eta)\Upsilon(N)} \ge1. RQTT​=(ℏ/2)(1−η)Υ(N)ΔtΔE​≥1. Read this paper as a finite-access account of observation: no separate collapse force, no adjustable collapse rate, and no signalling channel from access modulation. The live experimental hinge is the locked variable- η\etaη Access-Law test.
A sealed timing test can only be judged after the physical reference operator is independently admitted. This preregistration separates ordinary coherent recovery from its independent timing test. The sealed object contains the observable, projector pair, camera, covariance, point hypotheses, and kill rule: T=(O,P,C,D,q,Σ,H0,HQTT,K). \mathfrak T=(O,P,C,D,q,\Sigma,H_0,H_{\rm QTT},K). T=(O,P,C,D,q,Σ,H0​,HQTT​,K). Version 1.2 adds the upstream R0 representation gate. Before any of the numerical decision gates are evaluated, the candidate timing effect must be a bounded, idempotent, central physical projector on a declared direct sum and must remain unchanged under passive coordinate-seam relabeling. Geligible=0⟹INELIGIBLE_NO_THEORY_VERDICT. G_{\rm eligible}=0 \quad\Longrightarrow\quad \texttt{INELIGIBLE\_NO\_THEORY\_VERDICT}. Geligible​=0⟹INELIGIBLE_NO_THEORY_VERDICT. The historical hypotheses, ratio orientation, thresholds, terminal labels, and original protocol hash remain intact. A coordinate artifact is neither evidence for nor falsification of QTT; it is a failed representation preflight.
This preregistration describes a confirmatory study of an upstream conditioning architecture in a quantum error-correction workflow. The project’s purpose is to test whether an intervention applied prior to the primary decoder produces a real and reproducible decoder-relevant effect, remains compatible with more than one downstream decoder family, generates a measurable exposed-observable statistical footprint, and improves or preserves performance across a preregistered regime rather than only at a single operating point. The study is intentionally limited to architecture-level evaluation, with the public claim set confined to exposed observables, frozen transformations, preregistered statistical tests, explicit negative controls, and bounded interpretation rules. The confirmatory design is organized around five preregistered tests: category existence, decoder compatibility, structural footprint, observable statistical signature, and regime robustness. Across these tests, the central comparison is between a baseline control pipeline and a conditioned pipeline in which the upstream intervention is applied while all non-conditioning settings are held fixed. The study uses frozen observables and frozen execution rules, including matched seeds, shot counts, code distances, physical error rates, geometry, and baseline decoder settings, so that any supported effect can be interpreted as evidence about the architecture under test rather than as a byproduct of post hoc tuning. To preserve a clean-room boundary, the registration restricts primary analysis to exposed, decoder-facing quantities only. These include logical failure, an exposed defect-count summary, and an exposed decoder-difficulty proxy, along with a locked scalar error-load construction derived from control-only standardization. The study does not rely on decoder-internal state variables, hidden confidence traces, or implementation-specific internal diagnostics in its primary confirmatory analyses. This structure is intended to let readers evaluate whether the architecture leaves a reproducible footprint in decoder-facing behavior without disclosing reconstruction-level mechanism details. Expected outcomes are defined in confirmatory rather than speculative terms. If the preregistered hypotheses are supported, the study is expected to provide evidence that an upstream conditioning intervention exists as a real architectural category in QEC, acts before the primary decoder, is compatible with downstream decoding, changes decoder-relevant exposed structure, and produces a reproducible observable statistical footprint in logical-failure behavior. If support is absent, mixed, or null, those outcomes will still be recorded under the frozen rules without rescue through post hoc metric changes, reweighting, or reinterpretation. In either case, the expected result of the registration is a bounded, auditable public record of whether this architecture class shows reproducible category-level behavior under a preregistered confirmatory design. The preregistration is not intended to establish a unique mechanism identity, identify a privileged implementation, disclose implementation-specific reconstruction details, or support claims about exact targeting logic, suppression laws, subset-sizing logic, telemetry-governed control, or broader cross-domain theory narratives. Public-facing interpretation is therefore intentionally limited to category validation and exposed-observable behavior. This is meant to support rigorous public evaluation while preserving strict clean-room limits around protected implementation detail.