We derive a full-Gram renewal law for first-return histories generated by unitary evolution. Recording every first-hitting time yields an isometry of the complete history that preserves the full Hermitian Gram matrix of a family of inputs, including all complex cross-correlations. The resulting balance separates finite exits from two positive residuals: amplitude trapped forever within a single excursion and amplitude undergoing infinitely many completed returns. The vanishing of their sum characterizes completeness of finite physical exits. For variable return sections, every positive labelled Gram record, together with prescribed trapping and persistent-tail Grams, admits a realization. For a stationary section of dimension
rsec, where the same first-return amplitudes act at every layer, all layer Grams satisfy a common linear recurrence of order at most
rsec2, and their generating functions are rational. The first
2rsec2 Grams determine the entire sequence within this class. A test of length
rsec decides whether the persistent tail vanishes and yields exponential decay; when the hidden residual is zero, it also decides completeness of finite exits. Recorded times define a positive matrix-valued measure. Its waiting-record Gram integrates to the delay moment, while radial readout reconstructs individual layer Grams and their moment hierarchy. The two-residual decomposition remains stable under controlled apparatus limits. A local q³D construction realizes finite exits, hidden trapping, persistent returns, and nonzero complex cross-terms within a single unitary apparatus.
We develop a self-contained geometry of averaging shared by changes of resolution and the evolution of history. On a finite weighted carrier, preservation of the mass of every block uniquely determines conditional averaging; the resulting operator is a positive orthogonal projection. Nested resolutions split fields into orthogonal detail bands and yield exact Pythagorean identities, including the full Hermitian Gram matrices of complex-valued families. A single binary readout transported along a reversible finite history generates an increasing cascade of memory windows. Successive projection increments are orthogonal, step entropy decreases with window length and telescopes to the information added by the complete history, while directed transition counts separate into a self-adjoint component and an anti-Hermitian component carrying orientation. Counts, compressions, and their Dirichlet forms aggregate exactly between adjacent windows, making refinement and coarse-graining two directions of the same orthogonal geometry. We then study dynamics and imperfect transport. Projection memory, Schur complementation, and moving resolutions arise from the same visible–hidden decomposition. Local compatibility defects telescope to the error of the complete transported history. Sharp margin estimates separate the irreducible loss caused by the initially hidden sector from the additional cost accumulated by sequential coarse transport. Under summable defects and transverse mixing, the transported history converges in operator norm. Under defects summable in Hilbert–Schmidt norm and isometric transport, it admits an exact defect-free shadow with an explicit correction cost and control of every finite full Gram. The resulting calculus connects distinguishability, multiscale averaging, memory, and stable history transport within one verifiable construction.
We determine how errors in a coherent receiver's outputs change the cost of calibrating an exponentially rare quantum component. For a smooth moment-matched phase family, one receiver exposes informative events that counting misses. The optimal robust cost follows an explicit curve: an ideal-cost plateau ends at a tail-mass threshold, then an increasing branch approaches the feasibility boundary. One stopping rule attains this exponent at every unknown label, even when conditional errors depend on the observed history. Near the boundary, the remaining contamination margin δ and an explicit midpoint variance v* determine a finer law. As δ and the error target α vanish, the minimax cost is 2v* δ⁻² log(1/α), without a relative-rate restriction for a fixed receiver. This coefficient governs fixed sampling and every fixed positive-moment cost of arbitrary randomized stopping; a single clean source forces the lower bound. A uniform theorem carries the constant to changing finite receivers under explicit margin conditions and gives a computable critical strip for the physical family. These laws locate the loss of efficient calibration and quantify the cost of approaching the last feasible regime. This author preprint includes the main manuscript, complete proofs, LaTeX sources and computational materials. Journal peer review has not been completed. The scientific files are preserved unchanged; author identity is provided in the record metadata and the accompanying README. Version V1.7. All files are embargoed until 1 February 2027, when they will automatically become publicly accessible. Bibliographic metadata are public.
What condition preserves full mass and readout when a sequence of approximations passes to a limit? For probability laws on Polish spaces and normal states on separable Hilbert spaces, we prove that tightness is equivalent to the existence of a single compactifying moment. This moment ensures uniform stability of bounded readouts. In the operator setting, the readout-stability conditions are also equivalent to tightness, while the exact tightness defect equals the singular mass of a suitable weak-* limit. Spectral filters recover tail laws and fractional moments from the full range of time scales. For classical–quantum instruments, one common tail condition preserves the final state, the outcome law and their correlations; for continuous records, it also controls local oscillations of the outcome density. A Pythagorean resolution identity relates the retained signal to the energy of unresolved details. Compatible full Hermitian Gram matrices pass to the limit together with their mixed entries and an exact decomposition into visible content and a dark tail. We also identify form inequalities under which physical energy produces the required compactifying moment. An anisotropic q3D torus provides a separate explicit realization with a finite-core cost
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.
How much quantum information must a sequential optical test retain, and how reliably must that information survive between source preparations? This paper gives preparation budgets and impossibility bounds that distinguish useful quantum storage from regimes where the classical sample order is unavoidable. Optical source and fully counted memory A fixed unknown normal state supplies independent, identical preparations on
m bosonic modes. The null consists of all pure Gaussian states with total mean photon number at most one. Alternatives have half trace distance at least
1/32 from every pure Gaussian state; neither their energy nor the comparison family's energy is capped. Mixed states and infinite photon tails are included. Each visit accesses one entire original once. The total quantum dimension retained between visits is at most
D, while classical records and computation are unrestricted. At every actual waiting interval, the entire register independently survives unchanged with known probability
a, or is erased with a classical flag. The quantity
ka(D,m) is the smallest deterministic original-preparation cap achieving worst-case error at most
1/3. Failed preparations, discarded trials and reserved positions are all charged. A retained register of
q qubits has
D=2q. An exact threshold for statistical advantage Without retained quantum information, the optimal sample order is
Θ(m). Along arbitrary growing-mode sequences, the precise criterion for improving that order is
ka(D,m)=o(m)⟺am→∞ and maD→∞. The two conditions express separate capacity and survival requirements. Arbitrarily large storage cannot reduce the linear sample order when
a=O(1/m), yet a survival probability tending to zero can still permit an advantage. Let
A=max{1,m2/D}. At the fixed energy and separation above, constants
c,C>0, independent of
m,D,a, give
cmin{m,A/a}≤ka(D,m)≤Cmin{m,A/a+min(a−2,m2/3)},0<a≤1. At
a=0, the sample cost is
Θ(m). For ideal memory the complete rate is
k1(D,m)=Θ(min{m,max(1,m2/D)}). With loss, the bounds match whenever
A≥min{a−1,am2/3}. For example,
a=m−1/6 and
D=⌈m11/6⌉ give
Θ(m1/3) preparations. The existence of sublinear advantage is fully characterized even where its optimal exponent remains bracketed: for
D≥m2,
a=m−1/2, the stated bounds are
Ω(m1/2) and
O(m2/3). Why the construction and converse fit the same resources A physical completely positive contraction combines first- and second-moment information before the next wait. Although the temporary pair output has order
m2 labels, only a positive register of dimension
m+1 is retained. The three-visit route requires
D≥m+1 and pays two actual survival events; a classical alternative handles the centering statistics. The converse covers arbitrary adaptive instruments and persistent noncommuting memory. Erasure removes the coherent prediction contribution while preserving information already learned in the full classical history. Unflagged noise and applicability For a fixed memoryless channel on the entire retained register with a physical reset decomposition
N=aΨ+(1−a)Rτ, where
Ψ is CPTP and
Rτ(X)=Tr(X)τ, an exact flagged-erasure simulation gives
kN(D,m)≥ka(D,m). The established positive quantum Doeblin coefficient optimizes this lower obstruction. Whole-register depolarizing noise with unchanged fraction
1−q=O(1/m) therefore forces
Θ(m) samples for every memory dimension. General unflagged noise inherits a converse, not the flagged model's complete achievability guarantees. The results quantify asymptotic preparation and persistent-memory resources under ideal visit-local control. Temporary auxiliary systems and gate complexity have no imposed budget, and the explicit sufficient finite-sample constants are conservative. The task is pure Gaussianity testing, rather than membership in the full family of mixed Gaussian states. The single integrated PDF contains the short main text, full proofs, four figures and precise resource accounting.