A persistent internal state can retain preparation information without improving prediction of achosen output. We construct a finite-time comparison, under matched dynamics, between theconditional risk of a policy that reads the record once and the worst-preparation risk of everypredictor restricted to one common output law. Separately controlled reference and policy-riskbudgets turn elementary metric separation into a sufficient certificate of predictive advantage.For a stochastic Schlögl network, a coupling stopped at record-band exit combines write failure,escape and the accumulated variation of reporter rates. An analytic boundary-crossing boundtransfers these budgets from a finite-capacity chain to the unbounded count process. The selectedchemical point gives certified upper and lower risks of 0.04423 and 0.13845. An engineeredbound-pair model gives corresponding trace-distance bounds of 0.06683 and 0.28242. For thesame stored channel distinction, a fixed position measurement retains a positive certificate, whilemomentum measurement has exactly zero separation. These results distinguish persistence ofa record, access through a reading policy and predictive effect on a selected observable. Forthe charge-field programme, which separates inherited identity from active internal degreesof freedom, the comparison supplies a calculable test of finite-time record-based constraint.Chemical reporter feedback is neglected; quantum preparation and detection are specified modelinputs. The capacity bound controls state-space truncation separately from numerical integrationerror.
A persistent internal state can retain preparation information without improving prediction of achosen output. We construct a finite-time comparison, under matched dynamics, between theconditional risk of a policy that reads the record once and the worst-preparation risk of everypredictor restricted to one common output law. Separately controlled reference and policy-riskbudgets turn elementary metric separation into a sufficient certificate of predictive advantage.For a stochastic Schlögl network, a coupling stopped at record-band exit combines write failure,escape and the accumulated variation of reporter rates. An analytic boundary-crossing boundtransfers these budgets from a finite-capacity chain to the unbounded count process. The selectedchemical point gives certified upper and lower risks of 0.04423 and 0.13845. An engineeredbound-pair model gives corresponding trace-distance bounds of 0.06683 and 0.28242. For thesame stored channel distinction, a fixed position measurement retains a positive certificate, whilemomentum measurement has exactly zero separation. These results distinguish persistence ofa record, access through a reading policy and predictive effect on a selected observable. Forthe charge-field programme, which separates inherited identity from active internal degreesof freedom, the comparison supplies a calculable test of finite-time record-based constraint.Chemical reporter feedback is neglected; quantum preparation and detection are specified modelinputs. The capacity bound controls state-space truncation separately from numerical integrationerror.
Quantum records may be well encoded upstream yet fail to support downstream inference when routing, decoder resources, memory, or comparison channels are restricted. We analyze finite routed quantum-record networks using task-specific Bayes risk. Three exact results provide the constructive core. First, a single Bell-coded pair supplied as the same complete input to GLOBAL and finite-round LOCC-late decoders yields the risk gap qμ/2, where q is pair-delivery probability and μ retained coherence; memory policy determines whether this access is preserved. Second, fixing local binary experiments with error rates 0.20 and 0.30, we determine the entire compatible joint-risk interval [0.15, 0.20] and an attaining decoder with minimax risk 0.20 that does not know the coupling. Third, a binary sufficient-statistic delivery law is attained by a three-record majority compression with nonzero raw risk, yielding a tight physical reconstruction defect. A generated-outcome model gives an exact receiver-availability boundary, while four reduced-description witnesses and continuity bounds delineate when source, state/resource, local-coupling, or clock/memory information is insufficient. The results distinguish record formation, receiver use, memory retention, and task-adequate comparison within standard finite quantum processes. Author manuscript, preprint version 1.0. This manuscript is not a peer-reviewed journal publication. A separate technical Supplement provides complete model definitions, proofs, channel specifications and numerical details. Reproducibility materials are available separately as Software release 1.3 on OSF: https://doi.org/10.17605/OSF.IO/5TDRB. The preprint and reproducibility record are separate, linked scholarly outputs.
Global preservation does not determine what a finite observer can recover. Observer-Dependent En-tropy Retrieval (ODER) makes the passage from preserved encoding to retained possession calculable through causal collection, joint access, and receiving dynamics. For finite Hayden–Preskill sources cou-pled to Schwarzschild propagation and a causal detector, we hold the source, late-radiation apparatus, and collection lifetime fixed. Across all 32 source states, optimal deterministic entanglement-recovery fidelity is at most 0.3308 without early radiation and at least 0.8476 with it. The upper bound applies to every decoder on the available registers, even when decoding computation is unrestricted. A controlled catcher carries this separation into memory; a separate two-site receiver retains a certified separation with finite switching and lossy storage. Independent identical zero-mean Gaussian rail noise admits an exact Pauli–erasure reduction at a specified coherent one-photon interface, yielding deterministic recovery certificates. A separate effective outgoing-field model shows how observer ordering depends on the matched time, incident stream, and receiver controls. Matched spectral trans-mission and mean delay leave finite-window access undetermined. A finite tensor-network (MERA) comparison likewise finds different reference information at identical collection size and individual inclusion probabilities. Removing disentanglers increases mean acquisition under both protocols while reducing their mean difference. Sharp access envelopes and an exact calibration-sufficiency criterion identify the missing information; an additional joint-collection statistic supplies a uniform recovery guarantee. In a five-carrier code, independently erasing collected shares reverses the ranking of two access protocols whose individual efficiencies remain matched. A reference-assisted verification construction shows that preserved encoding and reference erasure induce identical channels below its joint-access threshold and become distinguishable with sufficient access. Once collected, the diary correlations must enter memory and remain there. Uniform capture of an arbitrary collected register gives an exact conditional-mutual-information transfer law in the presence of early side information. Recorded progressive collection extends that channel to randomly admitted registers, with exact infor-mation dynamics and a finite-memory deadline certificate. A centered modular preparation attains the sharp strip-holomorphic activation envelope, and a finite receiver approximates its trajectory with explicit resource requirements. Programmable receiver tests and a staged BEC program connect these constructions to controlled measurements. The resulting standard is physical: the stated data must suffice to establish the claimed recovery or verification performance. The channel constructions determine when that standard is met and which additional measurement can settle an otherwise undetermined claim.
AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.
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.
This paper develops task-relative reader certification within Shadow Theory’s source–readout programme. It asks how many source copies are needed to validate a fixed quantum reader, and when access to its retained measurement records reduces that cost compared with observing only its final correct-or-incorrect decisions. The reader is fixed before validation and must return a sign after each complete experiment. A trusted evaluator knows the preparation label for scoring, while the reader does not. The analysis distinguishes terminal-error observations, records with trusted ancillary information, and readable measurement trajectories governed by a shared physical response model. For terminal-error validation, the paper establishes exact finite-budget tests and sequential likelihood tests, together with nearly matching information-theoretic lower bounds on expected source consumption. An unrestricted-record result shows why additional archived data alone need not improve certification: an advantage requires specified information or response constraints. A separate trusted-seed construction gives an exact information-projection test. The central quantitative comparison concerns a fixed fourteen-copy reader in a trusted shared-visibility family. To certify a maximum label error of one percent, a trajectory-based validator achieves a false-certificate probability of at most one in 1,048,576 and a nominal acceptance probability of at least 95 percent, using no more than 720,160 source copies. Under the same preparation and physical-response promises, every validator restricted to terminal errors and meeting the same acceptance requirement needs more than 1,992,371 source copies in expectation. At the exact nominal device, an uncapped trajectory-based test accepts almost surely with expected consumption below 254,746 copies. A separate robustness analysis extends likelihood-test validity to a quantified class of conditional response deviations. Finite-cap guarantees and expected stopping costs remain explicitly distinguished. The results demonstrate a certified resource advantage from access to retained classical measurement trajectories, rather than merely an improvement over one chosen terminal-error test. Supporting materials provide the fixed reader, exact certificates and reproducibility procedures. All guarantees depend on the stated preparation, response, information-access and deployment-stability assumptions. Certification concerns the nominated reader’s decision error; it does not establish complete quantum-instrument equivalence or identify an underlying source. The analysis uses standard quantum probabilities within Shadow Theory’s research programme.
We construct a source-matched reference calibration for distinguishing the coherent law h = 0 from the specified added generator h = J/25 in a finite quantum-record model. A complete-carrier transfer bound connects an accessible reference contrast to a delayed target contrast while retaining the original drift and actual law. On reference coverage and measured admission, restricting both hypotheses by the same observed reference band yields a directed target-set separation of at least 0.0071230619 whenever both compatible classes are nonempty. Rival worlds may have different admitted nuisance parameters. The constants are uniform over independently known finite lengths m >= 65, with tag 65, access prefix 1:32 and target deadline 25.02/J. Finite reference preparation and work/source reset satisfy the declared response budgets. Reset acts on the actual joint input and consumed supply, with the retained reference R exactly inert. It does not assign a universal reduced channel to correlated supplies. Under almost-sure conditional resource and supply bounds, the comparison extends to history-dependent acquisition. A prespecified rule, including abstention below the calibration threshold, has each-law unconditional wrong-declaration probability at most 2 exp(-6) + exp(-85/16) < 0.01. This is neither a posterior probability nor an error bound conditional on admission. The statistical step uses standard bounded-martingale concentration. Global target states and specified auxiliary supplies remain resources. Reset requires additional globally conditioned controls and has very large finite costs. The result is a conditional theorem for the two declared laws; it does not establish practical implementation or a unique diagnosis of fundamental collapse. A supporting Lean 4 companion contains 85 theorem declarations and 30 supporting definitions across Calibration, Operations and Risk. It provides checked scalar, sufficient-bound, resource-arithmetic and finite-history risk consequences under explicit premises. The companion has an executed Linux preflight and accepted returned macOS compilation, named-type and transitive-axiom evidence. The quantum constructions and conditional moment, filtration, tower and tail derivations remain written proofs or external premises; this is not an end-to-end formalization of the physical theorem chain. The original checked companion targeted author v0.4 and is carried forward unchanged, with its scope and execution chronology preserved.