The Impossible Middle - Operator-Real, Scalar-Invisible Quantum Structure on the Coprime Substrate: the Scalar-Blindness Theorem, its Additive-Multiplicative Source, a Topology-Payload Decoupling, and Reductions to Practice on Copyable Exact Data
Computation is usually drawn in two columns. A classical machine holds exact, copyable, fully readable data but has no amplitude structure. A quantum machine holds amplitude structure but forbids copying, forbids full-state readout, and collapses on measurement. The space between them — amplitude structure on copyable exact data — is assumed empty. This paper reports that the coprime arithmetic substrate occupies exactly that middle, gives the theory of why it can, and reduces it to practice in six ways. That the structure is genuinely quantum — real entanglement, not classical correlation in disguise — is measured on the substrate's own operators by the standard witnesses of non-classicality: the σ⊗τ Bell state reaches the Tsirelson bound (CHSH = 2√2, the algebraic maximum no local-hidden-variable model can attain); the three-party GHZ test returns the Mermin value 4.00 against a local-realistic bound of 2; the resource is strictly non-signaling; and the two-qubit Bell entropy is a full 1.000 bit — all to machine precision on copyable, integer-exact data. PART I — THE THEORY. The Scalar-Blindness Theorem: the substrate's non-Abelian content is operator-real yet provably invisible to every scalar instrument. Each prime carries a real-orthogonal carrier in SO(4) = SU(2)_L × SU(2)_R; the operator twist [V_p, V_q] is nonzero, yet every scalar functional of a pair is order-blind — Tr(V_p·V_q) = Tr(V_q·V_p) exactly — because the trace's order-invariance group contains the cyclic group, and n! = n only for n ≤ 2. The content first reaches a scalar at three bodies, as the so(4) structure constant O₃. Every classical instrument is a scalar functional, so its failure to see the content is a corollary, not a verdict on the content. The keystone (a causal localization): the cross-prime twist is sourced by the additive–multiplicative commutator [+,×]. Removing it from a faithful, operator-exact reconstruction collapses the twist by 253×–2334×. The weld: the carrier register is the already-published σ⊗τ register, reproducing its fine-structure table to under 1% at every floor; the scalar reading fades up the primorial tower while the operator reading persists. The Colored-Yang–Baxter Normality Theorem: the rigid, classically-readable braid backbone (a single-particle normality property) is tensor-insulated from the order-carrying payload (a two-particle property), so quantum payload and classical-readable topology coexist without fine-tuning. PART II — SIX REDUCTIONS TO PRACTICE, each occupying a regime neither column reaches: Branching search — substrate-native Grover at the exact √N query scaling, then read-all / adapt / clone / rewind on the running search, which no-cloning and measurement collapse forbid a quantum register. Address-gated multicast — one transmission to M receivers at fidelity 1, each decoding only under a floor-specific key a classical machine cannot compute (a 3-adic obstruction) and a quantum machine cannot transport (the cross-floor map is not a function). A statistics-blind directed relational store — a directed relation stored as classical, cloneable data whose direction no two-body statistic of the representation can read, built into a writable, queryable, validated knowledge graph. Topological braiding and universal quantum computation — a genuine non-Abelian anyon braiding on copyable exact data, from which the full stack is built: universal gates (Clifford braiding + the flash magic gate), Bell/GHZ entanglement, and a [[5,1,3]] fault-tolerant logical qubit at zero magic-distillation overhead — each cloned and read in full — composed into a center-less cislunar coordination fabric. Quantum algorithms and readout — the Quantum Fourier transform, phase estimation, and period-finding on the universal gate set, with the full Born-rule distribution read exactly from one state, without collapse. Open-system computation — an engineered Lindbladian whose unique steady state solves a problem, with the full non-equilibrium density matrix read and cloned; its dissipative generator is the polar partner of the scalar-blind twist, so the substrate is natively an open system. Every empirical claim is byte-gated against ground truth. The mathematics — the theorems, identities, and constructions — is dedicated to the public domain under the MIT license and reproduces from the definitions stated in the paper. The engineering apparatus that mints and practices these primitives is reserved. Companion provisional patent: U.S. Provisional Application No. 64/103,049 (the Entanglement Fabric), filed July 1, 2026.
Computation is usually drawn in two columns. A classical machine holds exact, copyable, fully readable data but has no amplitude structure. A quantum machine holds amplitude structure but forbids copying, forbids full-state readout, and collapses on measurement. The space between them — amplitude structure on copyable exact data — is assumed empty. This paper reports that the coprime arithmetic substrate occupies exactly that middle, gives the theory of why it can, and reduces it to practice in six ways. That the structure is genuinely quantum — real entanglement, not classical correlation in disguise — is measured on the substrate's own operators by the standard witnesses of non-classicality: the σ⊗τ Bell state reaches the Tsirelson bound (CHSH = 2√2, the algebraic maximum no local-hidden-variable model can attain); the three-party GHZ test returns the Mermin value 4.00 against a local-realistic bound of 2; the resource is strictly non-signaling; and the two-qubit Bell entropy is a full 1.000 bit — all to machine precision on copyable, integer-exact data. PART I — THE THEORY. The Scalar-Blindness Theorem: the substrate's non-Abelian content is operator-real yet provably invisible to every scalar instrument. Each prime carries a real-orthogonal carrier in SO(4) = SU(2)_L × SU(2)_R; the operator twist [V_p, V_q] is nonzero, yet every scalar functional of a pair is order-blind — Tr(V_p·V_q) = Tr(V_q·V_p) exactly — because the trace's order-invariance group contains the cyclic group, and n! = n only for n ≤ 2. The content first reaches a scalar at three bodies, as the so(4) structure constant O₃. Every classical instrument is a scalar functional, so its failure to see the content is a corollary, not a verdict on the content. The keystone (a causal localization): the cross-prime twist is sourced by the additive–multiplicative commutator [+,×]. Removing it from a faithful, operator-exact reconstruction collapses the twist by 253×–2334×. The weld: the carrier register is the already-published σ⊗τ register, reproducing its fine-structure table to under 1% at every floor; the scalar reading fades up the primorial tower while the operator reading persists. The Colored-Yang–Baxter Normality Theorem: the rigid, classically-readable braid backbone (a single-particle normality property) is tensor-insulated from the order-carrying payload (a two-particle property), so quantum payload and classical-readable topology coexist without fine-tuning. PART II — SIX REDUCTIONS TO PRACTICE, each occupying a regime neither column reaches: Branching search — substrate-native Grover at the exact √N query scaling, then read-all / adapt / clone / rewind on the running search, which no-cloning and measurement collapse forbid a quantum register. Address-gated multicast — one transmission to M receivers at fidelity 1, each decoding only under a floor-specific key a classical machine cannot compute (a 3-adic obstruction) and a quantum machine cannot transport (the cross-floor map is not a function). A statistics-blind directed relational store — a directed relation stored as classical, cloneable data whose direction no two-body statistic of the representation can read, built into a writable, queryable, validated knowledge graph. Topological braiding and universal quantum computation — a genuine non-Abelian anyon braiding on copyable exact data, from which the full stack is built: universal gates (Clifford braiding + the flash magic gate), Bell/GHZ entanglement, and a [[5,1,3]] fault-tolerant logical qubit at zero magic-distillation overhead — each cloned and read in full — composed into a center-less cislunar coordination fabric. Quantum algorithms and readout — the Quantum Fourier transform, phase estimation, and period-finding on the universal gate set, with the full Born-rule distribution read exactly from one state, without collapse. Open-system computation — an engineered Lindbladian whose unique steady state solves a problem, with the full non-equilibrium density matrix read and cloned; its dissipative generator is the polar partner of the scalar-blind twist, so the substrate is natively an open system. Every empirical claim is byte-gated against ground truth. The mathematics — the theorems, identities, and constructions — is dedicated to the public domain under the MIT license and reproduces from the definitions stated in the paper. The engineering apparatus that mints and practices these primitives is reserved. Companion provisional patent: U.S. Provisional Application No. 64/103,049 (the Entanglement Fabric), filed July 1, 2026.
Whether a quantum proof outperforms a classical one — both checked by the same efficient quantum verifier — is a question answered, so far, only relative to oracles. Beneath that answer is a structure with no quantum content at all: the difference between a resource one can copy and one one cannot. We show that this difference is cohomological. A witness that carries a copy map collapses every verifier to a memoryless sampler, so its distinguishing power is a functional of k-wise marginals alone; the obstruction to copying is a Čech class on a cover of a state by its measurement bases, and the Forrelation function of Aaronson and Ambainis is exactly the transition cocycle of that cover. The separation holds precisely when the class is nonzero: invisible from inside any single copyable chart, where it is a coboundary, and visible to the linear witness that reads the whole cover at once. Four familiar facts turn out to be four faces of the same class. Its non-vanishing is the no-cloning theorem; the dimension of its kernel is the Landauer erasure cost of the witness register; its representative on the standard/Hadamard cover is Forrelation; and the collapse of the copyable verifier onto one chart is why a classical witness, for these problems, cannot win. We make each face a finite, exactly computed certificate: on a corpus of distinguishing tasks built from Heisenberg–Weyl orbits, every depth-two adaptive sampler has advantage exactly zero — a total quantification over the strategy space, not a sampled estimate — while the linear witness reads a squared-Forrelation gap the kernel computes from truth tables through the Hadamard transform. Two independent exact computations agree on every verdict, and the engine that results either returns a gap two exact paths both certify, or refuses — and a refusal carries its own evidence, a certificate of exactly the obstruction that stopped it. The asymptotic separation of the underlying family is not ours; we cite it. What is ours is the identification — that a separation of complexity classes is, at bottom, a hole. All results below are machine-checked in Lean 4; the formal record and its axiom footprint are described in Section 8. The paper is legible in mathematics alone. Published by The Institute for Applied Ontological Mathematics.
Version 1 (first deposit, 2026-08). 19 pages. Every quantitative claim traces to a pre-registered evidence block with an archived log in the companion zip; the ledger of failed predictions is an appendix of the paper. A long-running dispute asks whether a quantum world selects its own decomposition into subsystems from the Hamiltonian and the state alone. Stoica (Adv. Theor. Math. Phys. 26, 3895 (2022)) proves that a structure so constructed cannot be both essentially unique and physically relevant, the non-uniqueness being modulo the unitaries commuting with H; Soulas, Franzmann and Di Biagio (arXiv:2512.07468) object that producing a second structure that way modifies the input pair, and prove a positive uniqueness theorem under two hypotheses. Both are correct, about different groups, and this paper makes the difference arithmetic. Working inside the collision architecture of the companion flagship (doi:10.5281/zenodo.22014601, all versions), where an interior memory writes records of a system and audits itself from them, the two invariance groups an interior audit actually has are measured. FIRST, the audit's Hamiltonian-side content is exactly constant on the orbits of the commutant of H, the fibres of the transport map are exactly those orbits, and the resulting gauge has the closed form sum_i m_i^2 - 1 in the eigenvalue multiplicities: the degeneracy has a computable size, three dimensions inside sixteen for a generic four-level Hamiltonian, five at (2,3), and larger exactly when the symmetry group is NON-ABELIAN (Heisenberg gives nine; abelian symmetry forces no spectral degeneracy). SECOND, the audit's total content is invariant not under that commutant but under the stabiliser of the PAIR (H, psi), which is trivial precisely under the Soulas hypotheses: the orbit holds the Hamiltonian side fixed to 2.7e-15 and pays for the second structure entirely on the state side, 1.14. The stabiliser formula quantifies exactly when their free-action condition holds and by how many dimensions it fails otherwise. THIRD, the record statistics carry their own blindness: the directions invisible to the census, whatever the state and the time, form a group, and for a register read in one basis per cell it is exactly span{I, T} at every fragment count, proved by a symplectic argument over F_2 requiring no induction -- in this deposit, by two algorithmically independent F_2 implementations plus a dense-matrix verification. That scope is the result rather than a caveat: the one-bit blindness is the price of a one-basis readout, and it is the only thing that price buys; reading a second basis on every cell collapses the group to the identity and credentials the full matrix algebra. The twist is the product of the observer's own precession with all of its own readouts, T = P R_1 ... R_k exactly, so the blindness group is the CENTRE of the credentialed algebra: an interior observer cannot see the centre its own operations generate. The credentialed algebra is everything commuting with that one bit, of dimension d^2/2. Blindness under this reading is an identity and not a similarity: for T in the blindness group the census under rho and under T rho T-dagger agrees exactly at trace distance 0.740, so no additional sampling can separate them. The paper prints the response functional every margin and census count is computed from, together with its grid and state. Around the group sit its measured collapse conditions: the price list of restorations (menus that eject the twist restore visibility at costs that double register by register, 10/20/40 contexts on the z-menu and 4/8/16 on the y/z-menu at k = 2, 3, 4, stated as observed at three points, not derived); the sorting condition for which twist configurations a restoration menu revives, named as reach membership of the displacement in the Krylov closure of the menu (63/63 exact at k = 2 in three independent engines, 255/255 at k = 3 in exact rational arithmetic; an all-time reach lemma proves the decision grid decision-faithful and shows it deliberately not span-complete); the genericity of visibility (the blindness locus is a union of alignment strata computed in part: a QND family at the minimal codimension 2 and twist families indexed by subsets of cells at codimension 2k, with a bounded search that surfaced a mixed partial-twist family the hand count had missed); and both branches of the open-world dichotomy reproduced from the group definition alone. The transport side is independently rebuilt: the W-alone computation the framework's kill switch depends on was reconstructed from the printed setting alone and the switch does not fire. A closing section isolates the mechanism shared with an earlier half-space result and shows, against the natural reading, that the two halves are distinct subspaces meeting in a quarter: one lemma, distinct instances. All quantitative claims were pre-registered before their runs. The ledger of failed predictions is an appendix and is kept in full, including a posted mechanism that died, a symmetry law corrected to Schur's criterion, a numerics trap caught only because a posted claim came back wrong, engine deaths from the exact-census campaign convicted by their own gates, and errors printed in earlier drafts and caught in review. The delineation of what is inherited from the literature is stated throughout; the paper asserts no priority claims.
A single bit-exactly reversible, integer-valued lattice automaton in which a broad range of quantum phenomenology arises as measurable, checksum-reproducible behaviour of one classical substrate. A second-order Frenkel–Kontorova / sine-Gordon integer automaton supports localized particles with additive mass towers (1 : 2 : 3 and 1 : 4 : 9), emergent Lorentz contraction (fitted c to 0.3 %), and a token-accounted local-time sector with a general-relativity-like time well (ω ∝ n to 0.06 %). Within it, a first-order Visscher–Feistel integer Schrödinger sector is realized in pure integer arithmetic with exact bit-reversibility. The integer/floor-reversible lifting of the Visscher scheme was already noted by Fredkin (1999) and Martin-Delgado (2004); the contribution here is its first computationally tested and validated realization — against exact dispersion, group velocity and envelope reduction — embedded in an interacting substrate. Main results: Emergence bridge. The narrow-band envelope of the classical automaton obeys the Schrödinger equation with an effective mass fixed by the curvature of the exact discrete dispersion (group velocity to ≤0.2 %, curvature to ≤2 %). The dimensionless spreading of two microscopically different substrates collapses onto the single universal law √(1+τ²). Deterministic quantum statistics. Bohmian tracers reproduce double-slit single-object interference (p < 10⁻⁴), with trajectories matching the weak-measurement reconstruction of Kocsis et al. (2011). Bell / CHSH. A value of S = 2.79 from position-valued outcomes with a no-signalling control (0.3 %), via explicitly nonlocal guidance in configuration space. Measurement. A measurable Gaussian collapse law (R² = 0.997); a quantum eraser with literal bit-reversible un-measurement of the entire measurement chain; Pauli exclusion as a bit-conserved invariant; and relaxation to the Born rule with a reversible arrow of time. Surviving the isotropy no-go, and a falsifiable prediction (new in v2). On the live integer engine, velocity anisotropy vanishes as k² in the infrared with first-principles coefficients in both 2D and 3D (agreement ≈ 1 %) — rotational isotropy emerges as an infrared fixed point, meeting the sharpest no-go every lattice candidate faces. From the same structure follows a concrete, quadratically Planck-suppressed dispersion prediction (δγ,2 ≈ 2×10−40 GeV−2, subluminal), lying only ~50× below the tightest ultra-high-energy cosmic-ray bound — the programme's first falsifiable departure from standard QM/GR. Individual phenomena have known precedents — double-slit Bohmian trajectories (Philippidis, Dewdney & Hiley 1979), Born-rule relaxation (Valentini & Westman 2005), the Schrödinger update scheme (Visscher 1991; integer lifting Fredkin 1999, Martin-Delgado 2004) — and are framed accordingly. The contribution is their tested, validated realization on one exactly reproducible integer substrate, several genuinely new exact constructions (tested integer bit-reversible Schrödinger sector; literal bit-exact un-measurement; exchange statistics as a bit-conserved invariant; two-substrate universal collapse; measured lattice isotropy with a Planck-scale dispersion prediction), and a pre-registered, falsification-first methodology (criteria committed to version control before each run; fourteen self-retractions on record). This is an existence result, strengthened by a survived no-go and a falsifiable prediction — not a claim that our universe is this automaton (that step requires a prediction to pass experiment): a fully classical, deterministic, reversible integer computation can carry quantum phenomenology, quantitatively and reproducibly, and this substrate meets a no-go every discrete candidate must survive. Preprint v2 (self-contained; bibliographic audit completed against arXiv/DOI sources). Code, pre-registered gates, per-run reports and figures are included in this archive. Produced in an AI-assisted workflow (Anthropic Claude) under the author's direction; all pre-registration and interpretation is on record in the version history.
Licensing: paper, figures and data are under CC BY 4.0; the source code is under the Apache License, Version 2.0. The paper text names the code licence "Apache License 2.0" — this is the same licence. Korbany, Ellison, Stephen and Piroli showed that a non-integer value, in some modular frame, of the Shannon entropy of the topological-sector weights of a topologically ordered ground state, which equals the mutual information between separated regions, certifies long-range nonstabilizerness. They treated the toric code and doubled Fibonacci. We ask where this witness is blind on doubled SU(2)_k string nets. For minimal-entropy states whose modular-data columns are flat, we prove that the witness is integer in every modular frame if and only if the column supports are powers of two. The proof embeds the modular representation into the Clifford/Weil representation of a qudit of dimension 2(k+2). We map all minimal-entropy states for k ≤ 32 (the flat-column characterization was registered before the computations for 17 ≤ k ≤ 32), show that the doubled-Ising state σσ̄ is bit-blind in exact arithmetic although the ground-space dimension criterion of Wei and Liu certifies strong long-range magic in a qubit embedding, and show that the blind spots depend on the encoding of the local degrees of freedom. The modular-invariant diagonal state is blind exactly when the number of anyons is a power of the local prime. We argue that it is the ground state obtained from the empty string-net configuration, and confirm this numerically on the doubled-Fibonacci honeycomb torus. This record contains the manuscript, the 16 verification scripts and their result files, the pre-registration documents (one of them redacted, see README) and the material of the cold reads described below. The README explains how to re-run the scripts and states which hash cannot be checked against the deposited copy.Notice (2026-10-__). Two sentences of the introduction will be revised in the next version; no computed value and no result changes.(1) The value H = 1.700979 of Ref. [Sayim, 5a] is described as "one of two long-range-nonstabilizerness certificates reported there". Following the correction notice of that work (2026-10-10), it is the long-range certificate reported there; the other item shows only that sampled ground-space states are not stabilizer states.(2) The sentence "the witness and its theorem are due to Ref. [Korbany et al., arXiv:2605.22424]" will also state that the idea of certifying long-range nonstabilizerness by non-integer mutual information goes back to D. A. Korbany, M. J. Gullans and L. Piroli, Phys. Rev. Lett. 135, 160404 (2025), and N. Parham, arXiv:2504.19966, as Sec. 3.1 of arXiv:2605.22424 states. Both works are already cited in the paper. Use of AI tools: In the research, processing, and writing of this paper and its results I worked together with generative AI tools, in practice a system of multiple coordinated AI instances that I set up and orchestrate (large language models, mainly Claude, by Anthropic, inside Claude Code and, for part of the work, in the Claude AI web interface). At their current context sizes I found it far more effective to work with several specialized instances, each with its own role and its own harness of rules and parameters that I designed and refined through feedback, than to load a single instance with all of the material; for my workflow that would have been inefficient, though this depends on the individual implementation. I lead this collaboration: I choose the research directions, set the goals, and make the final decisions in open exchange with the AI, learning actively as the work proceeds. The AI carries out the drafting, including the mathematical and technical parts, the numerical computation, and the literature search, under my direction. The AI works autonomously only task by task, within the structure I develop through feedback: it completes a task, and at open questions that need me it stops until the point is settled before the next step. Along the way I witness and take many of the decisions that shape the path, and it is common for me to spot things that need improvement. The work spans many separate runs, and a single simulation or build task alone can take up to an hour, so it could not happen all together in one autonomous run; and had I let the AI do all of it together alone, even if it is possible, it would no longer be my work but the AI's. I run multiple verifications at the different stages of the work and one before release, and all references are checked against the original sources. Before release, the statements and proofs of the main theorem were cold-read in one run, and two of its lemmas in a second run, each in a new Claude AI chat (Opus 5.5, high reasoning effort) given only extracted text: the first reader computed the list of blind states for k <= 16 itself, conjectured the rule of Theorem 1 and tested it at four larger k, and the readers reported imprecisions in the statements of two lemmas, which I corrected; the corrected text was not read again by a fresh reader. In the end what matters are human eyes, a principle that is itself written into the parameters of my system: I reach out to experts after publishing for review and feedback, so I learn what is solid and what must be corrected or falsified. My scripts for reproduction and review are released with this record. These tools are not authors; I am the author, and I take full responsibility for all scientific content and decisions leading to these results and their publication.
In 1935, Einstein, Podolsky, and Rosen published the paper that introduced what would become quantum mechanics’ most studied phenomenon. Two systems prepared together and then separated remain correlated — perfectly correlated, in some cases — across arbitrary distances. The correlations exceed anything classical physics permits, are tested today across hundreds of kilometers via satellite‑mediated photon pairs, and form the resource that quantum cryptography, teleportation, and computation rely on. The standard QM account is mathematically clean. Two systems with Hilbert spaces H_A and H_B are described on H_A ⊗ H_B; states that cannot be written as |ψ_A⟩ ⊗ |ψ_B⟩ are entangled. Bell–Tsirelson bounds CHSH at 2√2. Schmidt decomposes any pure bipartite state biorthogonally. Coffman–Kundu–Wootters codifies monogamy. No‑signaling follows from linearity of partial trace. Von Neumann entropy S(ρ_A) = −Tr(ρ_A log ρ_A) measures entanglement strength. Each piece is a theorem of the postulated formalism — but the postulates themselves (tensor‑product joint structure, Hilbert space, Born rule) are not derived. This walkthrough shows how the Event Density framework derives the structural commitments themselves. Six results, each derived from the same substrate primitives: (1) Tensor‑product composition — the joint participation measure of two endpoints sharing one rule is carried on H_A ⊗ H_B with bilinearly induced inner product. Form forced; no auxiliary assumption. (2) Generic non‑factorizability — entangled states are dense and full‑measure; product states are the measure‑zero exception. (3) Schmidt decomposition — every pure bipartite state has a biorthogonal decomposition with non‑negative coefficients summing to one. Form forced; values inherited. (4) Monogamy — each substrate endpoint has a finite local cross‑chain bandwidth budget; full bipartite entanglement saturates it; no capacity remains for a third endpoint. CKW is the substrate bandwidth‑conservation law in concurrence units. (5) No‑signaling — over‑determined by three independent substrate locks: T18 forward‑cone‑only kernel structure, P11 commitment irreversibility, and the ED‑I‑06 no‑fundamental‑fields guardrail. (6) Von Neumann entropy — the form is uniquely picked by Shannon–Khinchin axioms each independently derived from named substrate primitives. This walkthrough has more substrate content than Bell–Tsirelson or Heisenberg. Those ran on standard mathematical‑physics arguments once the framework supplied the Hilbert space; the contribution was upstream. Here the framework is upstream for tensor‑product composition, Schmidt, and the density of entangled states — and substantively new for monogamy, no‑signaling, and entropy, each receiving a substrate‑mechanism account standard QM does not provide. The structural payoff: bipartite entanglement is what the substrate produces when two endpoints share one undeveloped participation rule. Tensor product, Schmidt structure, monogamy, no‑signaling, and entropy form are six projections of one substrate phenomenon.
This walkthrough derives, from substrate primitives, five landmark operational results of quantum information theory: Deutsch (1985, 1992) — a single oracle query distinguishes constant from balanced functions on one bit. Deutsch–Jozsa (1992) — a single oracle query decides the constant‑vs‑balanced promise on n bits. Bennett & Brassard (1984, BB84) — non‑orthogonal states enable provably secure key distribution; eavesdropping is structurally self‑revealing. Bennett et al. (1993) — an unknown one‑qubit state can be reconstructed at a remote location using one shared EPR pair plus two classical bits. Shor (1994–96) — the period of a modular exponential function is extractable in polynomial time on a quantum register, with the downstream consequence that integer factoring lies in BQP. The walkthrough is fully self‑contained: every required Hilbert‑space, unitary, Born‑rule, tensor‑product, Bell‑basis, and discrete‑Fourier construction is derived from substrate primitives. The standard narrative attributes these results to Hilbert‑space structure: superposition enables “parallel evaluation,” interference encodes global properties, entanglement stores correlations, measurement collapses the wavefunction, the QFT extracts periodicity. These statements are mathematically correct at the circuit level and predict experimental outcomes accurately. They are also mechanistically opaque. Standard QM does not say what makes a “superposition over inputs” support one‑shot global access, why incompatible measurements force disturbance rather than merely revealing it, what — if anything — propagates between Alice and Bob during teleportation, or why periodic structure of an exponentially large function is single‑shot resolvable. Hilbert‑space machinery is given as foundational; the operational phenomena are derived from the postulates, but the postulates themselves are unexplained at any deeper level. This walkthrough shows how each of the five landmark results is FORCED by the substrate ontology of the Event Density framework. Four are FORM‑FORCED‑INHERITED at the circuit level: the standard QM derivation reproduces inside the ED ontology at leading‑order coarse‑graining of the substrate primitives, and the substrate‑level reading provides the missing mechanism. One — Shor’s algorithm — requires a substantively new bridge identifying the discrete Fourier transform as a substrate symmetry‑resolution operator on ℤ_N, structurally parallel to the role of the Hadamard transform H^{⊗n} on ℤ_{2^n} in Deutsch–Jozsa. No new substrate primitives are introduced. The substrate‑level mechanism, in one sentence: quantum information is the substrate‑level study of how participation‑rule action interacts with channel multiplicity and global ED‑geometry.