Born-level marginals can remain stable while trial-resolved measurement records exhibit order- and rate-dependent signatures. Such sequence sensitivity is invisible to histogram-only analyses yet constrains which operational descriptions of measurement remain viable under controlled schedule manipulations. Building on the Δt-sweep schedule witness introduced in a companion Foundations of Physics submission, this preprint poses a quantitative question: how much trial-resolved memory is minimally required to support the observed sequence sensitivity while remaining compatible with Born-stable marginals? We introduce (i) trial-resolved memory witnesses based on conditional mutual information (with a computational proxy), (ii) operational procedures for extracting conservative lower bounds (“floors”) on memory and occurrence using drift-robust null constructions, and (iii) an exclusion ladder that organizes control requirements for separating readout-only, latency/DAQ, drift/interleaving, and weak-memory explanations. The contribution is an operational lower-bound framework; it does not identify a unique physical mechanism and makes no ontological commitment. Device-specific attribution is deferred to experimental implementations. This manuscript is a working preprint subject to revision.
Born-level marginals can remain stable while trial-resolved measurement records exhibit order- and rate-dependent signatures. Such sequence sensitivity is invisible to histogram-only analyses yet constrains which operational descriptions of measurement remain viable under controlled schedule manipulations. Building on the Δt-sweep schedule witness introduced in a companion Foundations of Physics submission, this preprint poses a quantitative question: how much trial-resolved memory is minimally required to support the observed sequence sensitivity while remaining compatible with Born-stable marginals? We introduce (i) trial-resolved memory witnesses based on conditional mutual information (with a computational proxy), (ii) operational procedures for extracting conservative lower bounds (“floors”) on memory and occurrence using drift-robust null constructions, and (iii) an exclusion ladder that organizes control requirements for separating readout-only, latency/DAQ, drift/interleaving, and weak-memory explanations. The contribution is an operational lower-bound framework; it does not identify a unique physical mechanism and makes no ontological commitment. Device-specific attribution is deferred to experimental implementations. This manuscript is a working preprint subject to revision.
This preprint proposes a minimal, platform-agnostic operational test to constrain the role of time in quantum measurement under Born-compliant outcome histograms. The work introduces a Δt-sweep protocol in which the only controlled intervention is the temporal window used to project trial-resolved measurement records into outcomes. A null class of readout-only, memoryless, projection-inert descriptions is defined, together with a decision-level schedule witness designed to detect sweep-order and sweep-rate dependence while preserving Born-level histogram stability. Drift-robust inference is achieved via drift-preserving block permutations and permutation-based confidence intervals. The contribution is deliberately limited to an operational constraint on model classes, conditional on future experimental implementation, without committing to any specific collapse dynamics or modified quantum evolution. ## Replication Independent experimental replications and platform implementations of the Δt-sweep / schedule-witness protocol are welcome. When reporting results, please cite the protocol-of-record and use the reference implementation above.
Quantum mechanics predicts outcome statistics via the Born rule, yet remains operationally under-specified with respect to how, and on what timescale, a single outcome becomes definite in an experimental record. In many platforms, identical Born-compliant outcome histograms can be produced either by a time-extended physical closure process, in which competing channels accumulate influence until a decision event, or by purely readout-level mappings and post-processing applied to measurement records. This under-determination motivates an operational question: which broad classes of readout-based explanations remain viable given finite-time, resolution-dependent data alone? Here we formulate an operational exclusion criterion relative to a broad null family of readout-only, memoryless models. In this null family, for each temporal resolution Delta t, the reported outcome is generated by a (possibly stochastic and nonlinear) mapping from a single-shot record R to an outcome Y, with no decision-level internal state persisting across Delta t settings and no dependence on sweep direction or parameter history. Under these structural assumptions, sweep-history dependence is excluded by construction. Using Delta t as a single experimentally controlled parameter, interpreted as an effective integration window, we define three operational quantities. The first is a Born distance D_B(Delta t), measuring the deviation between the observed outcome distribution at resolution Delta t and the corresponding Born-rule prediction. The second is a convergence-rate proxy gamma(Delta t), defined as the negative derivative of D_B with respect to the logarithm of Delta t, which quantifies the tendency toward convergence to Born statistics as temporal resolution is increased. The third is a hysteresis-based memory witness M(Delta t), defined as the absolute difference between Born distances obtained from increasing and decreasing Delta t sweeps. We then state a conditional trade-off for stateful closure explanations. Over Delta t ranges where these quantities are well defined, a positive convergence tendency gamma(Delta t) greater than zero is generically expected to be accompanied by nonzero path dependence M(Delta t) greater than zero. This expectation can be summarized by an upper bound of the form: gamma(Delta t) is less than or equal to C times M(Delta t), plus a correction term epsilon(Delta t). Here C depends on coarse structural features of the closure process, such as the number of competing channels and the sharpness of decision thresholds, while epsilon collects finite-sample and finite-resolution effects. An efficiency ratio eta(Delta t), defined as gamma(Delta t) divided by M(Delta t), is introduced as a diagnostic. Within the null family, where M(Delta t) is identically zero, any sustained claim of finite positive gamma necessarily drives eta to diverge, signaling incompatibility with the readout-only, memoryless assumptions. The framework does not propose new dynamics or modify quantum theory. Instead, it specifies an operational protocol and a coupled signature set whose robust observation would render the readout-only, memoryless null family insufficient as an explanation of finite-time Born convergence. Robustness controls, including sweep-rate variation, randomized Delta t ordering, and mapping-invariance checks, are outlined to separate decision-level path dependence from trivial instrumental artifacts.
Causal Residual Probability Expression and Gauge-Compatible Memory Geometry develops a self-contained framework for distinguishing available probability structure from its capacity to sustain physical expression through a specified channel. Its central contribution is to separate two requirements that are often treated together: the amount of active structure available and the persistence of relationships across separated times, positions, configurations, or scales. The paper constructs a normalized expression-capacity diagnostic from these requirements while keeping it distinct from probability itself, event occurrence, energy, force, amplitude, and detector response. Beginning with classical probability and covariance, the manuscript identifies two independent failure boundaries: the absence of active extent and the absence of relational persistence. It establishes, under stated regularity assumptions, how a residual that respects both boundaries must incorporate both requirements. Within an explicitly restricted minimal-structure class, this leads to a uniquely determined normalized diagnostic. The paper carefully separates this formal result from the physical expression postulate that gives the diagnostic its interpretation. That interpretation remains conditional on the completeness of the chosen channel and is subject to independent testing; it is not presented as a consequence of covariance analysis alone. A substantial methodological contribution is the specification of how the framework can be measured without introducing target-dependent definitions. The manuscript sets out covariance normalization, treatment of changing active dimensions, compatible comparisons between separated observations, and estimation from repeated matched realizations. It distinguishes properties of an ensemble from properties that can legitimately be assigned to individual configurations. It also requires retention of the underlying correlation record, recognizing that a single expression-capacity score cannot recover phase, orientation, internal structure, or a unique dynamical history. Preregistration, independent calibration, uncertainty reporting, and withheld evaluation are integral parts of the proposed protocol. The paper extends this construction to persistence across scales. It describes how matched microscopic histories can be followed through successive coarse-graining steps using a common feature space and declared identity-transport rules. This makes an important distinction between survival at each adjacent scale and survival across an entire scale sequence. Worked counterexamples demonstrate that repeated local success can coexist with cumulative failure. The resulting scale framework is explicitly application-dependent: its physical implementation requires a specified feature map, renormalization procedure, and retained active sector. To connect expression diagnostics with dynamics, the manuscript incorporates established exact projection methods into a gauge-compatible reduced-response architecture. It explains how degrees of freedom excluded from a chosen description return through retarded memory, while separating exact projection identities from subsequent approximations and physical interpretations. Gauge-invariant observables and appropriately transported comparisons are used to prevent changes of gauge frame from being mistaken for physical loss of persistence. The paper also distinguishes persistent correlation from genuine dynamical memory and distinguishes temporal ordering from relativistic locality. Within this architecture, the manuscript develops conditional applications to weak and strong interaction channels. For weak channels, it identifies the response conditions required for screened spatial behavior and separates screening range from detector thresholds and independently measured mediator masses. For strong channels, it specifies the additional requirements for stable transverse localization, surviving longitudinal support, finite tube energy, and a contribution to stored energy that grows with source separation. It treats Wilson-loop observables, string breaking, and enlargement of the relevant channel description as essential consistency checks. These constructions retain established electroweak and quantum chromodynamic content rather than claiming to derive particle properties or gauge structure from the diagnostic alone. The spectral analysis distinguishes the classical diagnostic from proposed expression operators and their action on physical states. It explains why positive expression capacity for every individual state does not, by itself, establish a common positive lower bound across all physical excitations. The manuscript formulates a conditional spectral-gap theorem and identifies the independent closure and energy-comparison requirements needed to apply it. It further separates intrinsic mass gaps from finite-volume effects, lattice cutoffs, thermal screening, material screening, and finite causal-history effects. Overall, the paper provides a structured theoretical and operational research programme linking probability-domain diagnostics, cross-scale persistence, gauge-compatible memory, and conditional field and spectral consequences. Its achievements include explicit definitions, formal results within declared assumptions, measurement protocols, worked counterexamples, control and falsification matrices, and clearly stated proof obligations. It does not claim a completed fundamental theory, an empirical confirmation of the framework, a derivation of observed gauge groups or numerical couplings, or a solution to the Yang–Mills mass-gap problem. Its intended contribution is a testable architecture that makes those remaining tasks precise and prevents conditional results from being presented as completed physical explanations.
This paper develops phase-sensitive source–readout constructions within Shadow Theory’s research programme. It asks how a relative-phase distinction, invisible in separate mode intensities, can be converted into stable detector records under bounded coupling, finite source lifetime and preparation uncertainty. A complete quantum instrument connects a two-mode source to a coherent reader and terminal detector flags. Every trial uses one original source preparation, with conclusive, null and loss outputs explicitly retained. The construction includes arbitrary inert reference systems and distinguishes coherent quantum outputs from classically registered records. The main results establish: • A sharp attainable limit on error-free conclusive detection under bounded coherent coupling and independent irreversible source loss. • A separate optimum for a bounded jump-hazard model, together with a finite collision realization, showing why the two apparatus models require different resource accounting. • An analytic minimax tradeoff between conditional error and guaranteed conclusive probability under joint amplitude, phase and visibility uncertainty, including uncertain upstream attenuation. • An exact separation between a calibrated entrance filter and uncertain common conversion dynamics, followed by sharp robustness bounds for imperfect matching based on controlled-path overlaps. The analysis keeps source preparation, reader dynamics, retained outputs and permitted measurement access explicit. Retaining a loss output or reference does not automatically make it accessible to the decoder, and agreement of detector counts does not establish equivalence of complete quantum outputs. The accompanying technical companion develops absorbing detector models, complete retained-output comparisons, finite charge-reference measurements, preparation-resource requirements, and calibration and adaptive monitoring methods. Supporting code and verification materials accompany the manuscripts. These are mathematical apparatus constructions within Shadow Theory’s source–readout programme, using standard quantum probabilities and stated preparation and control assumptions. The results do not derive the Born rule or establish a biological or consciousness mechanism.
This manuscript presents a methods-forward, operational protocol for evaluating whether any structured dependence remains in quantum-computing measurement records after explicit modeling of standard quantum and device-level mechanisms. Classical definiteness is defined at the record layer, and pre-record states are treated as predictive descriptions rather than as classical outcome facts. Within this operational stance, the protocol converts questions about outcome status and record formation into a falsifiable test program grounded in preregistered analysis rules and standard measurement telemetry. A locked null-model family is specified in advance, incorporating standard quantum dynamics together with documented device-level mechanisms including drift, correlated and non-Markovian noise, crosstalk proxies, and leakage indicators. The framework provides operational definitions, a conservative postulate set, preregistered endpoints, residual-adjudication criteria, negative controls, a fixed windowing discipline, and a bound-first reporting standard designed to yield informative constraints under null results. Any candidate contribution beyond the declared null family must appear as structured, reproducible residual dependence that survives the locked null family and the full residual-filter sequence. Version 4.4 refines the protocol specification, clarifies evidentiary boundaries, and strengthens the integration of the synthetic demonstration. The manuscript includes a fully specified classical simulation that executes the decision pipeline under controlled conditions. The synthetic study illustrates how the protocol classifies a bounded-null case, a measured-artifact case, a partial-artifact/unresolved-covariate case, an injected structured-residual case, and a failed-topology case. This demonstration establishes computational executability of the protocol and clarifies the behavior of the decision tree, but it does not constitute empirical evidence for any physical mechanism. Because the protocol relies only on standard measurement telemetry and preregistered analysis rules, it is directly implementable across contemporary quantum-computing platforms and does not depend on any single dataset, backend, or hardware realization. The manuscript is a specification paper: it defines a reproducible evidentiary framework for record-level claims, while large-scale empirical implementation, hardware benchmarking, and cross-platform replication remain subsequent studies.
We study whether local forgetting in finite-dimensional quantum memory can be composed into attenuation of information across a network. We first prove a reference-stable contraction for repeated partial-SWAP collisions between a system qubit and a memory qubit that is depolarized between collisions: for two joint system--reference states with the same reference marginal, the trace distance contracts over a two-collision block by a factor at most 1−ϵ, with ϵ=(1−λ)2sin2(2θ), uniformly in the reference system and its dimension. This estimate cannot simply be iterated across a branching structure, because the reference marginals required by the hypothesis are not preserved after the first stage. We therefore analyse one explicit branching channel (θ=π/8, λ=4/5) through its numerically recorded Pauli transfer tensor and derive conditional exponential attenuation bounds with rate at most about 0.73 per generation. These bounds are conditional on the correctness of the recorded transfer tensor and on a depth-three base case. Both have numerical support, but neither has yet been rigorously certified. We also prove, unconditionally, a single-path lower bound showing that the contraction coefficient of the depth-r channel is at least gr with g≈0.68. The channel is nearly single-path, so it only weakly tests composition, and we identify the missing ingredients for a discriminating test: symmetric children and reuse of memory. A final section reports finite-chain numerical diagnostics and a conjectured probe-mean formula for a reused-memory model; no theorem is claimed there. No Lieb--Robinson-type or spatial attenuation bound is established. Relationship to the Earlier Preprint The present work develops a substantially revised research program building on the earlier preprint, Lieb–Robinson Bounds and Entanglement Limits in Quantum Dynamics with Finite-Dimensional Memory, published on Zenodo on April 26, 2026. The earlier manuscript proposed a general memory-dependent Lieb–Robinson bound, including an effective propagation velocity and associated correlation estimates. The current work replaces that proposed theorem-level result with a mathematically established local result: reference-stable trace-distance contraction under repeated partial-SWAP collisions with depolarized finite-dimensional memory. Beyond this local result, the manuscript investigates whether such contraction can be composed into spatial attenuation. A branching-channel transfer-tensor framework is developed, with attenuation estimates stated conditionally on outstanding verification requirements. A separate shared-memory extension remains exploratory. The distinction between established, conditional, numerical, and conjectural results is made explicit throughout. In particular, the present manuscript does not claim to establish a general Lieb–Robinson-type or spatial attenuation bound. The overarching research question—whether local reference-stable forgetting can be composed into a general spatial attenuation bound for coupled system–memory networks—remains open.