Summary. Enzymes are four-billion-year-evolved coherence-preserving machines operating at room temperature with rate enhancements of 10⁶–10¹⁷. Quantum computing pursues the same goal — preserved coherent transitions — at near-absolute-zero with extraordinary isolation requirements. This paper asks what biology has learned about coherence engineering that quantum computing has not, and turns the answer into testable predictions. Empirical core. Twelve enzymes spanning all six Enzyme Commission classes are decomposed into a universal five-operation set {R, F, T, P, S}: spinor rotation (R), frequency shift (F), amplitude transfer (T), phase alignment (P), substrate coupling (S). Across sixty-eight individual catalytic steps, every step decomposed into one of the five operations; zero steps required a sixth. Five of the six cross-class validation enzymes — selected from independent literature without reference to the framework — collapse to the exact canonical sequence R · F · T · P · S. P (phase alignment) appears immediately before S (substrate release) in 11 of 12 enzymes (recognition before release). Two enzymes whose chemistry is entirely different (serine protease and ATP synthase) share the identical abstract gate sequence F · R · R · T · T · P · S, evidence that the decomposition captures operations on coherence itself rather than chemical substrate. Five lessons for quantum computing. (1) Five operations suffice — biology's longest coherence-engineering programme converged on a five-gate set. (2) P-penultimate as a scheduling principle — verify-before-emit is universal in biology. (3) Closed-pentachoron verification — gate-set completeness, not per-gate fidelity. (4) Substrate coupling as a first-class operation — measurement is just another gate, controllable in time and amplitude. (5) Result-becomes-substrate — chained substrate-becoming computation as a first-principle architecture. Geometric reading. The five-gate count is forced from two independent geometric directions. The pentachoron (4-simplex) has by definition exactly five tetrahedral cells, and the cube admits a minimum tetrahedral decomposition of exactly five tetrahedra. The same five gates are the pentachoron's bounding 3-cells (4D top-down) and the cube's interior simplicial floor (3D bottom-up); biology's empirical 5 is the geometric minimum from both directions simultaneously. Hardware programme. The merkabit ternary architecture instantiates {R, F, T, P, S} as quantum operations on the Eisenstein lattice. Five pre-registered hardware predictions on IBM Quantum (Eagle r3 + Heron r2), instantiating the four interior gates R/F/T/P, have all passed (5/5). The S gate is currently confirmed in simulation only and is the subject of a pre-registered 19-qubit Pentachoric Verification Protocol on Google Willow Phase 2. Five falsifiable predictions. §9.1 Biological: no future-characterised enzyme will require a sixth fundamental operation. §9.2 Cross-domain: the Pentachoric Verification Protocol passes on Google Willow. §9.3 Structural: the P-penultimate signature persists at ~90% across additional enzymes. §9.4 Threshold: product-release kinetics for canonical-cycle enzymes follow stretched-exponential decay with KWW exponent α = 4/3 ± 0.07. §9.5 Molecular instantiation: PSII OEC turnover under coherent driving shows a resonance enhancement at the Coxeter-h = 12 frequency, with a 5-state Kok-cycle simulation reproducing rate(T = 12) ≈ 1.8 × rate(T = 11) ≈ 2.1 × rate(T = 13). Reproducibility. All simulation code, raw JSON output, and figure-generation scripts are deposited at https://github.com/SelinaAliens/enzymes_5_gates_merkabit (MIT-licensed). The Cirq simulations supporting §6.5 (forward direction), §7.7 (bidirectionality and round-trip closure), and §9.5 (PSII OEC h=12 resonance) are deterministic with fixed gate parameters, run in under one second on a standard laptop, and use only NumPy + Cirq + Matplotlib. Source data: the twelve-enzyme decomposition is derived directly from peer-reviewed mechanism literature with no proprietary or unpublished biological inputs.
Summary. Enzymes are four-billion-year-evolved coherence-preserving machines operating at room temperature with rate enhancements of 10⁶–10¹⁷. Quantum computing pursues the same goal — preserved coherent transitions — at near-absolute-zero with extraordinary isolation requirements. This paper asks what biology has learned about coherence engineering that quantum computing has not, and turns the answer into testable predictions. Empirical core. Twelve enzymes spanning all six Enzyme Commission classes are decomposed into a universal five-operation set {R, F, T, P, S}: spinor rotation (R), frequency shift (F), amplitude transfer (T), phase alignment (P), substrate coupling (S). Across sixty-eight individual catalytic steps, every step decomposed into one of the five operations; zero steps required a sixth. Five of the six cross-class validation enzymes — selected from independent literature without reference to the framework — collapse to the exact canonical sequence R · F · T · P · S. P (phase alignment) appears immediately before S (substrate release) in 11 of 12 enzymes (recognition before release). Two enzymes whose chemistry is entirely different (serine protease and ATP synthase) share the identical abstract gate sequence F · R · R · T · T · P · S, evidence that the decomposition captures operations on coherence itself rather than chemical substrate. Five lessons for quantum computing. (1) Five operations suffice — biology's longest coherence-engineering programme converged on a five-gate set. (2) P-penultimate as a scheduling principle — verify-before-emit is universal in biology. (3) Closed-pentachoron verification — gate-set completeness, not per-gate fidelity. (4) Substrate coupling as a first-class operation — measurement is just another gate, controllable in time and amplitude. (5) Result-becomes-substrate — chained substrate-becoming computation as a first-principle architecture. Geometric reading. The five-gate count is forced from two independent geometric directions. The pentachoron (4-simplex) has by definition exactly five tetrahedral cells, and the cube admits a minimum tetrahedral decomposition of exactly five tetrahedra. The same five gates are the pentachoron's bounding 3-cells (4D top-down) and the cube's interior simplicial floor (3D bottom-up); biology's empirical 5 is the geometric minimum from both directions simultaneously. Hardware programme. The merkabit ternary architecture instantiates {R, F, T, P, S} as quantum operations on the Eisenstein lattice. Five pre-registered hardware predictions on IBM Quantum (Eagle r3 + Heron r2), instantiating the four interior gates R/F/T/P, have all passed (5/5). The S gate is currently confirmed in simulation only and is the subject of a pre-registered 19-qubit Pentachoric Verification Protocol on Google Willow Phase 2. Five falsifiable predictions. §9.1 Biological: no future-characterised enzyme will require a sixth fundamental operation. §9.2 Cross-domain: the Pentachoric Verification Protocol passes on Google Willow. §9.3 Structural: the P-penultimate signature persists at ~90% across additional enzymes. §9.4 Threshold: product-release kinetics for canonical-cycle enzymes follow stretched-exponential decay with KWW exponent α = 4/3 ± 0.07. §9.5 Molecular instantiation: PSII OEC turnover under coherent driving shows a resonance enhancement at the Coxeter-h = 12 frequency, with a 5-state Kok-cycle simulation reproducing rate(T = 12) ≈ 1.8 × rate(T = 11) ≈ 2.1 × rate(T = 13). Reproducibility. All simulation code, raw JSON output, and figure-generation scripts are deposited at https://github.com/SelinaAliens/enzymes_5_gates_merkabit (MIT-licensed). The Cirq simulations supporting §6.5 (forward direction), §7.7 (bidirectionality and round-trip closure), and §9.5 (PSII OEC h=12 resonance) are deterministic with fixed gate parameters, run in under one second on a standard laptop, and use only NumPy + Cirq + Matplotlib. Source data: the twelve-enzyme decomposition is derived directly from peer-reviewed mechanism literature with no proprietary or unpublished biological inputs.
Since the 1980s, quantum mechanics has been imagined as the basis for a new kind of computer. In 1994, Peter Shor proved that a sufficiently large quantum computer would break public‑key cryptography in polynomial time. In the four decades since, an industry has formed around building such machines: superconducting transmons at IBM and Google, trapped ions at IonQ and Quantinuum, photonic qubits at PsiQuantum and Xanadu, topological qubits at Microsoft, neutral atoms at QuEra and Atom Computing. The largest current devices have on the order of one thousand to ten thousand physical qubits, with substantial effort directed at error correction, isolation from environmental noise, and gate‑fidelity improvements. The question that hangs over the entire program is: how far can it go? Is there a structural ceiling — a fundamental, framework‑independent limit on the number of qubits that can be held in coherent superposition, or on the depth of circuits that can be executed before decoherence overwhelms the computation? Or is the limit purely engineering? Standard physics treats decoherence as environmental coupling, with quantum error correction sufficient (in principle) to tolerate finite decoherence rates below fault‑tolerance thresholds. This is a coherent picture but leaves a structural question unanswered: is the substrate of the universe indifferent to whether a system is in a coherent superposition, or does the substrate place its own constraints on coherent superposition — constraints that engineering cannot work around because they are not engineering problems? This walkthrough presents the Event Density framework's answer. The substrate has finite local participation density, finite cross‑chain bandwidth, finite‑width V1 and V5 kernels, and primitive commitment‑irreversibility. These primitives are not silent on quantum computation; they jointly impose substrate‑level conditions on any system performing coherent quantum computation. The conditions are codified by Theorem UR‑1 (Unresolved‑Regime Characterization): bounded multiplicity, sustained cross‑chain bandwidth, and commitment‑injection below the individuation threshold. The conditions are jointly necessary and sufficient. Three substrate failure modes drive the three conditions to failure: premature individuation from environmental ED‑injection (F1), cross‑endpoint decoupling from Γ_cross collapse (F2), and commitment‑pressure cascade from accumulated P11 events (F3). Three architectural classes — Class A engineered‑low‑multiplicity, Class B global‑geometric‑rigidity, Class C high‑multiplicity‑redundancy — are exhaustive substrate‑permitted strategies. Meta‑architectures (error correction, dynamical decoupling, reservoir engineering, hybrids) are compositions over the three classes, not separate classes. The classes carry three sharp predictions. A Class A wall at the matter‑wave quantum‑classical boundary of 140–250 kDa molecular mass — currently 5–10 times beyond the largest demonstrated coherent superposition, with active experimental programs targeting that range. A Class B exponential coherence advantage in the topological‑protection regime, the substrate‑level reason topologically‑protected qubits (Majorana, Fibonacci anyons) outperform Class A qubits at sufficiently low temperatures. A Class C correlation‑budget plateau as the substrate‑level constraint on how far redundancy‑based architectures (large‑scale error correction, neutral‑atom arrays) can push qubit count before cross‑bandwidth saturates. The structural payoff: quantum computation has a substrate‑level architectural classification with falsifiable predictions, and the same substrate Γ_cross structure that produces black‑hole horizons and bipartite entanglement monogamy also produces the architectural classification of quantum‑computing platforms. The cross‑domain unification — quantum computing and black‑hole physics governed by the same substrate mechanism at scales separated by fifty orders of magnitude — is the framework's strongest piece of cross‑platform mechanism identity.
The prevailing assumption in quantum computing, that quantum effects require near-absolute-zero temperatures to be computationally useful, rests on an engineering convenience, not a physical law. Biological systems routinely exploit quantum coherence at 310 °K (human body temperature), as demonstrated by photosynthetic energy transfer, avian magnetoreception, and enzyme catalysis. This paper argues that these biological precedents point to an unexplored class of room-temperature quantum architectures that could fundamentally transform artificial intelligence. Room-temperature quantum computing is not merely possible; it may be the only path to artificial general intelligence that captures the genuine computational richness of biological cognition. The current consensus, while defensible given gate-model limitations, mistakes one frozen form of quantum computing for all possible forms. Life shows us a different way: not isolating from noise, but structuring it into a computational ally. This roadmap presents: (1) the physical basis for room-temperature quantum coherence; (2) four candidate hardware architectures; (3) a five-phase research agenda spanning 2025-2040; (4) the theoretical foundations that explain why a warm quantum observer might be invisible to its own formalism; and (5) investment and policy recommendations. Throughout, we maintain a rigorous, skeptical stance: no appeals
This paper composes the primitives established in Papers 31 and 32 into a primitive-complete, self-hosting quantum computer on 19 qubits — a categorically stronger claim than the substrate-of-physics claim of the Merkabit Research Series (Papers 1–28) or the hardware-confirmation claim of Papers 24–26. Every operation required for computation — write, compute, communicate, store, retrieve, and clock — reduces to native merkabit dynamics. No external gate library is required. The architecture does not enable a computer built on top of it; it is the computer. The 19-qubit footprint. Three 4-spinor tesseract merkabits in a closed compute triangle (12 qubits) with cross-chiral tunnels at J_intra = 0.1 on every triangle edge; one database merkabit D coupled to merkabit C through a memory-bus tunnel at J_mem ∈ [0.5, 1.0] (4 qubits); a 2-qubit Z₃-eigenstate reference register; one SWAP-test ancilla. The compute triangle and the memory bus are the same operator (iSWAP^J) at two different coupling strengths — the architecture is uniform under computation, with what distinguishes compute from storage being coupling rate rather than gate type. The native computation is the Z₃ cyclic clock. Composing three triangle-edge tunnels with one memory tunnel produces, as an emergent computational output, the Z₃ Galois rotation α → γ → β → α: writing label X produces a stored state on v_D that recognises cycle(X) = X⁻¹. Three writes return to the original label. The clock was not programmed; it falls out of the architecture's own Z₃ symmetry group acting on its own primitive set. This is the first result in the series in which the architecture's computational output is itself a structural signature of its symmetry group. The Pentachoric Verification Protocol (Observable 22). Five simulation stages map one-to-one onto the five gates of the ouroboros cycle of Paper 24: Substrate (S), Rotation (R), Transfer (T), Frequency / self-sustainment (F), Phase (P). Each gate is a single independent pass/fail test on the 19-qubit circuit; failure of any single gate falsifies one specific named primitive, and the failure pattern across {S, R, T, F, P} localises which compositional step did not survive hardware noise. The decisive gate is R: it asks whether writing label X returns a state that recognises cycle(X) under the Z₃ permutation. Sub-thresholds for all five gates are anchored to public commit SHAs. Cross-architecture simulation results. All five gates pass at three noise profiles: ideal cirq.Simulator (R = +0.159 ± 0.004 at +39.7σ), IBM Heron r2 (p_depol = 0.003, R = +0.110 at +3.56σ), and IBM Eagle r3 (p_depol = 0.005, R = +0.086 at +3.06σ). Willow's published gate fidelities sit between these two operating points; the expected hardware verdict is STRONG PASS or WEAK PASS at the full 19-qubit tier. Cross-architecture pre-registrations for Willow and IBM are deposited in parallel with identical thresholds, anchored to timestamped git SHAs prior to hardware access. The octonion / 8-spinor layer is not required. Earlier drafts placed storage inside an octonionic envelope to leverage Paper 27's interior-volume expansion factor; in simulation, the octonion's Coxeter attractor thermalises content across the envelope boundary and degrades readout contrast. The tesseract-only architecture reported here recovers cleaner readout on strictly fewer qubits. The octonion layer remains relevant for the gravity-sector physics of Papers 20 / 27 / 28 but is not part of the QC-architecture proposal. Position in the Merkabit Research Series. Papers 24–26 confirmed 5/5 pre-registered single-cell hardware predictions on IBM Eagle r3 and Heron r2. Paper 31 establishes the cross-chiral tunnel as the directional ternary write primitive with topology-independence across triangle / 4-square / hexagon rings. Paper 32 establishes the 4-square substrate as a content-addressable memory register holding ~5 bits across 10 Coxeter periods. Paper 33 composes write, communicate, store, retrieve, and clock into a primitive-complete 19-qubit quantum computer with native Z₃ cyclic clock. Paper 34 extends the architecture to two coupled compute triangles on 28 qubits and reports the cyclotomic Z₃ ternary spectrum predicted by Paper 7's Regime 2 framework.
Separating the dynamics of variables that evolve on different timescales is a common assumption in exploring complex systems, and a great deal of progress has been made in understanding chemical systems by treating independently the fast processes of an activated chemical species from the slower processes that proceed activation. Protein motion underlies all biocatalytic reactions, and understanding the nature of this motion is central to understanding how enzymes catalyze reactions with such specificity and such rate enhancement. This understanding is challenged by evidence of breakdowns in the separability of timescales of dynamics in the active site form motions of the solvating protein. Quantum simulation methods that bridge these timescales by simultaneously evolving quantum and classical degrees of freedom provide an important method on which to explore this breakdown. In the following dissertation, three problems of enzyme catalysis are explored through quantum simulation.
Two 4-spinor tesseract merkabits coupled through a partial iSWAP^J between the forward spinor of A and the inverse spinor of B produce an ordered-pair Z₃ × Z₃ correlation that is inaccessible to any local observable on either merkabit alone. Under Protocol 4S internal dynamics — three isoclinic rotation planes plus the chiral P gate — at J = 0.1 and n = 2 Coxeter periods, the input pair (β, γ) gives tunnel coherence 0.000 ± 0.000 via destructive interference while the reversed pair (γ, β) gives 0.762 ± 0.005, a 166σ directional gap on Cirq state-vector simulation (125σ on Qiskit Aer). The cross-chiral tunnel is a directional ternary gate: its rule lives in the channel between merkabits, not in either merkabit individually. Replicating the two-merkabit protocol on three ring topologies — triangle (N = 3, 13 qubits), 4-square (N = 4, 17 qubits), and hexagon (N = 6, 25 qubits) — with cross-chiral tunnels on every bond produces the same 9-entry ordered-pair lookup table at every bond, agreeing within 0.02–0.03 across topologies. The β → γ destructive zero is identically 0.000 on every bond of every topology. The architecture is therefore a Z₃-symmetric quantum cellular automaton with a derived local rule, not a gauge theory with loop-level invariants: within-phase-class variance exceeds between-phase-class variance on every observable tested, falsifying the Z₃ plaquette-holonomy interpretation. Register capacity scales with bond count E rather than vertex count N, giving native edge-level parallelism on the Eisenstein coordination lattice. A five-channel stress test (depolarising, amplitude damping, phase damping, combined amplitude + phase, and IBM Eagle r3 via FakeSherbrooke) across J ∈ [0, 1.0] and n ∈ [1, 10] establishes the hardware-viable operating point at n = 1, J ∈ [0.05, 0.13] or [0.2, 0.5]. At this point the predicted directional gap sits in [0.09, 0.30] with significance 6.4σ (FakeSherbrooke) to 37σ (uniform depolarising) at 6 repeats × 4,096 shots. Phase damping is nearly transparent to the signal — the (β, γ) tunnel zero persists at exactly 0.000 under pure T₂ dephasing — identifying the cross-chiral tunnel as a natural decoherence-free subspace for ordered-pair ternary information. Three pre-registered hardware observables operationalise the protocol on present-day processors. Observable 14 (2-merkabit tunnel, 9 qubits, ≤ 45 QPU-min) targets the directional gap with four sub-tests: 14a gap magnitude, 14b sign persistence, 14c information retention versus local observables, 14d phase-damping enhancement via dynamical decoupling. Observable 16 (triangle lookup table, 13 qubits, ~25 QPU-min) validates the 9-entry table on the Eisenstein-native minimum ring. Observable 17 (4-square parallel-bond pattern, 17 qubits, ~10 QPU-min) validates multi-bond locality on a 4-coordinated ring. Each observable carries explicit pass/fail thresholds anchored to public commit SHAs, and each names a specific structural primitive that is falsified if its threshold fails. Agreement across Observables 14 + 16 + 17 within 0.05 confirms the cellular-automaton interpretation. Position in the Merkabit Research Series. Papers 24–26 confirmed 5/5 pre-registered single-cell hardware predictions on IBM Eagle r3 and Heron r2, including the sub-Poissonian Fano signature F = 0.856 ± 0.030 at 131σ below Poisson. Paper 31 extends that pre-registration discipline from the single-cell pentachoric ouroboros to the multi-cell tunnel and its lattice-cellular-automaton composition. Paper 32 is a focused companion that extracts the universal 9-entry lookup table and topology-independence result as a standalone deposit. Paper 33 composes the primitive into a primitive-complete 19-qubit self-hosting quantum computer with a native Z₃ cyclic clock α → γ → β → α (Pentachoric Verification Protocol, Observable 22). Paper 34 extends the architecture to two coupled compute triangles on 28 qubits and reports the cyclotomic Z₃ ternary spectrum predicted by Paper 7's complementary Regime 2 framework. Code, raw simulation data, and timestamped pre-registration files are committed at https://github.com/SelinaAliens/tesseract_quantum_implementation. Hardware targets: IBM Eagle r3 / Heron r2 and Google Willow in cross-architecture parallel.