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

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-27
DOI
https://doi.org/10.5281/zenodo.22116676
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

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
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

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
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions, Reduced inequalities
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.