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.
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.
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.
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.
Operational theorem package: R′ (resolution), T′ (common-mode invariance), C′ (sub-bin curvature irrelevance), D′ (near-null registrar trivialization), H′ (horizon implementability) This record contains the final manuscript and supporting materials for a strictly operational analysis of quantum measurement in spacetime. Following the introduction of Quantum Measurement Timeline Framework (QMTF), in which a measurement is defined as a POVM statement on a declared spacetime target frameD* = R* × T* at finite resolution (Δx, Δt). An event is the realization of a single POVM effect E_U on one spacetime bin U; all dynamical relations among alternatives—including gravitational influence—belong to pre-event evolution. Within this orthodox setting, we prove a five-part operational theorem package: R′ (resolution). Finite operational resolution is derived, not assumed, from the metrological chain quantum Fisher information → Bures/Fidelity → total variation distance, yielding explicit Δx_min and Δt_min at any discrimination threshold ε_disc. T′ (common-mode invariance). Uniform time dilation or global phases are probability-irrelevant for any POVM; only differential phases can affect outcome statistics. C′ (sub-bin curvature irrelevance). Curvature variations confined below the declared resolution cannot change single-bin event probabilities beyond ε_disc. After Hadamard-controlled spatial and temporal smearing, such effects are common-mode or strictly sub-threshold. D′ (near-null registrar trivialization). With finite information rate, the boundTVD ≤ √(F / 8) · τ implies that no nontrivial discrimination is possible as the registrar’s proper-time budget τ → 0. H′ (horizon implementability). An exterior laboratory cannot implement POVM effects localized strictly in the interior algebra of a black-hole spacetime; interior bins have zero operational support for exterior observers. Together, these results close “gravity at the event” in the single-run semiclassical domain: gravity can only shape pre-event phases and support via proper time and cannot appear as an event-internal degree of freedom at any finite operational resolution. Each theorem is stated with explicit inequalities and clean falsifiers (sub-resolution curvature tests, near-null discrimination limits, and exterior-only interior implementability), ensuring refutability. The framework uses no assumptions beyond standard quantum mechanics (POVMs and instruments) and general relativity (proper time and locality) and is consistent with interferometric observations such as COW neutron interferometry and Kasevich–Chu atom interferometers, where gravity appears exclusively through differential pre-event phases. Keywords: POVM measurement; operational quantum measurement; quantum Fisher information; distinguishability bounds; Unruh–DeWitt detector; Hadamard states; proper time; semiclassical quantum mechanics and general relativity; algebraic quantum field theory; interferometry, QMTF. Author: R. Necsanu ORCID: 0009‑0009‑1281‑9180 Reference record (QMTF): Necsanu (2026), Zenodo 10.5281/zenodo.18262158
Questions about quantum measurement are often collected under the umbrella term “the measurement problem,” which conflates record-bearing structure, fine-event actuality, and statistical weighting into a single explanatory task. This paper separates those roles through a reduction–reconstruction strategy with two structural results. First, Born weighting is suspended and the physically defined record architecture is maximally coarse-grained to the distinction between non‑record‑bearing and record‑bearing sectors. After an ideal measurement interaction, the final state may lie entirely in the record-bearing sector, establishing sharp coarse record-sector support without selecting any fine-grained event. Restoring physically meaningful record resolution preserves that coarse truth while enlarging the represented question space: whenever the same postmeasurement state has support in more than one distinguishable fine sector, no occupied fine sector contains the global state. The single-event question therefore appears not through failure of coarse dynamics, but through successful coarse dynamics followed by finer physical resolution. Second, the paper asks what could genuinely supply the missing fine-event specification. Relative to a theory‑relative completed standard-description map D̄, a deterministic actuality map X̄ is already determined by the completed description exactly when X̄ = G ∘ D̄ for some G. Non‑injectivity of D̄ alone is insufficient for actuality underdetermination; the decisive obstruction is variation of X̄ within a fiber. Failure of factorization signals the need for residual run‑level information beyond the completed standard description, whereas factorization eliminates that informational need without implying that the candidate law G is part of standard quantum theory. Stochastic completions may instead add an independently specified law of event occurrence. Probability is then restored as an empirical reconstruction constraint: admissible completions must recover the Born distribution, preserve cross‑resolution consistency, and, where applicable, reproduce protocol‑level registered‑history laws. The result is a structural separation among record‑sector support, fine‑event actuality, Born weighting, and registration, without selecting a preferred interpretation or proposing an actuality mechanism. This is version 1.0 of the manuscript.
The Born rule sits at the heart of quantum mechanics as an unexamined assumption: probabilities are fundamental. For a statistician, that is uncomfortable. Probabilities are tools for describing ignorance — so what, precisely, are we ignorant of? That question leads to a deeper one: what is measurement, really? If measurement is a physical event, something in the world must change when it happens — something records it. WF-S formalises this with two physical inputs and one Lagrangian. Postulate 1 (WF-S kernel): a complex amplitude field φ(x) couples to a real substrate field s(x) via L = Lφ + Ls − g|φ|²s. Postulate 2 (record condition): macroscopic outcomes are weighted by cumulative entropy export σi = ΔSenv,i/kB during record formation. The substrate carries the irreversible imprint of that record. The Schrödinger equation and the Born rule are not independent postulates: they are the same Lagrangian in two regimes, separated by the physical threshold of record formation. The Born rule emerges as the entropy-uniform limit of a more general selection rule — derivable, not assumed. The entropy increments σi are thermodynamic quantities, defined through physical irreversibility independently of any probability assignment. The arrow runs: physical event → thermodynamic σi → outcome weighting → Born rule. The framework makes falsifiable predictions. For two outcome channels, the log-odds shift is ln(P1/P2) = ln(|a1|²/|a2|²) + Δσeff, where Δσeff ≈ εη Δσeng, Δσeng is an independently calibrated entropy contrast and εη is an experimentally bounded suppression factor. Swap-symmetry of the tilt (F1), linear response in engineered entropy contrast (F2), universality of the coarse-graining parameter across platforms (F3), and exact Born recovery in the entropy-uniform limit (F4-F5) are testable on existing platforms independently of the numerical value of εη.This paper is the first in a five-paper series; the substrate framework developed here is extended to forces, gravity, cosmology, and a full information-geometric synthesis in Papers II–V."
This deposit contains the manuscript and the three analysis scripts (with outputs and SHA-256 hashes) for Part III of the SFIT Stochastic-Braid Substrate series. The paper separates three objects that are often conflated in attempts to obtain quantum measurement statistics from a classical substrate: (i) the substrate configuration (positions, velocities, helicities of the Part I defects), (ii) the channel population xk≥0, ∑kxk=1, and (iii) the record probability P(k), i.e. the probability that a physical record names channel k. The Born rule relates (iii) to (ii); it says nothing by itself about how (ii) arises from (i). The paper asks three questions and reports the status of each: 1. Can a shared, finite carrier enforce exclusive records? In a coupled-mode model with explicit local detectors, detector-local back-reaction lowers the gated coincidence parameter from α=1.00 to α=0.57–0.60 at the strongest back-reaction tested, but only when detector thresholds are comparable to the carrier energy. At thresholds one-twentieth of the carrier energy, α stays at 0.96–1.00. Strong exclusion (α<0.1) was not reached in any of 136 configurations. Result: partial suppression only. 2. Under what conditions does record selection reproduce Born weights? Two sufficient routes are identified, each with a precisely quantified fragility. Route 1: exactly memoryless (exponential) detector thresholds give Born frequencies by a common-time-change argument; gamma thresholds of shape 2 depart by TV distance 0.08–0.15. Route 2: a bounded martingale for channel populations absorbed at a vertex gives Born weights for any functional form of the exchange law; a first-passage bound and a converse are proved (given absorption, zero conditional drift is necessary), and a biased exchange kernel is shown to follow the Kimura fixation formula, so zero drift must hold to order 1/M in the number of exchange units. Common-mode noise on the shared carrier cannot substitute for detector-local randomness: with fixed thresholds the largest channel fires first in every run, at every reversal rate. 3. Does Part I supply these conditions? No. The Part I helicity representation acts by permutation matrices, and no permutation action yields zero conditional drift for any filtration unless it is the identity (for pairwise-distinct populations). Measured on the Part I crossing process, the drift is nonzero at every test state, and populations are rearranged but never concentrated; sector populations are exactly invariant. This identifies braiding as neutral with respect to record selection. Scope and caveats. No derivation of the Born rule or of quantum superposition from the substrate is claimed. The internal state ψ is an input; the exchange kernel of Route 2 is global and postulated; memoryless detector thresholds (Route 1) are assumed; strong exclusion was not achieved; and the first-passage record of Proposition 3 (α=0 by conservation) has not been combined with local detectors in simulation. Real amplitudes suffice for the single-system statistics studied, but real-amplitude quantum theory is experimentally distinguishable from complex quantum theory in network scenarios. Each result in the manuscript is tagged [DERIVED], [ASSUMED], or [TESTED]. Three scripts produce every number in the paper; each states its model, metrics, controls, predictions and decision rules in its header, fixed before the runs reported. The scripts were not preregistered; this deposit supplies them together with their outputs and hashes to support reproducibility.