WITHDRAWAL NOTICE (18 October 2026). This paper is withdrawn and should no longer be cited as a result. Its central result cannot be reproduced: as its own June note records, the original code was lost and four reimplementations reached 0–17% against the reported 94%; without the lattice embedding another graph beats the claimed structure at the paper's own weights [G3], and the truncated-cubic assembly it targets has been retired [G84]. The research programme was concluded in October 2026; its review found the framework's Standard-Model content assigned rather than derived. The original description is kept below for the record. Original description (kept for the record): We demonstrate via simulated annealing that an unstructured network of N qubits, subject only to a degree-3 regularity constraint and spectral energy minimisation, sponta- neously partitions into ⌊N/8⌋copies of the Q3 hypercube graph — the unique 3-regular, vertex-transitive graph on 8 vertices supporting a distance-4 error-correcting code realis- able as the face-adjacency graph of a regular octahedron in three dimensions. Over 100 independent trials from random initial conditions with N = 24, perfect Q3 crystallisation occurs in 94% of runs. We prove that Q3 is the unique optimal target by ruling out all competing graphs on independent geometric and coding-theoretic grounds: the Petersen graph fails both the convex polyhedral embedding test and the 4-cycle (distance-4 parity check) requirement. Frustrated configurations (N ̸≡0 (mod 8)) produce high-energy partial clusters that cannot close their parity-check circuits, providing a discrete model of quantum vacuum fluctuations. When inter-cluster bonding is permitted, the isolated octahedra spon- taneously form bridge connections, assembling into a connected lattice network. The code and all simulation data are publicly available for independent reproduction.
WITHDRAWAL NOTICE (18 October 2026). This paper is withdrawn and should no longer be cited as a result. Its central result cannot be reproduced: as its own June note records, the original code was lost and four reimplementations reached 0–17% against the reported 94%; without the lattice embedding another graph beats the claimed structure at the paper's own weights [G3], and the truncated-cubic assembly it targets has been retired [G84]. The research programme was concluded in October 2026; its review found the framework's Standard-Model content assigned rather than derived. The original description is kept below for the record. Original description (kept for the record): We demonstrate via simulated annealing that an unstructured network of N qubits, subject only to a degree-3 regularity constraint and spectral energy minimisation, sponta- neously partitions into ⌊N/8⌋copies of the Q3 hypercube graph — the unique 3-regular, vertex-transitive graph on 8 vertices supporting a distance-4 error-correcting code realis- able as the face-adjacency graph of a regular octahedron in three dimensions. Over 100 independent trials from random initial conditions with N = 24, perfect Q3 crystallisation occurs in 94% of runs. We prove that Q3 is the unique optimal target by ruling out all competing graphs on independent geometric and coding-theoretic grounds: the Petersen graph fails both the convex polyhedral embedding test and the 4-cycle (distance-4 parity check) requirement. Frustrated configurations (N ̸≡0 (mod 8)) produce high-energy partial clusters that cannot close their parity-check circuits, providing a discrete model of quantum vacuum fluctuations. When inter-cluster bonding is permitted, the isolated octahedra spon- taneously form bridge connections, assembling into a connected lattice network. The code and all simulation data are publicly available for independent reproduction.
WITHDRAWAL NOTICE (18 October 2026). This paper is withdrawn and should no longer be cited as a result. It is built on a lattice geometry — the 4.8.8 tiling ("circlette") and the truncated cubic honeycomb, with octagonal faces and regular-octahedron cells — that the framework retired between June and September 2026. The theorems and mechanisms tied to that geometry were withdrawn [G81, G84]. Its headline results — among them the fine-structure constant and the Planck mass — have since been withdrawn [K13, G99]; later accounts are 10.5281/zenodo.20962395 and 10.5281/zenodo.22650175. The research programme was concluded in October 2026; its review found the framework's Standard-Model content assigned rather than derived. The original description is kept below for the record. Original description (kept for the record): What if empty space is not empty — and not continuous? What if the vacuum is a crystal, built from quantum error-correcting codes, whose geometry produces the particles and forces of nature as naturally as ice produces snowflakes? This nine-part series traces a path from the measured reality of the quantum vacuum — the Casimir effect, the Lamb shift, the 10¹²¹ catastrophe — through the Standard Model's extraordinary successes and stubborn failures, to a specific, concrete proposal: an 8-qubit code on the faces of octahedral voids, self-organised into a three-dimensional honeycomb lattice, reproducing the 45 known fermions of the Standard Model from three Boolean rules and a single quantum logic gate. The series derives fundamental constants (including the fine-structure constant to 3 parts per billion) from counting faces and bridges, demonstrates spontaneous crystallisation of the lattice from unstructured qubit soups via simulated annealing, and dissolves the famous paradoxes of quantum mechanics — entanglement, wave function collapse, the double slit, Bell's theorem — into mechanical consequences of qubits propagating through a discrete geometry. Each article is self-contained and accessible to any numerate reader. Full mathematical derivations are linked as companion documents. Fourteen falsifiable predictions are stated explicitly, and every open problem is honestly catalogued. The framework may be wrong — but it is precise enough to be shown wrong, and that is what separates physics from philosophy. The title nods to Richard Feynman's "Six Easy Pieces." Feynman needed six. The octahedron needed eight. The paradoxes needed one more. Keywords For the series as a whole (use the five most relevant per article, rotating as needed): Quantum Physics, Quantum Computing, Particle Physics, Information Theory, Mathematics, Theoretical Physics, Cosmology, Science, Standard Model, Error Correction, Quantum Mechanics, Dark Matter, Dark Energy
STATUS (18 October 2026). The research programme this paper belongs to — the finite-QEC substrate ("It from Bit") framework — was concluded in October 2026. The author's review found that the framework's Standard-Model content is assigned rather than derived and that no verified prediction yet distinguishes it from standard physics. The claim of a unified derivation is withdrawn. This paper's results are unaffected except where noted below. Current gravity work: 10.5281/zenodo.23458252. ERRATUM — fine-structure constant (18 October 2026). This paper quotes the framework's value of the fine-structure constant, α−1(0) = 137.035999106904 (or the earlier 137.035999077), as agreeing with experiment. That statement is withdrawn. (1) On 11 August 2026 the value was corrected to 137.0359991069051: the earlier figure came from an extrapolation fitted at the wrong order. Against current determinations the corrected value sits −2.26σ from the caesium-recoil value, +9.01σ from the rubidium-recoil value and +3.94σ from the electron-g−2 route. Those determinations disagree with one another, so no single agreement figure can be quoted [K13]. (2) The second-order coefficient behind the value was computed on a four-dimensional hypercubic lattice that the framework's own geometry does not supply. Recomputed on that geometry under a pre-registered procedure, the same formula gives 137.0359985927, 4.26 parts per billion below CODATA 2022, so the claimed agreement does not survive [G87, G88, 24 September 2026]. The bare count α0 = 1/137 used in the paper is a premise of the framework, not a derived result. Noted: the methodology, the byte construction (with its CSS step stated as a hypothesis, consistent with [R22]) and the 28-step clock stand. Its fine-structure value is corrected by the erratum above; its "bi-cubic" picture of the cell differs from the framework's locked bond-bipyramid cell [G84]; and full strain readout does not preserve all logical coherence [G90]. States the foundational objects and audit methodology of the finite-QEC (quantum-error-correction) substrate program: the eight-bit local code, the bi-cubic crystallisation picture, the distinction between syndrome and strain readouts, the 28 = 2×14 service-clock construction, and the methodological rules that classify every claim as locked, computed, conditional, retired, or open. The goal is to make the companion physics papers auditable: every coefficient must name its carrier, event unit, scheduler, observable map, and reproducibility check. Version 3.0. Added a radiation-sector domain-of-validity caveat (the emergent gauge sector is an effective theory below the substrate's Brillouin scale; trans-cutoff single photons are an open foundational question) and the relativity companion citation. Copyright (C) 2026 D. G. Elliman.
WITHDRAWAL NOTICE (18 October 2026). This paper is withdrawn and should no longer be cited as a result. It is built on a lattice geometry — the truncated cubic honeycomb ("Z3 ⊗ Q3"), with octagonal faces and regular-octahedron cells — that the framework retired between June and September 2026. The theorems and mechanisms tied to that geometry were withdrawn [G81, G84]. Its mechanism needs one nucleon per lattice cell, a packing withdrawn with the ħc/Λ lattice step [G100]; what remains is the standard Gamow tunnelling calculation. The research programme was concluded in October 2026; its review found the framework's Standard-Model content assigned rather than derived. The original description is kept below for the record. Original description (kept for the record): We reformulate alpha decay as a two-stage algorithmic process on a discrete Z3 ⊗ Q3 topological lattice. Standard continuous wave mechanics models the propagation of an alpha particle through a Coulomb barrier (Gamow tunnelling) but relies on phenomenological fits for the preformation prob- ability and assault frequency (the Geiger-Nuttall intercept). In this framework, the pre-tunnelling rate is derived as a calculable geometric edge-cut problem. Feshbach projection of the lattice walk operator yields a detachment rate of 1/36 per severed macroscopic gauge bridge. Assuming rapid many-body decoherence renders this a Markov process, the detachment rate scales as 36−k , where k is the integer number of boundary bridges. For a 2 × 2 cluster detaching via a minimal topological neck (k = 2), the framework predicts a pre-tunnelling emission rate of 1.14 × 1020 s−1, recovering empirical preformation phenomenology without fitted parameters. Post-detachment, the evanescent spatial propagation takes the form of a discrete tight-binding Riemann sum, which converges to the standard macroscopic WKB phase integral, explicitly recovering the 2πα√2mαc2 Gamow slope. Evaluating this unified equation end-to-end for 238U and 212Po yields effective barrier radii perfectly consistent with standard diffuse nuclear surfaces.
WITHDRAWAL NOTICE (18 October 2026). This paper is withdrawn and should no longer be cited as a result. It is built on a lattice geometry — the 4.8.8 tiling ("circlette") — that the framework retired between June and September 2026. The theorems and mechanisms tied to that geometry were withdrawn [G81, G84]. Its matrix element is a band velocity, not a gauge coupling, and fixes no interaction [K8, G84]; the velocity unification it supports was withdrawn [K7]. The research programme was concluded in October 2026; its review found the framework's Standard-Model content assigned rather than derived. The original description is kept below for the record. Original description (kept for the record): We analyse the symmetry structure of the continuous-time quantum walk on the 4.8.8 (truncated square) Archimedean tiling, whose bifurcated band structure was recently char- acterised via OTOC echo protocols [1]. Decomposing the 8 ×8 Bloch Hamiltonian into irreducible representations of the C4v point group at the Γ point, we show that the gapped slow branch transforms as the fully symmetric scalar representation A1, while the gapless fast branches transform as the two-dimensional vector representation E. At Γ, the Wigner-Eckart theorem enforces strict orthogonality between these sectors: ⟨A1|H|E⟩= 0. Away from Γ, symmetry reduction C4v →Cs breaks this selection rule. We compute the inter-branch matrix element exactly and find M=− i 2 sin kx for the Ex component, yielding a momentum- linear vertex M∝i(k·E) that is structurally identical to the p·A minimal coupling of quantum electrodynamics. We then promote the tight-binding hopping amplitudes to dy- namical U(1) link variables in a Wilson lattice gauge theory, demonstrate via a weak-field expansion that the gauge-covariant Hamiltonian reproduces the same vertex, and identify a two-coupling structure (β4,β8) rigorously locked by the tiling geometry. We formulate the velocity-unification conjecture—that renormalisation group flow drives the distinct bare group velocities toward a common infrared fixed point—as a concrete numerical programme for lattice Monte Carlo simulation.
Major revision, 19 October 2026. This revision separates three objects previously conflated: a classical [8,4,4] code, its one-code CSS stabilizer state, and a nonlinear set of 48 allowed eight-bit register words. The register admits a 32+16 partition by one generation bit. A declared evolution preserves that partition if its operators commute with the corresponding parity. This elementary conservation statement is retained; it does not establish a concatenated quantum code, a noise threshold or topological protection. The channel-friction ansatz, golden-ratio fixed point and XOR bookkeeping are given their proper conditional scope. Claims of CKM predictions and a derived particle-mass mechanism are withdrawn, as is the claim that the legacy walk is native to the corrected geometry. Changes from earlier versions: The revision removes concatenated-code/topological-protection claims and CKM/mass predictions unsupported by the declared register and retired transport law. The revision separates 16 codewords, a one-dimensional CSS stabilizer space and 48 allowed register words; the latter has Hamming distance one. The revision corrects the geodesic/line-graph count. The revision states a real recovery criterion and the hypotheses of the commutation argument. Retained result: Classical code facts, the nonlinear register count, a conditional sector-conservation proposition and explicitly conditional scalar/graph identities. Previously titled: A Concatenated Quantum Code with Topologically-Protected Outer Structure on the Q3 Hypercube: Channel-Friction Semantics and Applications to Particle Physics. The preceding version and earlier versions remain available. This is a revised preprint, not an independently peer-reviewed result. It uses existing evidence; no new scientific calculations were run and research branches remain frozen. AI assistance is acknowledged in the manuscript. Revision guide for all twelve papers. The attached PUBLICATION_UPDATES.csv provides old and new titles, DOIs and replacement descriptions for catalogue and website updates.
Quantum annealing and quantum approximate optimization algorithms hold a great potential to speed-up optimization problems. This could be game-changing for a plethora of applications. Yet, in order to hope to beat classical solvers, quantum circuits must scale up to sizes and performances much beyond current hardware. In that quest, intense experimental effort has been recently devoted to optimizations on 3-regular graphs, which are computationally hard but experimentally relatively amenable. However, even there, the amount and quality of quantum resources required for quantum solvers to outperform classical ones is unclear. Here, we show that quantum annealing for 3-regular graphs can be classically simulated even at scales of 1000 qubits and 5000000 two-qubit gates with all-to-all connectivity. To this end, we develop a graph tensor-network quantum annealer (GTQA) able of high-precision simulations of Trotterized circuits of near-adiabatic evolutions. Based on a recently proposed belief-propagation technique for tensor canonicalization, GTQA is equipped with re-gauging and truncation primitives that keep approximation errors small in spite of the circuits generating significant amounts of entanglement. As a result, even with a maximal bond dimension as low as 4, GTQA produces solutions competitive with those of state-of-the-art classical solvers. For non-degenerate instances, the unique solution can be read out from the final reduced single-qubit states. In contrast, for degenerate problems, such as MaxCut, we introduce an approximate measurement simulation algorithm for graph tensor-network states. On one hand, our findings showcase the potential of GTQA as a powerful quantum-inspired optimizer. On the other hand, they considerably raise the bar required for experimental demonstrations of quantum speed-ups in combinatorial optimizations.