Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

The Qubit on the Two Rings: Rotation Gates, Pauli Phases and the Live Checksum

Neal Strassner

Published Oct 9, 2026• 0 citations
Publisher

Abstract

A qubit is one setting of the two sliding rings. The rotation gate Rz(θ) has entries cos(θ/2) and sin(θ/2), and the instrument's law is d = 2cos(θ/2) between the centers and e = 2sin(θ/2) between the crossings at crossing separation θ: the gate matrix is read off the setting, the Bloch amplitudes are the two half-distances, and Born's rule is the two shares of one unit. Composing rotation gates is adding positions, certified by the ring's addition law. The spinor's sign, −1 after a 360° rotation and +1 after 720°, is the ring's half turn, digits summing to ten, and its lap. The Pauli phases i, −1, −i are the quarter-turn orbit 7, 9, 3, and the phase exponent of any Pauli product is carried by the digits, verified on two hundred random products. The hidden symmetry of the Jordan–Wigner transformation that Davis and Freericks (arXiv:2512.24589) use to halve measurement circuits is the ring turning, its two angles are the quarter turn and the eighth turn, and its identities are the fold law averaged round the ring, whose coefficients 3/8 and 1/8 are exact averages over the sixty positions. Their equation 24 is verified on random fixed-number states of four qubits. From this one picture the paper places the live checksum where it can live in a quantum computer: on the classical phase registers that drive virtual-Z gates and merge rotations, on the classical Pauli frame, and on measured expectation values through the symmetry identities, which flag every number-changing error, while the law of readings of the companion paper catches the number-conserving ones. And it states where it cannot live, on the amplitudes themselves, by the no-cloning theorem. The four operator-mechanics papers of Freericks and colleagues, the operator Rodrigues formula, the momentum measurement, the free expansion of a Gaussian and the squeezed-state wavefunction, are then worked side by side as examples of the same picture: one slide, one quarter turn, one shear, one rotating ellipse. Every number is verified by the script in the appendix.

DOI
10.5281/zenodo.23265465

Related papers

Quantum Computing on the Sixty-Ring: Every Gate a Setting, Every Gradient a Quarter Turn, and a Checksum on the Classical Half

Neal Strassner

Every tool of quantum computing is one of three moves on two sliding rings marked with the sixty last digits of the Fibonacci numbers. A setting is a value read off one placement of the rings. A fold is a product turned into a sum by the half-angle law. A turn is a shift of position that carries a digit with it. Every gate is a setting, its entries cos(θ/2) and sin(θ/2) the half-distances of the rings at crossing separation θ, and the Hadamard, CZ and CNOT are quarter and half turns. Born's rule is the fold, amplitudes read at position k and expectation values at 2k. Every gradient is a quarter turn, because the parameter-shift rule is the ring's derivative law, its two shifts the ×7 and ×3 laws, with four eighth turns where a Givens gate needs them. A complete variational run is worked on a two-qubit number-conserving Hamiltonian. The energy is the ring shifted ten positions, the ground state the vesica setting at position 20, the optimizer three readings and a gnomon with nothing to tune, its convergence one line. Noise is the radius of the rings, and the square inside the ring, the stabilizer octahedron, says when the noise has cost a magic state. Phase estimation, Shor's classical end, Grover's search, Trotter chains, QAOA, Bell tests, teleportation, error mitigation, benchmarking and the [[4,2,2]] and [[5,1,3]] codes each reduce to the same three moves, forty tools on one page, and because every unitary is a finite product of rotation gates, the list is open and the three moves are closed. A checksum rides every classical number of the loop, the digits under the crossings on each setting, the addition law on each sum, the quarter-turn law on each gradient, the symmetry identity ⟨XX⟩ = ⟨YY⟩ on the measured data with its alarm threshold read off the setting, every one-, two- and three-bit upset of a 32-bit phase word and every burst of up to fifteen bits caught by three rings in lockstep, every corruption of any kind caught by the ladder, and the decoder table of the perfect code built on the four quarter turns of the net, any four simultaneous faults in an entry restored. The guard stands on every classical register of the loop, and the code space stands on the qubits. Thirty-one jobs on three IBM machines close the paper. A clean run on a 156-qubit machine had every compiled angle certified, the injected bit flip flagged at over a hundred standard errors, the clean checksum inside its line, the radius reading the noise, and the Bell value above 2, and one bit flipped in a phase word before submission, four ways, caught by the guard every time, turning the ground state into the top of its number sector and, from the entangler word, into the top of the whole spectrum when sent unguarded. The same words were corrupted up to all ten at once, by any change up to every bit inverted, and read both ways in four runs, unguarded and through the guard, and every setting word of a many-qubit tower was corrupted past any real error rate, caught and rebuilt in place, and read right on the machine. Every number is verified by the script in the appendix on explicit matrices and states, and the hardware readings are checked against the result files.

•Oct 10, 2026•0 citations

Quantum Dynamics and Entanglement on the Two Rings: Larmor Precession, Rabi Oscillations, Ramsey Fringes, Two Rings That Share One Radius, and the Line Between Classical and Quantum Correlation

Neal Strassner

Quantum mechanics does two things with a two-level system. It turns it, and it entangles it. Both live on the two-ring instrument. Dynamics first. The Schrödinger equation for any two-level Hamiltonian is precession. The Bloch vector rotates about the axis of the energy splitting at the rate the splitting sets, so time evolution on the rings is the setting moving, certified at every instant. Larmor precession is the pure turn at γB, 42.577 million turns a second for a proton in one tesla. The Rabi oscillation is the energy lever swept in time, the ground and excited shares cos² and sin² of one accumulated setting. The Ramsey fringe is two settings and a fold, the most precise frequency measurement in physics read as d/2. The spin echo is the half turn against drift. Entanglement second. For any pure two-qubit state the two qubits' rings carry the same radius, and that radius is set by the concurrence, r = √(1 − C²), full radius for a product state and zero for a Bell pair. Entanglement is two rings forced to share one radius. Generating it is the energy-sloshing lever of the companion papers read between rings. Under the exchange interaction the concurrence grows as sin Ωt while both radii shrink as cos Ωt, and the pair is a Bell state at the quarter period, when both radii vanish. The second part is then made into instruments. The entanglement monitor reads the concurrence of a running experiment from one qubit's statistics, one measurement setting for the exchange family and three for any pure state, against nine for tomography. The certified entanglement clock reads the slosh tick by tick, the calibration, the diagnostics and the ledger of an entangling gate. And the classical line is drawn where correlation stops being classical. The radius is blind on the whole Werner family, and the witness |⟨XX⟩| + |⟨YY⟩| + |⟨ZZ⟩| = 1, the fold read beside the correlation in the pair's own frame, draws the line the radius cannot. The same identity passed a real machine's clean run at 1.01 standard errors and flagged an injected fault at 112. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.

•Oct 10, 2026•0 citations

Where the Rings Stop: Ring Chains as Certified Tensor Networks, and the Three-Level Setting, a Research Program

Neal Strassner

Two walls stand at the edge of the two-ring instrument, and this paper is the map of both. Many qubits first. One setting reads two amplitudes and N qubits carry 2^N, and that wall is the only thing between the instrument and many-body quantum mechanics. Part I is the map of the attempt to scale through it, chains of certified rings in lockstep, each qubit a setting with its digit certificate, entanglement between neighbours as the shared-radius coupling of the companion paper, local turn laws carrying the gates, a geometric form of the tensor networks that are classical physics' own escape from the same wall. What carries over is stated exactly and verified. Across every cut of a chain the two sides share one spectrum, so the cut's radius is its certificate. An eight-link chain built by one layer of levers holds at most one bit per cut and is held by a chain of bond two to a fidelity of 1.000, and a random eight-qubit state has rank 16 at the middle cut and is held to 0.162, the wall exhibited. The move past it is the nesting of the companion repair paper, a ring inside every cell, done here as a setting inside every share. A setting whose two shares are themselves settings, applied down to single qubits, holds any pure state of N qubits exactly, 2^N − 1 settings for 2^N amplitudes, the standard's own count, verified on random states at every size to eight qubits and on the same random state the chain held to 0.162, with every setting on the ladder. At a node the entanglement of that qubit with the rest is sin θ √(1 − |⟨ψ₀|ψ₁⟩|²), the Wootters concurrence for a pair, largest at equal shares over mirror branches. A Z turn on qubit k turns the azimuths at depth k and nothing else, and a measurement reads the root's shares and leaves its branch. On ibm_kingston a random three-qubit state was prepared from its seven settings as the machine's own gate angles and its populations read within 0.048 of the tower's shares. The contraction that turns the chain into a reading is classical arithmetic, and the ladder guard of the companion paper stands on it, 112 fixed-point words carrying their base-60 digit pairs, 200 random corruptions of one to six bits, every one caught from the shadow alone and every word recomputed, while the unguarded contraction returned a wrong energy in 155 of the 200. The five problems of the chain program are each settled where they stand: the tower is the canonical form, a gate on any qubit needs no route through its neighbours, the contraction's cost is measured, the classes the tower compresses are counted, and the width a chain needs to follow the dynamics is the entanglement across its cuts, measured. Three levels second. A pure qutrit carries four real parameters and one setting reads two lengths. The populations are read by two levers, one inside the other, the tower of Part I at its smallest: the first splits level 0 from the rest and the second splits the rest between levels 1 and 2, so every split is reachable, a state fully in one level included. Two certificates ride them, the sum to one and the product law, the coherence between two levels at most the product of their two amplitudes and equal to it for a pure state, and on a thousand random qutrits every one-percent misread of the populations is caught by one of the two, 1,000 of 1,000, 992 of them by the sum alone. The threefold turn a qutrit wants is not a single-digit multiplier, and that is a theorem, not bad luck. The Pisano period over the rank of apparition is 1, 2 or 4 (Vinson 1963), confirmed by enumeration to modulus 250. But the sixty-ring carries the threefold turn as a two-term law, F(n + 20) ≡ 5F(n + 1) + F(n) (mod 10) at all sixty positions, and 178 moduli below 250 carry the same law at a third of their period. The two relative phases are read as well, by three two-level settings, one for each pair of levels, whose azimuths obey the addition law exactly, the third certified by the other two, so that three populations and two certified phases rebuild every pure qutrit, verified on a thousand. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.

•Oct 11, 2026•0 citations

The Harmonic Oscillator on the Two Rings: Geometry in Place of Operator Mechanics, with a Check on Every Step

Neal Strassner

The simple harmonic oscillator is solved by geometry on the two-ring instrument and the Fibonacci 60-ring of the companion papers, with every step checked as it is made, in lengths a student can draw. The route it replaces is the operator mechanics that Freericks and Doughty (arXiv:2305.00062, 2023) propose for teaching: trade the differential equations of wave mechanics for abstraction and run every solvable problem on four operator identities, with the oscillator as the worked case, solved three ways, the operator way resting on the canonical commutation relation, the factorization of the Hamiltonian, a second singular factorization that finds the odd states, and wavefunctions built from a translation operator and an operator form of the Rodrigues formula. This paper is the fourth way. The oscillator is a point on a ring: one setting reads its position between the centers and its momentum between the crossings. Velocity sits a quarter turn ahead and acceleration a half turn ahead, and the ring's digit laws, times seven and sum to ten, check each step. The energy is the radius squared. The commutation relation, the postulate their h-bar enters by, is the size of one cell of phase space: the ground orbit encloses h/2, one triangle, and every annulus between orbits encloses h, one diamond, so h enters the system as a unit, where m and omega do, and nowhere else. On the ring the area per step is the Casoratian of the wave, one constant at all sixty positions, with Cassini's identity as its digit shadow. The stationary states are rings themselves: by Wigner's phase-space formulation, which is exact for the oscillator, time evolution is a rigid rotation, a stationary state is a function of the radius alone, the position density is that ring projected on the center line and the momentum density the same ring projected on the crossing line, and the paper verifies that these projections are the standard densities. The wavefunctions themselves come from one slide: slide the ground blob along the center line, and the powers of the slide are the Hermite functions, with the explicit formula, the recurrence and the matrix elements falling out of two multiplied series where their paper needs a Gaussian similarity transform, nested commutators and an induction. The quarter turn is the Fourier transform, which is how momentum is measured in a trap. Their singular factorization sorts the states by the sign of the ring at its center, the parity. The spectrum E = h-bar omega (n + 1/2), counted in the equilateral triangles of the Tetryonics model, is the odd numbers: the ground state is one unsplittable triangle, each rung is one diamond, one photon, the totals are the squares, hydrogen's n squared, and the three-ring oscillator's degeneracies are the triangular numbers, one triangle read three ways. Their four identities, at the oscillator, are the addition of positions plus the area term. Every formula used is standard and cited, and every number is verified by the script in the appendix.

•Oct 10, 2026•0 citations

Arrow Logic Algebra Boolean Gates Using the Complex Numbers, Quaternions and Octonions

Viktor Ariel

Most of quantum computing today is written in the mathematics of quantum mechanics: complex vectors and the matrices that act on them. This mathematics has served physics well, yet it is not a Euclidean number system. In it, two states of one system cannot be multiplied and divided back, and a turn about a general axis is a matrix rather than a number. What would be an alternative Euclidean number system, possibly suitable for quantum mechanics? Recently, we proposed the Arrow Numbers, the complex numbers, quaternions and octonions, as such a system. Together with the real numbers, they are the normed division algebras. In them, lengths multiply, every nonzero arrow divides, and the Euler relation turns an arrow about any axis. What if we build a Boolean algebra on this Euclidean mathematics? With a bit written as a sign, ±1, the basis units multiply as the XOR logic function of their labels. Then a half turn is the NOT function, and a quarter turn is its square root. When an arrow moves through the zero of the arrow Argand sphere, it acts as a threshold. Thus the sign of a sum of three inputs gives the majority gate, and hence AND, OR and NAND. Reversibly, the quotient of the two orders of a quaternion product is the AND of two bits, AB(BA)⁻¹ = (−1)^(ab), which builds the Toffoli gate. Likewise, the two groupings of an octonion product give the AND of three bits. Thus each doubling gives up one rule of arithmetic, and the quotient that measures it carries one more degree of AND. These identities are known, and we read them as gates. In standard CMOS design, NOT and every product by a fixed basis unit are implemented as wiring. Moreover, the Toffoli gate takes fourteen transistors, and the product and the zero crossing make a full adder. SPICE simulations confirm every truth table. Accepted for publication in the Journal of Applied Mathematics and Physics (2026-10-22). The checks archive contains the Julia script of the algebra (59 tests), the switch-level circuit checks and the SPICE netlists and driver, each check with a control that must fail, and the logs of the runs.

•Oct 11, 2026•0 citations

The 24-Cell Is a Gate Group: How the Binary Tetrahedral Structure Governs What a Qubit Can and Cannot See

Masanori Watabe, Claude Opus 4.8 Kurado

The Watabe-Claude Method reads a signal's structure by assigning 4D-embeddedwindows to the 24 vertices of the 24-cell and decomposing the occupancy with thegroup B4. This note takes the 24-cell the other way -- into a qubit. Its 24vertices, as unit quaternions, are exactly the binary tetrahedral group 2T, afinite nonabelian subgroup of SU(2); under the quaternion-to-SU(2) map they are24 distinct single-qubit gates. Three exact facts, all verified by classical simulation of one or two qubits(no external quantum or group-theory libraries): 1. Foundation. The 24 vertices form 2T (order 24): closed Cayley table, Latin square, 24-cell inner-product signature {-1,-1/2,0,1/2,1}. As SU(2) matrices they are 24 distinct, nonabelian gates containing the Pauli set. 2. An honest negative. Encoding the vertex assignment for a quantum optimiser is a dead end: the 5-qubit binary QUBO has 31 terms (vs 300 one-hot) but up to five-body couplings, and a shallow QAOA recovers the right vertex only 3-10% of the time -- the assignment is a classical argmax with no role for a quantum optimiser. 3. The finding. Applied to a single probe qubit, the 24 gates collapse to 12 distinct outputs, because 2T's center {+-1} is exactly the global phase a lone qubit cannot observe (U(-q)=-U(q) verified for all 24); the observable group is the projective image 2T/{+-1}, the order-12 tetrahedral rotation group. A controlled application makes the center's phase relative and separates all 24. Optimal single-shot (square-root) discrimination succeeds 16.7% over the 12 classes and 12.1% over all 24 -- 2.0x and 2.9x the random baselines, ratios fixed by the 24-cell geometry. The through-line with the classical WCM series: there, B4 reads which symmetrychannel carries a signal's structure; here, the same polytope's group structuregoverns which distinctions a quantum measurement can make. No quantum speedup oradvantage of any kind is claimed; the contribution is an exact correspondencebetween a polytope's group structure and the observability limits of a qubit.Self-audit: 12 findings, all NUMERICAL / NEGATIVE / STRUCTURAL, none overclaimed. v1.0.1 (2026-08-27): Adds an explicit, end-to-end-verified measurement circuit. The optimal square-root discrimination is certified minimum-error (Yuen-Kennedy-Lax conditions plus an independent iteration from random measurements), realised as an explicit Naimark unitary, embedded in a power-of-two qubit register, and compiled to an atomic gate list of RY, RZ, X, and CNOT only -- verified end to end (every gate one of those four types, the product reproducing the target measurement within floating-point accumulation; ~2e-11 over the ~84,000-gate 24-way circuit). The lone-qubit collapse is sharpened to an orbit hierarchy (24 -> 12 generic -> 6 symmetry-axis), naming the measure-zero exceptional probes (including the computational basis). Terminology and scope clarifications throughout (B4 vs 2T; central quotient; coherent-control assumption; honest symmetry-blind CNOT upper bounds 25,210 / 2,022). No quantum speedup is claimed. Status: preprint, not peer-reviewed. This is an independent research note; its revisions were shaped by critique from an AI collaborator, which is not a substitute for formal peer review. Text CC-BY-4.0; code AGPL-3.0-or-later.

•Aug 26, 2026•0 citations
A qubit is one setting of the two sliding rings. The rotation gate Rz(θ) has entries cos(θ/2) and sin(θ/2), and the instrument's law is d = 2cos(θ/2) between the centers and e = 2sin(θ/2) between the crossings at crossing separation θ: the gate matrix is read off the setting, the Bloch amplitudes are the two half-distances, and Born's rule is the two shares of one unit. Composing rotation gates is adding positions, certified by the ring's addition law. The spinor's sign, −1 after a 360° rotation and +1 after 720°, is the ring's half turn, digits summing to ten, and its lap. The Pauli phases i, −1, −i are the quarter-turn orbit 7, 9, 3, and the phase exponent of any Pauli product is carried by the digits, verified on two hundred random products. The hidden symmetry of the Jordan–Wigner transformation that Davis and Freericks (arXiv:2512.24589) use to halve measurement circuits is the ring turning, its two angles are the quarter turn and the eighth turn, and its identities are the fold law averaged round the ring, whose coefficients 3/8 and 1/8 are exact averages over the sixty positions. Their equation 24 is verified on random fixed-number states of four qubits. From this one picture the paper places the live checksum where it can live in a quantum computer: on the classical phase registers that drive virtual-Z gates and merge rotations, on the classical Pauli frame, and on measured expectation values through the symmetry identities, which flag every number-changing error, while the law of readings of the companion paper catches the number-conserving ones. And it states where it cannot live, on the amplitudes themselves, by the no-cloning theorem. The four operator-mechanics papers of Freericks and colleagues, the operator Rodrigues formula, the momentum measurement, the free expansion of a Gaussian and the squeezed-state wavefunction, are then worked side by side as examples of the same picture: one slide, one quarter turn, one shear, one rotating ellipse. Every number is verified by the script in the appendix.
Every tool of quantum computing is one of three moves on two sliding rings marked with the sixty last digits of the Fibonacci numbers. A setting is a value read off one placement of the rings. A fold is a product turned into a sum by the half-angle law. A turn is a shift of position that carries a digit with it. Every gate is a setting, its entries cos(θ/2) and sin(θ/2) the half-distances of the rings at crossing separation θ, and the Hadamard, CZ and CNOT are quarter and half turns. Born's rule is the fold, amplitudes read at position k and expectation values at 2k. Every gradient is a quarter turn, because the parameter-shift rule is the ring's derivative law, its two shifts the ×7 and ×3 laws, with four eighth turns where a Givens gate needs them. A complete variational run is worked on a two-qubit number-conserving Hamiltonian. The energy is the ring shifted ten positions, the ground state the vesica setting at position 20, the optimizer three readings and a gnomon with nothing to tune, its convergence one line. Noise is the radius of the rings, and the square inside the ring, the stabilizer octahedron, says when the noise has cost a magic state. Phase estimation, Shor's classical end, Grover's search, Trotter chains, QAOA, Bell tests, teleportation, error mitigation, benchmarking and the [[4,2,2]] and [[5,1,3]] codes each reduce to the same three moves, forty tools on one page, and because every unitary is a finite product of rotation gates, the list is open and the three moves are closed. A checksum rides every classical number of the loop, the digits under the crossings on each setting, the addition law on each sum, the quarter-turn law on each gradient, the symmetry identity ⟨XX⟩ = ⟨YY⟩ on the measured data with its alarm threshold read off the setting, every one-, two- and three-bit upset of a 32-bit phase word and every burst of up to fifteen bits caught by three rings in lockstep, every corruption of any kind caught by the ladder, and the decoder table of the perfect code built on the four quarter turns of the net, any four simultaneous faults in an entry restored. The guard stands on every classical register of the loop, and the code space stands on the qubits. Thirty-one jobs on three IBM machines close the paper. A clean run on a 156-qubit machine had every compiled angle certified, the injected bit flip flagged at over a hundred standard errors, the clean checksum inside its line, the radius reading the noise, and the Bell value above 2, and one bit flipped in a phase word before submission, four ways, caught by the guard every time, turning the ground state into the top of its number sector and, from the entangler word, into the top of the whole spectrum when sent unguarded. The same words were corrupted up to all ten at once, by any change up to every bit inverted, and read both ways in four runs, unguarded and through the guard, and every setting word of a many-qubit tower was corrupted past any real error rate, caught and rebuilt in place, and read right on the machine. Every number is verified by the script in the appendix on explicit matrices and states, and the hardware readings are checked against the result files.
Quantum mechanics does two things with a two-level system. It turns it, and it entangles it. Both live on the two-ring instrument. Dynamics first. The Schrödinger equation for any two-level Hamiltonian is precession. The Bloch vector rotates about the axis of the energy splitting at the rate the splitting sets, so time evolution on the rings is the setting moving, certified at every instant. Larmor precession is the pure turn at γB, 42.577 million turns a second for a proton in one tesla. The Rabi oscillation is the energy lever swept in time, the ground and excited shares cos² and sin² of one accumulated setting. The Ramsey fringe is two settings and a fold, the most precise frequency measurement in physics read as d/2. The spin echo is the half turn against drift. Entanglement second. For any pure two-qubit state the two qubits' rings carry the same radius, and that radius is set by the concurrence, r = √(1 − C²), full radius for a product state and zero for a Bell pair. Entanglement is two rings forced to share one radius. Generating it is the energy-sloshing lever of the companion papers read between rings. Under the exchange interaction the concurrence grows as sin Ωt while both radii shrink as cos Ωt, and the pair is a Bell state at the quarter period, when both radii vanish. The second part is then made into instruments. The entanglement monitor reads the concurrence of a running experiment from one qubit's statistics, one measurement setting for the exchange family and three for any pure state, against nine for tomography. The certified entanglement clock reads the slosh tick by tick, the calibration, the diagnostics and the ledger of an entangling gate. And the classical line is drawn where correlation stops being classical. The radius is blind on the whole Werner family, and the witness |⟨XX⟩| + |⟨YY⟩| + |⟨ZZ⟩| = 1, the fold read beside the correlation in the pair's own frame, draws the line the radius cannot. The same identity passed a real machine's clean run at 1.01 standard errors and flagged an injected fault at 112. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.
Two walls stand at the edge of the two-ring instrument, and this paper is the map of both. Many qubits first. One setting reads two amplitudes and N qubits carry 2^N, and that wall is the only thing between the instrument and many-body quantum mechanics. Part I is the map of the attempt to scale through it, chains of certified rings in lockstep, each qubit a setting with its digit certificate, entanglement between neighbours as the shared-radius coupling of the companion paper, local turn laws carrying the gates, a geometric form of the tensor networks that are classical physics' own escape from the same wall. What carries over is stated exactly and verified. Across every cut of a chain the two sides share one spectrum, so the cut's radius is its certificate. An eight-link chain built by one layer of levers holds at most one bit per cut and is held by a chain of bond two to a fidelity of 1.000, and a random eight-qubit state has rank 16 at the middle cut and is held to 0.162, the wall exhibited. The move past it is the nesting of the companion repair paper, a ring inside every cell, done here as a setting inside every share. A setting whose two shares are themselves settings, applied down to single qubits, holds any pure state of N qubits exactly, 2^N − 1 settings for 2^N amplitudes, the standard's own count, verified on random states at every size to eight qubits and on the same random state the chain held to 0.162, with every setting on the ladder. At a node the entanglement of that qubit with the rest is sin θ √(1 − |⟨ψ₀|ψ₁⟩|²), the Wootters concurrence for a pair, largest at equal shares over mirror branches. A Z turn on qubit k turns the azimuths at depth k and nothing else, and a measurement reads the root's shares and leaves its branch. On ibm_kingston a random three-qubit state was prepared from its seven settings as the machine's own gate angles and its populations read within 0.048 of the tower's shares. The contraction that turns the chain into a reading is classical arithmetic, and the ladder guard of the companion paper stands on it, 112 fixed-point words carrying their base-60 digit pairs, 200 random corruptions of one to six bits, every one caught from the shadow alone and every word recomputed, while the unguarded contraction returned a wrong energy in 155 of the 200. The five problems of the chain program are each settled where they stand: the tower is the canonical form, a gate on any qubit needs no route through its neighbours, the contraction's cost is measured, the classes the tower compresses are counted, and the width a chain needs to follow the dynamics is the entanglement across its cuts, measured. Three levels second. A pure qutrit carries four real parameters and one setting reads two lengths. The populations are read by two levers, one inside the other, the tower of Part I at its smallest: the first splits level 0 from the rest and the second splits the rest between levels 1 and 2, so every split is reachable, a state fully in one level included. Two certificates ride them, the sum to one and the product law, the coherence between two levels at most the product of their two amplitudes and equal to it for a pure state, and on a thousand random qutrits every one-percent misread of the populations is caught by one of the two, 1,000 of 1,000, 992 of them by the sum alone. The threefold turn a qutrit wants is not a single-digit multiplier, and that is a theorem, not bad luck. The Pisano period over the rank of apparition is 1, 2 or 4 (Vinson 1963), confirmed by enumeration to modulus 250. But the sixty-ring carries the threefold turn as a two-term law, F(n + 20) ≡ 5F(n + 1) + F(n) (mod 10) at all sixty positions, and 178 moduli below 250 carry the same law at a third of their period. The two relative phases are read as well, by three two-level settings, one for each pair of levels, whose azimuths obey the addition law exactly, the third certified by the other two, so that three populations and two certified phases rebuild every pure qutrit, verified on a thousand. Every number is verified by the script in the appendix, and the document is not built unless every check prints True.
The simple harmonic oscillator is solved by geometry on the two-ring instrument and the Fibonacci 60-ring of the companion papers, with every step checked as it is made, in lengths a student can draw. The route it replaces is the operator mechanics that Freericks and Doughty (arXiv:2305.00062, 2023) propose for teaching: trade the differential equations of wave mechanics for abstraction and run every solvable problem on four operator identities, with the oscillator as the worked case, solved three ways, the operator way resting on the canonical commutation relation, the factorization of the Hamiltonian, a second singular factorization that finds the odd states, and wavefunctions built from a translation operator and an operator form of the Rodrigues formula. This paper is the fourth way. The oscillator is a point on a ring: one setting reads its position between the centers and its momentum between the crossings. Velocity sits a quarter turn ahead and acceleration a half turn ahead, and the ring's digit laws, times seven and sum to ten, check each step. The energy is the radius squared. The commutation relation, the postulate their h-bar enters by, is the size of one cell of phase space: the ground orbit encloses h/2, one triangle, and every annulus between orbits encloses h, one diamond, so h enters the system as a unit, where m and omega do, and nowhere else. On the ring the area per step is the Casoratian of the wave, one constant at all sixty positions, with Cassini's identity as its digit shadow. The stationary states are rings themselves: by Wigner's phase-space formulation, which is exact for the oscillator, time evolution is a rigid rotation, a stationary state is a function of the radius alone, the position density is that ring projected on the center line and the momentum density the same ring projected on the crossing line, and the paper verifies that these projections are the standard densities. The wavefunctions themselves come from one slide: slide the ground blob along the center line, and the powers of the slide are the Hermite functions, with the explicit formula, the recurrence and the matrix elements falling out of two multiplied series where their paper needs a Gaussian similarity transform, nested commutators and an induction. The quarter turn is the Fourier transform, which is how momentum is measured in a trap. Their singular factorization sorts the states by the sign of the ring at its center, the parity. The spectrum E = h-bar omega (n + 1/2), counted in the equilateral triangles of the Tetryonics model, is the odd numbers: the ground state is one unsplittable triangle, each rung is one diamond, one photon, the totals are the squares, hydrogen's n squared, and the three-ring oscillator's degeneracies are the triangular numbers, one triangle read three ways. Their four identities, at the oscillator, are the addition of positions plus the area term. Every formula used is standard and cited, and every number is verified by the script in the appendix.
Most of quantum computing today is written in the mathematics of quantum mechanics: complex vectors and the matrices that act on them. This mathematics has served physics well, yet it is not a Euclidean number system. In it, two states of one system cannot be multiplied and divided back, and a turn about a general axis is a matrix rather than a number. What would be an alternative Euclidean number system, possibly suitable for quantum mechanics? Recently, we proposed the Arrow Numbers, the complex numbers, quaternions and octonions, as such a system. Together with the real numbers, they are the normed division algebras. In them, lengths multiply, every nonzero arrow divides, and the Euler relation turns an arrow about any axis. What if we build a Boolean algebra on this Euclidean mathematics? With a bit written as a sign, ±1, the basis units multiply as the XOR logic function of their labels. Then a half turn is the NOT function, and a quarter turn is its square root. When an arrow moves through the zero of the arrow Argand sphere, it acts as a threshold. Thus the sign of a sum of three inputs gives the majority gate, and hence AND, OR and NAND. Reversibly, the quotient of the two orders of a quaternion product is the AND of two bits, AB(BA)⁻¹ = (−1)^(ab), which builds the Toffoli gate. Likewise, the two groupings of an octonion product give the AND of three bits. Thus each doubling gives up one rule of arithmetic, and the quotient that measures it carries one more degree of AND. These identities are known, and we read them as gates. In standard CMOS design, NOT and every product by a fixed basis unit are implemented as wiring. Moreover, the Toffoli gate takes fourteen transistors, and the product and the zero crossing make a full adder. SPICE simulations confirm every truth table. Accepted for publication in the Journal of Applied Mathematics and Physics (2026-10-22). The checks archive contains the Julia script of the algebra (59 tests), the switch-level circuit checks and the SPICE netlists and driver, each check with a control that must fail, and the logs of the runs.
The Watabe-Claude Method reads a signal's structure by assigning 4D-embeddedwindows to the 24 vertices of the 24-cell and decomposing the occupancy with thegroup B4. This note takes the 24-cell the other way -- into a qubit. Its 24vertices, as unit quaternions, are exactly the binary tetrahedral group 2T, afinite nonabelian subgroup of SU(2); under the quaternion-to-SU(2) map they are24 distinct single-qubit gates. Three exact facts, all verified by classical simulation of one or two qubits(no external quantum or group-theory libraries): 1. Foundation. The 24 vertices form 2T (order 24): closed Cayley table, Latin square, 24-cell inner-product signature {-1,-1/2,0,1/2,1}. As SU(2) matrices they are 24 distinct, nonabelian gates containing the Pauli set. 2. An honest negative. Encoding the vertex assignment for a quantum optimiser is a dead end: the 5-qubit binary QUBO has 31 terms (vs 300 one-hot) but up to five-body couplings, and a shallow QAOA recovers the right vertex only 3-10% of the time -- the assignment is a classical argmax with no role for a quantum optimiser. 3. The finding. Applied to a single probe qubit, the 24 gates collapse to 12 distinct outputs, because 2T's center {+-1} is exactly the global phase a lone qubit cannot observe (U(-q)=-U(q) verified for all 24); the observable group is the projective image 2T/{+-1}, the order-12 tetrahedral rotation group. A controlled application makes the center's phase relative and separates all 24. Optimal single-shot (square-root) discrimination succeeds 16.7% over the 12 classes and 12.1% over all 24 -- 2.0x and 2.9x the random baselines, ratios fixed by the 24-cell geometry. The through-line with the classical WCM series: there, B4 reads which symmetrychannel carries a signal's structure; here, the same polytope's group structuregoverns which distinctions a quantum measurement can make. No quantum speedup oradvantage of any kind is claimed; the contribution is an exact correspondencebetween a polytope's group structure and the observability limits of a qubit.Self-audit: 12 findings, all NUMERICAL / NEGATIVE / STRUCTURAL, none overclaimed. v1.0.1 (2026-08-27): Adds an explicit, end-to-end-verified measurement circuit. The optimal square-root discrimination is certified minimum-error (Yuen-Kennedy-Lax conditions plus an independent iteration from random measurements), realised as an explicit Naimark unitary, embedded in a power-of-two qubit register, and compiled to an atomic gate list of RY, RZ, X, and CNOT only -- verified end to end (every gate one of those four types, the product reproducing the target measurement within floating-point accumulation; ~2e-11 over the ~84,000-gate 24-way circuit). The lone-qubit collapse is sharpened to an orbit hierarchy (24 -> 12 generic -> 6 symmetry-axis), naming the measure-zero exceptional probes (including the computational basis). Terminology and scope clarifications throughout (B4 vs 2T; central quotient; coherent-control assumption; honest symmetry-blind CNOT upper bounds 25,210 / 2,022). No quantum speedup is claimed. Status: preprint, not peer-reviewed. This is an independent research note; its revisions were shaped by critique from an AI collaborator, which is not a substitute for formal peer review. Text CC-BY-4.0; code AGPL-3.0-or-later.