We introduce the Enter calculus, a linear quantum lambda calculus in which measurement is represented by an explicit operation, Enter, that produces a classical record. Runtime qubit names refer to factors of a shared quantum state, allowing the operational semantics to represent entanglement without assigning separate state vectors to individual terms. We prove type preservation, progress, strong normalization, semantic no-cloning, circuit adequacy, internal no-signaling, and confluence up to outcome distributions. We then replace the probabilistic measurement rule by an abstract evaluation strategy. Composability, no-signaling, nullity, continuity, and a record-creation axiom uniquely determine Born probabilities and projective state updates. The role of the record axiom is isolated using structural results from a companion analysis of the corresponding record-free functional equation. Finally, we introduce a typed Suspendconstruct that compiles an agent’s protocol into coherent laboratory dynamics. This reflection mechanism supports a formal reconstruction of the Frauchiger–Renner protocol. The contradictory certainty chain is blocked because a record reading and an incompatible interference measurement require the same linear resources and therefore cannot occur in one well-typed observational context. The resulting account treats measurement records as perspective-bound while retaining single-history stochastic semantics for unsuspended agents.Keywords: quantum measurement; quantum lambda calculus; Born rule; linear types; Wigner’s friend; Frauchiger–Renner paradox; no-signaling; quantum programming languages
The Enter calculus is a linear quantum programming language in which measurement is represented by an explicit operation that consumes quantum resources and returns classical records. This paper studies abstract evaluation strategies for that operation. Five operational requirements are imposed: composability of measurements on disjoint subsystems, no-signaling, nullity of outcomes orthogonal to the state, continuity, and equivalence between immediate evaluation and coherent record creation followed by delayed readout. The main result is that these requirements determine both Born probabilities and projective state updates. The central step is a derivation of diagonal anchoring rather than an assumption of it. No-signaling first implies that a local outcome law depends only on the reduced density operator. Equal-amplitude states with distinct correlated labels are then shown to have uniform outcome laws. A naïve fine-graining argument fails because its refined register retains intra-block coherence. The repaired construction exports a within-block index to an additional register, producing distinct companion states for every refined label. Uniformity and fiber counting then determine all rational diagonal probabilities, while continuity extends the result to the general case. The record principle transfers this result to arbitrary coherent states, and comparison with all later experiments fixes the residual state. The results extend to mixed states, adaptive protocols, rotated projective measurements, POVM outcome laws, and, after adding explicit discard, quantum instruments. A restricted compatibility theorem for sharp contexts is applied to the Frauchiger–Renner protocol. The paper also distinguishes this operational result from the static functional equation studied in a companion work. Keywords: Born rule, quantum measurement, quantum programming languages, linear types, no-signaling, deferred measurement, quantum instruments, Frauchiger–Renner paradox.
The Enter calculus is a linear quantum lambda calculus in which runtime qubit names refer to factors of a shared quantum state, and measurement is represented by an explicit operation, Enter, that consumes quantum resources and returns classical records. This paper gives a unified formal development of the calculus. The core language satisfies type preservation, progress, strong normalization, semantic no-cloning, adequacy for finite quantum circuits, confluence up to terminal distributions, and internal no-signaling. The Born probabilities are then removed from the operational rule and replaced by an abstract evaluation strategy. Five operational requirements are imposed: composability, no-signaling, nullity, continuity, and observational equivalence between direct evaluation and coherent record creation followed by delayed readout. The central result is that diagonal anchoring is not an additional axiom; it follows from the first four requirements through a decohered fine-graining construction in which a within-block index is exported to an additional register. The record principle then yields the Born rule for arbitrary coherent states, and comparison with all later experiments determines the projective state update. The development includes quantitative stability estimates, mixed-state and adaptive formulations, rotated projective measurements, POVM outcome laws, and an affine extension for quantum instruments. A single-level reflection operation compiles an agent’s protocol into coherent laboratory dynamics. A compatibility theorem for sharp measurement contexts then isolates the obstruction in the Frauchiger–Renner certainty chain. Finally, a static record-free functional equation is classified by Walsh-parity slack fields, and its remaining positivity problem is distinguished from the operational Born theorem.
We reconstruct nonrelativistic quantum mechanics from exactly three physical axioms: microscopic ontic definiteness and finite localization, physical reality of the spacetime-vacuum substrate, and persistent causal source–response coupling. The single-run physical state is a finite topological core, its actual causal history, the substrate state, its sector, and the associated historical disturbance. A wave function is not identified with that ontic tuple. It is a ray in a Hilbert representation of admissible preparations and response amplitudes; a density operator is a statistical or reduced representation; and a record is a stable macroscopic event. The logical construction is acyclic. Finite-energy sector spaces and their continuous symmetry representations lead, under explicit representation conditions, to a complex Hilbert direct sum. A closed semibounded quadratic form defines the Hamiltonian and its self-adjoint realization. The standard Schrödinger action, unitary propagation, probability current, spectral observables, uncertainty relations, composite-system tensor products, spin representations, exchange sectors, instruments, and completely positive open dynamics then follow on their declared domains. Gleason-type reasoning fixes the Born form only after additivity, noncontextuality, continuity, and preparation–detector calibration are stated. Those operational conditions are not hidden physical axioms. The distribution of unresolved ontic initial data that realizes quantum equilibrium remains a realization certificate, not a theorem of topology alone. The Heisenberg representation is derived as a controlled transport of observables after Hilbert space and the self-adjoint generator have been constructed. Strongly continuous time translation, two-parameter nonautonomous propagation, common-domain Heisenberg equations, spectral matrix mechanics, regular Weyl relations, open-system adjoints, and instrument effects are connected by one certificate. Schrödinger and Heisenberg predictions are proved equivalent for one-time and finite instrument records, while finite-core, historical, truncation, domain, and detector errors remain separately bounded. Three frozen matrix benchmarks verify low-energy oscillator truncation and its state-weighted CCR defect, second-order unitary convergence for a driven doublet, Schrödinger–Heisenberg equality for a sequential instrument, finite auxiliary-history truncation, and quadratic leakage scaling for a conditional Dirac–Pauli interface. Independent reproduction, including the extended-precision audit, is closed for the frozen packet; physical coefficient calibration remains open. The next interface connects an owner-resolved Dirac–Pauli Hamiltonian to spin records through a Ward-compatible vertex, a causal passive history kernel, an independently audited doublet projection, SPAM-aware forward probabilities, nuisance-profiled identifiability, and a noncompensatory coefficient-to-record error theorem. The DPHC identifiability coordinate is executed on a frozen synthetic response family. A single-scale design is rank deficient, whereas an eighteen-setting frequency–gradient–order–time design has full profiled rank, controlled conditioning, near-nominal finite-sample coverage, and a calibrated held-out statistic. A robust twenty-setting design raises the worst registered information eigenvalue by
20.12%. A ten-parameter nonlinear audit exhibits an exact radiative–detector equivalence curve. An independent dark record breaks that symmetry and restores full local rank. Continuous-set robustness, validated global exclusion, and independent implementation are executed, while physical response identification and empirical calibration remain open. Measurement is treated as a dynamics of system, apparatus, environment, and actual history. Unitary premeasurement and decoherence select robust record sectors but do not by themselves select one record. The three-axiom ontology supplies one actual branch history, while a measurable response map from the complete initial state and instrument to the final record supplies the missing dynamical content. Bell correlations require contextual and nonfactorizable ontic response while parameter independence and operational no-signalling are retained; no controllable superluminal channel is introduced. Historical response produces causal non-Markov Hamiltonians and memory-kernel master equations. Their normalization, positivity, complete positivity, and energy ledger are derived from a unitary enlarged realization whenever such a dilation exists. Finite-core form factors and causal memory yield explicit departures from point-core Markov quantum mechanics. Standard quantum mechanics is recovered as the unresolved-core, sector-fixed, quantum-equilibrium, short-memory limit. Quantum field theory is retained as a successful local, spectral, and asymptotic calculus, but field operators, Fock vectors, and vacuum functionals remain effective representations until a noncircular map from finite carriers and their complete causal histories has been certified. The manuscript proves a sequence of previously open analytic, mathematical, measurement, topological, statistical, and computational obligations on explicitly declared domains. These include non-Markov diffusion, graph-norm stability, distorted-wave and pole variation, finite passive-memory realization, Fisher-information identifiability, detector pushforwards, unique-record basins, Born-representation bounds, measurement independence, topology–Dirac charge conjugation, Stern–Gerlach records, action-scale matching, rank-two spin projection, Finkelstein–Rubinstein topology, Clifford reconstruction, and parent-to-record realization maps. Eighteen groups of numerical obligations are executed on frozen reference models. They cover spectral and scattering calculations, oscillator and two-level dynamics, Schrödinger–Heisenberg equivalence, finite-history truncation, Dirac–Pauli and Foldy–Wouthuysen reduction, gauge covariance, interference, Bell and GHZ correlations, open-system memory, Stern–Gerlach records, identifiability, global searches, topological invariants, path products, semiclassical limits, partial-wave optical closure, the relativistic/QFT interface, and conservative-parent two-level dynamics. Every environment explicitly typed as a computational obligation now has an executed frozen-model certificate; empirical identification and separately typed experimental inputs remain open. The present manuscript differs so substantially from the earlier version in scope, logical architecture, proofs, and executable certificates that it is issued as a new upload rather than as a minor revision. Because the subject is both foundational and technically consequential, readers professionally engaged in quantum foundations, mathematical physics, quantum measurement, or related fields are encouraged to consult both versions: the earlier version preserves the developmental route, whereas the present version gives the substantially expanded and reorganized reconstruction. ## Keywords Axiomatic quantum mechanics; finite particle histories; retarded Green functions; Schrödinger equation; Dirac equation; Born rule; topological spin; quantum measurement; non-Markovian dynamics; classical limit.
We introduce a framework for simulating quantum measurements based on classical processing of a set of accessible measurements. Well-known concepts such as joint measurability and projective simulability naturally emerge as particular cases of our framework, but our study also leads to novel results and questions. First, a generalisation of joint measurability is derived, which yields a hierarchy for the incompatibility of sets of measurements. A similar hierarchy is defined based on the number of outcomes necessary to perform a simulation of a given measurement. This general approach also allows us to identify connections between different kinds of simulability and, in particular, we characterise the qubit measurements that are projective-simulable in terms of joint measurability. Finally, we discuss how our framework can be interpreted in the context of resource theories.
The Enter calculus [EC] derives the Born rule and the projective update from five operational requirements: composability, no-signaling, nullity, continuity, and records. This paper equips the calculus with a strictly linear resource geometry and develops its finite-resource metatheory, stating each result at precisely the strength established. An update grammar of four primitive moves makes every cut-indexed causal potential a conservation law, as shown in Theorem E through a case analysis of the grammar, and derives scalar monotonicity rather than assuming it. A latent-active split with fully specified typing rules turns monogamy of causal change into a typing invariant, as established in Theorem F. Resource-relative admissibility, with its quantification made explicit, is downward closed along runs, ensuring that the forcing threshold is well defined. The minimal register cost of the decohered fine-graining construction is computed in closed form in Theorem H, and the resulting realizable rational net improves the capacity-four rigidity mesh from the vacuous value delta equals one to delta star equals one-sixth in Theorem C star. Two rigidity layers are proved unconditionally: boundary rigidity, consisting of monotonicity, antipodal symmetry, the Sandwich and Seal lemmas, and a descent proposition, which holds for every admissible strategy without an update hypothesis; and diagonal-faithful rigidity, established in Theorem I through a fully detailed single-qubit case with an explicit Pexider argument and a multi-qubit induction, forcing the Born rule on every sub-capacity configuration at every capacity N greater than or equal to three. The residual question—whether diagonal-unfaithful update slack can survive at full depth—remains unresolved. Instead, it is reduced in both directions to sharply delimited objects: an effective hierarchy of relaxations whose finite levels upper-bound the residual freedom and make rigidity refutable at a finite level, as shown in Theorem J, without claiming that the limit is attained; and a compensated transport family based on odds-ratio-preserving Plackett transports, for which the two-qubit layer, the record-family seal lift in closed form, and the full-support three-qubit extension on compact sets are proved. This family satisfies every axiom instance generated by record-chain protocols from two-qubit initial configurations at every depth, as established in Theorem M prime. Consequently, no capacity-three rigidity proof can proceed through record chains alone. Full capacity-three admissibility reduces to a single explicitly stated Extension Conjecture; under that conjecture, Open Problem G three has a positive answer and the minimum threshold N zero of one and the pair one, two equals four. Depth-two and depth-three record probes pass at machine precision, and an eta-scan Pareto front reaches the axis numerically. Part II specifies a reproducible artefact in which every major claim is either proved, reduced to a finite check, or implemented as a property test or golden regression over a rich class of instances, with each item’s status—Theorem, conditional result, conjecture, or probe—labelled explicitly.