Boundary equivalence, practical detectability and physical memory are different properties of an experiment. We separate them on an exactly reproducible six-vertex reciprocal network. Complete passive boundary data are invariant along an SO(3) family of internal Laplacians. Two closed controls induce non-commuting fibre transports, yet their order is exactly invisible to the passive experiment. An active boundary readout sees the commutator only at fourth order in loop side and linearly in readout-symmetry breaking, so its fixed-noise repeat burden is of order rho^-2 ell^-8. For a known binary alternative, the equal-block-cost optimum is repeated use of the single block with the largest whitened projection; no multi-block protocol can beat this by root-mean-square aggregation. At the reference operating point a Gaussian detector requires 287 blocks and a sign-quantised detector requires 451, reproducing the classical hard-limiter penalty. We then construct a physical observer rather than infer one from sample complexity. A raw sign tape and its 452-state sufficient count have terminal reset entropies of 450.3006 and 6.16795 bits but the same closed-computation ledger: compression moves erasure earlier rather than removing it. A 39-state sequential accumulator reaches error 0.075246 in 244.836 expected blocks. Source-matched finite-time reset protocols obey local detailed balance exactly and yield reproducible work and heat distributions. Finally, finite carrier coherence imposes a threshold correlation time below which the required evidence cannot be accumulated at all, independent of precision. An exactly non-zero, rationally certified interior distinction can therefore be permanently unusable to a finite-coherence observer. The contribution is not the general claim that boundaries underdetermine interiors, which is classical. It is a certified finite example linking non-Abelian quotient geometry, fourth-order readout, eighth-order evidence, finite-state inference, physical reset and a maximal future-decision deficiency, without identifying any two of those levels. This deposit contains the manuscript in PDF and DOCX form together with the complete evidence archive: frozen parent Gate 4 and Gate 5 inputs, production and verification code, all machine-readable tables, 150,000 trajectory records, publication figures, and SHA-256 checksums. The verifier passes 37 numerical and structural checks.
Boundary equivalence, practical detectability and physical memory are different properties of an experiment. We separate them on an exactly reproducible six-vertex reciprocal network. Complete passive boundary data are invariant along an SO(3) family of internal Laplacians. Two closed controls induce non-commuting fibre transports, yet their order is exactly invisible to the passive experiment. An active boundary readout sees the commutator only at fourth order in loop side and linearly in readout-symmetry breaking, so its fixed-noise repeat burden is of order rho^-2 ell^-8. For a known binary alternative, the equal-block-cost optimum is repeated use of the single block with the largest whitened projection; no multi-block protocol can beat this by root-mean-square aggregation. At the reference operating point a Gaussian detector requires 287 blocks and a sign-quantised detector requires 451, reproducing the classical hard-limiter penalty. We then construct a physical observer rather than infer one from sample complexity. A raw sign tape and its 452-state sufficient count have terminal reset entropies of 450.3006 and 6.16795 bits but the same closed-computation ledger: compression moves erasure earlier rather than removing it. A 39-state sequential accumulator reaches error 0.075246 in 244.836 expected blocks. Source-matched finite-time reset protocols obey local detailed balance exactly and yield reproducible work and heat distributions. Finally, finite carrier coherence imposes a threshold correlation time below which the required evidence cannot be accumulated at all, independent of precision. An exactly non-zero, rationally certified interior distinction can therefore be permanently unusable to a finite-coherence observer. The contribution is not the general claim that boundaries underdetermine interiors, which is classical. It is a certified finite example linking non-Abelian quotient geometry, fourth-order readout, eighth-order evidence, finite-state inference, physical reset and a maximal future-decision deficiency, without identifying any two of those levels. This deposit contains the manuscript in PDF and DOCX form together with the complete evidence archive: frozen parent Gate 4 and Gate 5 inputs, production and verification code, all machine-readable tables, 150,000 trajectory records, publication figures, and SHA-256 checksums. The verifier passes 37 numerical and structural checks.
A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the
What information about environmental memory must a quantum controller retain to guarantee a specified computational output? This preprint formulates that question in terms of task-sufficient process representations, intervention-valid predictions, stochastic clock laws, and explicit resource accounting. The central requirement is to preserve the outcomes and costs of the permitted decisions, with a stated accuracy contract and a finite-sample certificate. The paper connects two complementary lines of analysis. An operational construction studies Gaussian dephasing and controlled qubit tasks. A separate stochastic-clock analysis studies direct and inverse time changes, fractional relaxation, and the information that temporal coarse graining must transport. These constructions address related modelling questions but are not identified as a single microscopic noise model. The main elements are: Identical uncontrolled channels, different controlled responses. A continuum of Gaussian phase processes has the same uncontrolled coherence at every time and zero Breuer-Laine-Piilo backflow, yet different spin-echo responses. The construction shows why an uncontrolled channel family alone can fail to determine an intervention-dependent control decision. Task-sufficient equivalence and resource contracts. The manuscript defines a contract functional collecting accepted-output moments, acceptance probabilities, and physical costs over a declared policy family. Its finite linear task quotient identifies distinctions relevant to those predictions. Approximate sufficiency is accompanied by stability bounds that expose the sensitivity of conditional guarantees to low acceptance probabilities and small feasibility margins. Simultaneous finite-policy certification. Conservative confidence bounds certify conditional task bias and expected cost per accepted outcome after selection among a fixed, finite set of candidate policies. The assumptions include independent reset attempts, bounded observations and costs, and a trusted ideal reference. Failure to certify a candidate is explicitly distinguished from proof that no feasible physical policy exists. An explicit coarse-graining framework for stochastic clocks. The proposed decorated phase space records the process, permitted policy family, observable set, and clock law. The clock component transports stable laws under their natural scaling and relates domains of attraction to regular variation of waiting-time tails. Within the stated two-parameter clock-and-coupling family, the relaxation-rate direction scales with eigenvalue c^alpha. These clock results are placed in the established probabilistic renormalization literature; they do not establish hyperbolicity or convergence for the full decorated operator. A reset-sensitive fractional-relaxation calculation. Direct subordination of a quantum dynamical semigroup is distinguished from inverse-stable time change. For the latter, the paper compares uninterrupted evolution with independent renewal of the hidden clock and relevant environment. At half order and dimensionless rate one, the exact erfcx representation gives the short-time defect Delta(h) ~ 0.660989212585294 sqrt(h). The difference concerns the declared reset protocols, rather than a general assertion that every physical gate resets its environment. The reported classical benchmark uses ten candidate policies with explicit pulse depolarisation and separate X- and Z-expectation contracts. At the quasistatic endpoint, midpoint echo increases average identity-gate fidelity from 0.789293 to 0.990050. The fidelity crossover near r = 0.0467883 is distinct from the stricter X-task feasibility threshold r >= 0.9688074. For the selected Z-task input, dephasing is harmless and unnecessary echo pulses reduce the expectation. Conventional calibrated echo matches the best tested control performance; calibration, sampling, rejected attempts, and amortisation remain part of the resource account. Two questions are isolated as conjectures: boundedness of the task-quotient dimension along the coarse-graining orbit, and rigidity of the task quotient as a complete contract invariant. The manuscript specifies falsifiable numerical and experimental tests, including rescaled relaxation-profile collapse and finite tests of quotient-rank growth. It establishes no hardware advantage, scalable task-compression theorem, logical error-rate improvement, or error-correction overhead reduction. This illustrated version 2.0 contains 30 pages, four scientific figures, derivation and reproduction appendices, a methodological comparison with renormalization in one-dimensional dynamics, a glossary, and 58 references. The manuscript is dated 12 November 2026 and supersedes version 1.0 of 10 November 2026. The four figures show the uncontrolled/control-response contrast, task-dependent protection, finite-policy certification alongside dimensionless fractional relaxation, and the exact scalar clock-reset defect.
Exact computation becomes a reusable scientific result when the distinctions carried by its source surviveobservation, transformation and reuse. This volume develops that principle through the computationalframework of the Substrate Accumulation Model: complete state spaces, certified operators, signed Gramaccounts and retained histories. Source decompositions make exact joint spin densities through N = 5000tractable while preserving the original Hamiltonian and integer counts. Complete Schur constructionsexpose the information, residuals and terminal payments that subsequent calculations require.The arithmetic program has an exact floor-block evaluator with conditional O(N3/2 log N) traversal cost, ex-plicitly charged kernel and precision costs, and finite screened-remainder gains. Query-dependent featureminima and a quadratic source-independent norm obstruction identify useful compressions and a preciselimit of energy-only transfer. The global signed estimate required for the Riemann-hypothesis implicationremains open. In stochastic dynamics, complete source moments yield new signed-chain memory bounds,sharper resolvent references and a common positive ordinary-clock receiver. Optimal alternating sched-ules still lose an extensive gap at fixed duration, with a sharp reversible-sampling variance bound.The physical-source examples retain their full accounts. Continuum vector capacity, a classified paired-Write optimum and exact bank/storage costs separate recoverable work from its initial preparation. He-3response reveals a low intrinsic excitation invisible to one projector and supplies a thermal inverse withfinite error control. Confined compensated dynamics approach an invariant dark set; radiating-mode stabil-ity and whole-quadrupole action bounds retain their hypotheses. Certified JC1 polygon transport, rationalreceivers with controlled bit growth and optimal finite membership codes make the corresponding source-to-observation maps executable.Part 2 connects these results to actual GEN6 operations and Duck research records. The latest nativeservice ended early after a 4 GiB memory-limit failure; completed receipts, analytical proofs and missingnative outcomes are reported separately. All four complete contributions, failed attempts, corrected succes-sors and reproducibility sources remain available. Physical selection, calibration and reusable apparatuscosts remain explicit wherever the source law does not determine them.
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⊗Triω,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),UT⋆=inf2detΣTΩ. On the certified canonical branch, the sealed QTT target is η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.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.
A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.
A timing signature is not physics until its reference operator survives a representation audit. 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(RMSE0RMSE0−RMSETLS)=0.36015,P(TLSwins)=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 and Γ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. 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. 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 Fres, leakage diagnostic D, timing complement UT, 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.