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

In Praise of Qudits: Why Higher-Dimensional Quantum Systems Deserve Centre Stage

Ian Richard C Buckley

Published May 18, 2026• 0 citations
Publisher

Abstract

The qubit has become so dominant in quantum computing that alternatives are rarely discussed, yet it is a historical accident: two-level systems were simply the easiest to isolate experimentally. This paper argues that qudits — $d$-dimensional quantum systems with $d > 2$ — offer strictly more across every metric: error-correction headroom, richer topological structure, sharper computational phase transitions, and a natural home for the exceptional algebras that govern the deepest structures in mathematics and physics. Two values of $d$ are mathematically privileged: $d=4$ (spacetime spinors, two-qubit entanglement, quaternionic structure) and $d=8$ (octonions, $G_2$, the Fano plane). These are consequences of Hurwitz's theorem (1898), which identifies $d \in {1,2,4,8}$ as the only dimensions supporting normed division algebras. The paper covers: the $\mathrm{SU}(4)$ containment that makes two-qubit logic native to a single ququart; Dirac spinors as the natural $d=4$ Hilbert space; the $d=8$ octonion layer and its $G_2$ symmetry; topological advantages of higher $d$ including Hopfion braiding and non-Abelian statistics; and the Hopf fibration tower $S^1 \to S^3 \to S^2 \to \cdots \to S^7 \to S^{15} \to S^8$ as a construction manual for building qudits from qubits. v2.0 adds five new developments: The padit tower. The $p$-adic qudit (padit) in $L^2(\mathbb{Z}/p^n\mathbb{Z})$ extends Hurwitz to all prime powers $d = p^n$. Qubits are the $p=2$, $n=1$ special case. The Number-Theoretic Transform is the exact $p$-adic QFT (no floating-point error). The Fano plane is the $p=2$, $n=3$ padit — the natural home of the 3-qubit Origami ISA and the Steane $[![7,1,3]!]$ code. Bredon cohomology cascade. Equivariant cohomology of the Weyl chamber proves $\chi_\mathrm{Bredon} = 2$ (2-qubit, one topological class distinguishing CNOT from iSWAP) $\to 0$ (3-qubit, equivariantly contractible) $\to$ non-trivial (7-qubit Fano). The 3-qubit native gate architecture (TriQ) adds no topological value; the correct jump is directly from 2-qubit to Steane-7. FeMoco as a room-temperature $d=8$ computer. The iron-molybdenum cofactor of nitrogenase contains 7 Fe atoms corresponding to the 7 points of $\mathrm{PG}(2,2)$. The $\mathrm{N_2}$ fixation reaction is a 14-opcode Fano programme running at 300 K, decoherence-free in the $G_2$-symmetric Clifford sector. Nature builds $d=8$ qudit computers; we merely need to recognise them. Shor's algorithm has zero magic. The magic resource theory shows that Shor's algorithm achieves exponential speedup with mana $= 0$: all gates lie in the Clifford sector. Qudits have more Clifford structure, not more overhead. The standard objection — that higher $d$ requires more magic-state distillation — is precisely backwards. The architecture ladder. The Bredon cascade, the Hopf fibration tower, and the padit tower converge on the same four-level stack: native 2-qubit gates ($d=4$, $\chi_\mathrm{Bredon}=2$) $\to$ Steane $[![7,1,3]!]$ logical qudits ($d=8$, Fano) $\to$ compiled Toffoli and above. The open problem of v1 (design a $G_2$-symmetric Fano QEC code) is resolved: the Steane code is that code. Third, molecular evidence: the FeMo-cofactor [Mo–7Fe–9S–C–homocitrate] of nitrogenase is a 7-qubit Fano computer running at 300 K, room temperature, decoherence-free in the $G_2$-symmetric Clifford sector. The 7 Fe atoms occupy the 7 points of $\mathrm{PG}(2,2)$; the molybdenum apex and the interstitial carbide carbon (Spatzal et al. 2011, Science) provide structural scaffolding but do not carry Fano-register qubits. Nature builds $d=8$ qudit computers; we merely need to recognise them.

DOI
10.5281/zenodo.20269991

Related papers

Qubits, Qutrits, Qudits, .. Why stop at two?

Keshav Seetharaman

The central question that this project tries to address is the following: Dominance of binary logic in classical computing emerged from deep physical and engineering constraints. I ask if similar constraints force quantum computing toward qubits, or whether today's qubit dominance is merely historical and a temporary technological contingency? Quantum computing today appears to be converging on an architectural choice that reminds us of the trajectory of classical computing: the qubit. Nearly all commercial quantum computing platforms — including those developed by IBM, Google, and Amazon — are built around controllable two-level quantum systems. Superconducting circuits, trapped ions, and photonic encodings are engineered so that a two-dimensional Hilbert space functions as the computational unit. Yet quantum theory does not privilege two-level systems. This contrast between what current devices use and what the theory allows motivates a closer look at the higher-dimensional structures already present in quantum mechanics. The mathematical structure of quantum mechanics naturally accommodates arbitrary-dimensional Hilbert spaces. Atoms possess multiple accessible energy levels. Photons carry orbital angular momentum in high-dimensional spaces. Ions and superconducting circuits inherently support more than two levels. In laboratory settings, three-level systems (qutrits) and higher-dimensional qudits have already been implemented and studied with notable success, and I take these results as evidence that the restriction to qubits is a contingent design preference rather than a theoretical necessity. The working hypothesis guiding this project has been that very little appears to transfer from the classical case. Quantum information theory, noise mechanisms, and error correction principles differ fundamentally from their classical counterparts, I focus on how qudits exploit these differences.Therefore, it's possible that dominance of qubits today may reflect temporary engineering convenience and early platform momentum rather than theoretical inevitability.

•Apr 11, 2026•0 citations

Qudit color codes and gauge color codes in all spatial dimensions

Fern H. E. Watson, Earl T. Campbell, Hussain Anwar +1 more

Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, $d$-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological quantum codes with remarkable transversality properties, can be generalized to the qudit paradigm. In recent developments it was found that in three spatial dimensions a qubit color code can support a transversal non-Clifford gate and that in higher spatial dimensions additional non-Clifford gates can be found, saturating Bravyi and K\"onig's bound [S. Bravyi and R. K\"onig, Phys. Rev. Lett. 111, 170502 (2013)]. Furthermore, by using gauge fixing techniques, an effective set of Clifford gates can be achieved, removing the need for state distillation. We show that the qudit color code can support the qudit analogs of these gates and also show that in higher spatial dimensions a color code can support a phase gate from higher levels of the Clifford hierarchy that can be proven to saturate Bravyi and K\"onig's bound in all but a finite number of special cases. The methodology used is a generalization of Bravyi and Haah's method of triorthogonal matrices [S. Bravyi and J. Haah, Phys. Rev. A 86, 052329 (2012)], which may be of independent interest. For completeness, we show explicitly that the qudit color codes generalize to gauge color codes and share many of the favorable properties of their qubit counterparts.

arXiv:1503.08800•Physical Review A•Aug 7, 2015•45 citations

A quantum compiler for qudits of prime dimension greater than 3

Luke Heyfron, Earl T. Campbell

Prevailing proposals for the first generation of quantum computers make use of 2-level systems, or qubits, as the fundamental unit of quantum information. However, recent innovations in quantum error correction and magic state distillation protocols demonstrate that there are advantages of using d-level quantum systems, known as \emph{qudits}, over the qubit analogues. When designing a quantum architecture, it is crucial to consider protocols for compilation, the optimal conversion of high-level instructions used by programmers into low-level instructions interpreted by the machine. In this work, we present a general purpose automated compiler for multiqudit exact synthesis based on previous work on qubits that uses an algebraic representation of quantum circuits called phase polynomials. We assume Clifford gates are low-cost and aim to minimise the number of M gates in a Clifford+M circuit, where M is the qudit analog for the qubit T or pi/8 phase gate. A surprising result that showcases our compiler's capabilities is that we found a unitary implementation of the CCZ or Toffoli gate that uses 4 M gates, which compares to 7 T gates for the qubit analogue.

arXiv:1902.05634•Feb 14, 2019•13 citations

The SQU, TriQ, and SevenQ: Standard Hardware for the Origami ISA

Ian Richard C Buckley

CORRECTION NOTICE (2026-08). The figure "4.3× directed magic-routing efficiency", quoted three times and attributed to a companion paper, does not appear in that paper. It is unsourced and should be disregarded. A revised version is in preparation. The Origami Instruction Set Architecture (O-ISA) was introduced alongside a conjectural exotic hardware substrate — the Resonance Processing Unit (RPU) — requiring non-associative materials to support octonion computation. This paper establishes that the base Origami ISA requires no exotic hardware whatsoever. It runs today on any quantum processor supporting three-qubit gates: superconducting transmons, trapped ions, neutral atoms, and photonic chips. Two complementary architectural primitives are specified. The TriQ (Origami Triple) is the fundamental three-qubit register: three physical qubits in Fano-plane incidence connectivity, corresponding to one logical qubit in the [[7,1,3]] Steane code. The SQU (Symplectic Quantum Unit) is the full processor architecture built from TriQ registers, with the Magic-ISA opcode set and inter-register typed routing. The SevenQ is the complete seven-qubit Fano register: all seven points of PG(2,2) simultaneously realised, corresponding to the full [[7,1,3]] Steane code with its six gauge degrees of freedom corresponding bijectively to the six non-classical Fano orbit valences. The key diagnostic opcode is ORBIT: seven simultaneous Pauli measurements returning the Fano orbit valence label of the register state, replacing the conjectured Freudenthal determinant ALU with seven standard readout operations. The SQU achieves fault-tolerant universal quantum computation with 7 physical qubits per logical qubit for CS-family gates via gauge-orbit selection, and 15 for CCZ gates via code switch — both at zero magic-state distillation overhead. A critical non-obvious result: SevenQ ORBIT is identical to standard Steane syndrome extraction. The seven syndrome measurements already performed at every error correction cycle are the ORBIT opcode, with the orbit valence label computed in classical post-processing at zero additional hardware cost. Three hardware tiers are defined: SQU (standard qubits, available today), SQU-diode (6-7 directed Fano coupling topology, near-term), and RPU (non-associative materials, long-term). The SevenQ-diode variant applies the 6-7 broken-symmetry topology to the full seven-qubit register for directed magic routing at 4× symmetric efficiency. The paper also establishes the exploration order for the projective tower: TriQ (3 qubits, minimal n=3) → SevenQ (7 qubits, complete n=3) → 1531-Anvil (15 qubits, first n=4). Keywords Origami ISA, TriQ, SevenQ, SQU, Symplectic Quantum Unit, Fano Plane, PG(2,2), Magic-ISA, ORBIT Opcode, Steane Code, [[7,1,3]] Code, Fault-Tolerant Quantum Computation, Magic State Distillation, CS Gate, Gauge Selection, Quantum Error Correction, Coherent Error Detection, Magic Valence, Fano Orbit, Superconducting Qubits, Trapped Ions, Neutral Atoms, Quantum Hardware, Instruction Set Architecture, 6-7 Topology, Directed Magic Routing, SevenQ-Diode, SQU-Diode, Adelic Simplicial Architecture, Resonance Processing Unit

•Jun 7, 2026•0 citations

Three Routes to Zero-Overhead Non-Clifford Gates on the SQU Architecture

Ian Richard C Buckley

PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. This is widely interpreted as requiring magic-state distillation (MSD) as an unavoidable overhead for fault-tolerant non-Clifford computation. This paper demonstrates three distinct routes to CS-family non-Clifford gates on the SQU architecture that circumvent the practical impact of Eastin-Knill without violating it. Route 1 — Gauge-orbit CS transversality: The [[7,1,3]] Steane code has 6 gauge degrees of freedom corresponding bijectively to the 6 non-classical Fano orbit valences. Preparing the gauge subsystem in orbit valence L ∈ {1,2,3} via the DISTIL opcode enables transversal application of CS_{ij} — the qubit pair associated with orbit L — across all 7 physical qubit triplets simultaneously. This implements a logical CS gate fault-tolerantly at 7 physical qubits, versus 15 for the [[15,1,3]] Reed-Muller approach, with zero magic-state distillation and zero code switching. Route 2 — CONVERT as free valence switching: The CONVERT opcode is a free Clifford gate that switches orbit valence within the primary family {1,2,3} or secondary family {4,5,6}. Any CS-type gate is reachable from any other via one SWAP gate, at zero distillation cost. The gauge-orbit correspondence makes CS-family universality a matter of gauge selection, not resource consumption. Route 3 — Syndrome-blind valence verification: The CS₀₁, CS₀₂, and CS₁₂ states are indistinguishable by stabiliser syndrome (all produce syndrome (+1)⁷) but are perfectly distinguished by the ORBIT opcode. This enables fault-tolerant gate verification at zero additional syndrome cost — the ORBIT measurement is performed on the same 7 qubits already measured for error correction. Together these routes reduce the physical qubit overhead for CS-family computation from 15 to 7, eliminate MSD entirely for CS gates, and provide built-in coherent error detection. The Eastin-Knill theorem is respected: the CS gate is not transversal in the code sense. What changes is the architecture — the gauge structure of the Steane code is the resource, not ancilla magic states. Keywords Eastin-Knill Theorem, Transversal Gates, Magic State Distillation, Fault-Tolerant Quantum Computation, CS Gate, Controlled-S Gate, Steane Code, [[7,1,3]] Code, Gauge Selection, Fano Orbit Valence, Orbit Valence, ORBIT Opcode, DISTIL Opcode, CONVERT Opcode, Magic-ISA, SQU Architecture, TriQ, Quantum Error Correction, Syndrome Blindness, Non-Clifford Gates, Gauge Subsystem, W(5,2), Fano Plane, PG(2,2), Origami ISA, Zero Overhead, Coherent Error Detection

•Jun 7, 2026•0 citations

Quantum encodings in spin systems and harmonic oscillators

Stephen D. Bartlett, Hubert de Guise, Barry C. Sanders

We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for analyses of quantum vs classical computation, in practice qubits are often realized in higher-dimensional systems by truncating all but two levels, thereby reducing the size of the precious Hilbert space. We develop natural qudit gates for universal quantum computation, and exploit the entire accessible Hilbert space. Mathematically, we give representations of the generalized Pauli group for qudits in coupled spin systems and harmonic oscillators, and include analyses of the qubit and the infinite-dimensional limits.

arXiv:quant-ph/0109066•Physical Review A•May 3, 2002•193 citations
The qubit has become so dominant in quantum computing that alternatives are rarely discussed, yet it is a historical accident: two-level systems were simply the easiest to isolate experimentally. This paper argues that qudits — ddd-dimensional quantum systems with d>2d > 2d>2 — offer strictly more across every metric: error-correction headroom, richer topological structure, sharper computational phase transitions, and a natural home for the exceptional algebras that govern the deepest structures in mathematics and physics. Two values of ddd are mathematically privileged: d=4d=4d=4 (spacetime spinors, two-qubit entanglement, quaternionic structure) and d=8d=8d=8 (octonions, G2G_2G2​, the Fano plane). These are consequences of Hurwitz's theorem (1898), which identifies d∈1,2,4,8d \in {1,2,4,8}d∈1,2,4,8 as the only dimensions supporting normed division algebras. The paper covers: the SU(4)\mathrm{SU}(4)SU(4) containment that makes two-qubit logic native to a single ququart; Dirac spinors as the natural d=4d=4d=4 Hilbert space; the d=8d=8d=8 octonion layer and its G2G_2G2​ symmetry; topological advantages of higher ddd including Hopfion braiding and non-Abelian statistics; and the Hopf fibration tower S1→S3→S2→⋯→S7→S15→S8S^1 \to S^3 \to S^2 \to \cdots \to S^7 \to S^{15} \to S^8S1→S3→S2→⋯→S7→S15→S8 as a construction manual for building qudits from qubits. v2.0 adds five new developments: The padit tower. The ppp-adic qudit (padit) in L2(Z/pnZ)L^2(\mathbb{Z}/p^n\mathbb{Z})L2(Z/pnZ) extends Hurwitz to all prime powers d=pnd = p^nd=pn. Qubits are the p=2p=2p=2, n=1n=1n=1 special case. The Number-Theoretic Transform is the exact ppp-adic QFT (no floating-point error). The Fano plane is the p=2p=2p=2, n=3n=3n=3 padit — the natural home of the 3-qubit Origami ISA and the Steane [![7,1,3]!][![7,1,3]!][![7,1,3]!] code. Bredon cohomology cascade. Equivariant cohomology of the Weyl chamber proves χBredon=2\chi_\mathrm{Bredon} = 2χBredon​=2 (2-qubit, one topological class distinguishing CNOT from iSWAP) →0\to 0→0 (3-qubit, equivariantly contractible) →\to→ non-trivial (7-qubit Fano). The 3-qubit native gate architecture (TriQ) adds no topological value; the correct jump is directly from 2-qubit to Steane-7. FeMoco as a room-temperature d=8d=8d=8 computer. The iron-molybdenum cofactor of nitrogenase contains 7 Fe atoms corresponding to the 7 points of PG(2,2)\mathrm{PG}(2,2)PG(2,2). The N2\mathrm{N_2}N2​ fixation reaction is a 14-opcode Fano programme running at 300 K, decoherence-free in the G2G_2G2​-symmetric Clifford sector. Nature builds d=8d=8d=8 qudit computers; we merely need to recognise them. Shor's algorithm has zero magic. The magic resource theory shows that Shor's algorithm achieves exponential speedup with mana =0= 0=0: all gates lie in the Clifford sector. Qudits have more Clifford structure, not more overhead. The standard objection — that higher ddd requires more magic-state distillation — is precisely backwards. The architecture ladder. The Bredon cascade, the Hopf fibration tower, and the padit tower converge on the same four-level stack: native 2-qubit gates (d=4d=4d=4, χBredon=2\chi_\mathrm{Bredon}=2χBredon​=2) →\to→ Steane [![7,1,3]!][![7,1,3]!][![7,1,3]!] logical qudits (d=8d=8d=8, Fano) →\to→ compiled Toffoli and above. The open problem of v1 (design a G2G_2G2​-symmetric Fano QEC code) is resolved: the Steane code is that code. Third, molecular evidence: the FeMo-cofactor [Mo–7Fe–9S–C–homocitrate] of nitrogenase is a 7-qubit Fano computer running at 300 K, room temperature, decoherence-free in the G2G_2G2​-symmetric Clifford sector. The 7 Fe atoms occupy the 7 points of PG(2,2)\mathrm{PG}(2,2)PG(2,2); the molybdenum apex and the interstitial carbide carbon (Spatzal et al. 2011, Science) provide structural scaffolding but do not carry Fano-register qubits. Nature builds d=8d=8d=8 qudit computers; we merely need to recognise them.
The central question that this project tries to address is the following: Dominance of binary logic in classical computing emerged from deep physical and engineering constraints. I ask if similar constraints force quantum computing toward qubits, or whether today's qubit dominance is merely historical and a temporary technological contingency? Quantum computing today appears to be converging on an architectural choice that reminds us of the trajectory of classical computing: the qubit. Nearly all commercial quantum computing platforms — including those developed by IBM, Google, and Amazon — are built around controllable two-level quantum systems. Superconducting circuits, trapped ions, and photonic encodings are engineered so that a two-dimensional Hilbert space functions as the computational unit. Yet quantum theory does not privilege two-level systems. This contrast between what current devices use and what the theory allows motivates a closer look at the higher-dimensional structures already present in quantum mechanics. The mathematical structure of quantum mechanics naturally accommodates arbitrary-dimensional Hilbert spaces. Atoms possess multiple accessible energy levels. Photons carry orbital angular momentum in high-dimensional spaces. Ions and superconducting circuits inherently support more than two levels. In laboratory settings, three-level systems (qutrits) and higher-dimensional qudits have already been implemented and studied with notable success, and I take these results as evidence that the restriction to qubits is a contingent design preference rather than a theoretical necessity. The working hypothesis guiding this project has been that very little appears to transfer from the classical case. Quantum information theory, noise mechanisms, and error correction principles differ fundamentally from their classical counterparts, I focus on how qudits exploit these differences.Therefore, it's possible that dominance of qubits today may reflect temporary engineering convenience and early platform momentum rather than theoretical inevitability.
Two-level quantum systems, qubits, are not the only basis for quantum computation. Advantages exist in using qudits, ddd-level quantum systems, as the basic carrier of quantum information. We show that color codes, a class of topological quantum codes with remarkable transversality properties, can be generalized to the qudit paradigm. In recent developments it was found that in three spatial dimensions a qubit color code can support a transversal non-Clifford gate and that in higher spatial dimensions additional non-Clifford gates can be found, saturating Bravyi and K\"onig's bound [S. Bravyi and R. K\"onig, Phys. Rev. Lett. 111, 170502 (2013)]. Furthermore, by using gauge fixing techniques, an effective set of Clifford gates can be achieved, removing the need for state distillation. We show that the qudit color code can support the qudit analogs of these gates and also show that in higher spatial dimensions a color code can support a phase gate from higher levels of the Clifford hierarchy that can be proven to saturate Bravyi and K\"onig's bound in all but a finite number of special cases. The methodology used is a generalization of Bravyi and Haah's method of triorthogonal matrices [S. Bravyi and J. Haah, Phys. Rev. A 86, 052329 (2012)], which may be of independent interest. For completeness, we show explicitly that the qudit color codes generalize to gauge color codes and share many of the favorable properties of their qubit counterparts.
Prevailing proposals for the first generation of quantum computers make use of 2-level systems, or qubits, as the fundamental unit of quantum information. However, recent innovations in quantum error correction and magic state distillation protocols demonstrate that there are advantages of using d-level quantum systems, known as \emph{qudits}, over the qubit analogues. When designing a quantum architecture, it is crucial to consider protocols for compilation, the optimal conversion of high-level instructions used by programmers into low-level instructions interpreted by the machine. In this work, we present a general purpose automated compiler for multiqudit exact synthesis based on previous work on qubits that uses an algebraic representation of quantum circuits called phase polynomials. We assume Clifford gates are low-cost and aim to minimise the number of M gates in a Clifford+M circuit, where M is the qudit analog for the qubit T or pi/8 phase gate. A surprising result that showcases our compiler's capabilities is that we found a unitary implementation of the CCZ or Toffoli gate that uses 4 M gates, which compares to 7 T gates for the qubit analogue.
CORRECTION NOTICE (2026-08). The figure "4.3× directed magic-routing efficiency", quoted three times and attributed to a companion paper, does not appear in that paper. It is unsourced and should be disregarded. A revised version is in preparation. The Origami Instruction Set Architecture (O-ISA) was introduced alongside a conjectural exotic hardware substrate — the Resonance Processing Unit (RPU) — requiring non-associative materials to support octonion computation. This paper establishes that the base Origami ISA requires no exotic hardware whatsoever. It runs today on any quantum processor supporting three-qubit gates: superconducting transmons, trapped ions, neutral atoms, and photonic chips. Two complementary architectural primitives are specified. The TriQ (Origami Triple) is the fundamental three-qubit register: three physical qubits in Fano-plane incidence connectivity, corresponding to one logical qubit in the [[7,1,3]] Steane code. The SQU (Symplectic Quantum Unit) is the full processor architecture built from TriQ registers, with the Magic-ISA opcode set and inter-register typed routing. The SevenQ is the complete seven-qubit Fano register: all seven points of PG(2,2) simultaneously realised, corresponding to the full [[7,1,3]] Steane code with its six gauge degrees of freedom corresponding bijectively to the six non-classical Fano orbit valences. The key diagnostic opcode is ORBIT: seven simultaneous Pauli measurements returning the Fano orbit valence label of the register state, replacing the conjectured Freudenthal determinant ALU with seven standard readout operations. The SQU achieves fault-tolerant universal quantum computation with 7 physical qubits per logical qubit for CS-family gates via gauge-orbit selection, and 15 for CCZ gates via code switch — both at zero magic-state distillation overhead. A critical non-obvious result: SevenQ ORBIT is identical to standard Steane syndrome extraction. The seven syndrome measurements already performed at every error correction cycle are the ORBIT opcode, with the orbit valence label computed in classical post-processing at zero additional hardware cost. Three hardware tiers are defined: SQU (standard qubits, available today), SQU-diode (6-7 directed Fano coupling topology, near-term), and RPU (non-associative materials, long-term). The SevenQ-diode variant applies the 6-7 broken-symmetry topology to the full seven-qubit register for directed magic routing at 4× symmetric efficiency. The paper also establishes the exploration order for the projective tower: TriQ (3 qubits, minimal n=3) → SevenQ (7 qubits, complete n=3) → 1531-Anvil (15 qubits, first n=4). Keywords Origami ISA, TriQ, SevenQ, SQU, Symplectic Quantum Unit, Fano Plane, PG(2,2), Magic-ISA, ORBIT Opcode, Steane Code, [[7,1,3]] Code, Fault-Tolerant Quantum Computation, Magic State Distillation, CS Gate, Gauge Selection, Quantum Error Correction, Coherent Error Detection, Magic Valence, Fano Orbit, Superconducting Qubits, Trapped Ions, Neutral Atoms, Quantum Hardware, Instruction Set Architecture, 6-7 Topology, Directed Magic Routing, SevenQ-Diode, SQU-Diode, Adelic Simplicial Architecture, Resonance Processing Unit
PENDING QUALITY AUDIT (2026-08). The file is restricted while this record is reviewed as part of a systematic audit of the author's corpus. It has not yet been assessed. Metadata and DOI remain public, and access can be requested. The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. This is widely interpreted as requiring magic-state distillation (MSD) as an unavoidable overhead for fault-tolerant non-Clifford computation. This paper demonstrates three distinct routes to CS-family non-Clifford gates on the SQU architecture that circumvent the practical impact of Eastin-Knill without violating it. Route 1 — Gauge-orbit CS transversality: The [[7,1,3]] Steane code has 6 gauge degrees of freedom corresponding bijectively to the 6 non-classical Fano orbit valences. Preparing the gauge subsystem in orbit valence L ∈ {1,2,3} via the DISTIL opcode enables transversal application of CS_{ij} — the qubit pair associated with orbit L — across all 7 physical qubit triplets simultaneously. This implements a logical CS gate fault-tolerantly at 7 physical qubits, versus 15 for the [[15,1,3]] Reed-Muller approach, with zero magic-state distillation and zero code switching. Route 2 — CONVERT as free valence switching: The CONVERT opcode is a free Clifford gate that switches orbit valence within the primary family {1,2,3} or secondary family {4,5,6}. Any CS-type gate is reachable from any other via one SWAP gate, at zero distillation cost. The gauge-orbit correspondence makes CS-family universality a matter of gauge selection, not resource consumption. Route 3 — Syndrome-blind valence verification: The CS₀₁, CS₀₂, and CS₁₂ states are indistinguishable by stabiliser syndrome (all produce syndrome (+1)⁷) but are perfectly distinguished by the ORBIT opcode. This enables fault-tolerant gate verification at zero additional syndrome cost — the ORBIT measurement is performed on the same 7 qubits already measured for error correction. Together these routes reduce the physical qubit overhead for CS-family computation from 15 to 7, eliminate MSD entirely for CS gates, and provide built-in coherent error detection. The Eastin-Knill theorem is respected: the CS gate is not transversal in the code sense. What changes is the architecture — the gauge structure of the Steane code is the resource, not ancilla magic states. Keywords Eastin-Knill Theorem, Transversal Gates, Magic State Distillation, Fault-Tolerant Quantum Computation, CS Gate, Controlled-S Gate, Steane Code, [[7,1,3]] Code, Gauge Selection, Fano Orbit Valence, Orbit Valence, ORBIT Opcode, DISTIL Opcode, CONVERT Opcode, Magic-ISA, SQU Architecture, TriQ, Quantum Error Correction, Syndrome Blindness, Non-Clifford Gates, Gauge Subsystem, W(5,2), Fano Plane, PG(2,2), Origami ISA, Zero Overhead, Coherent Error Detection
We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for analyses of quantum vs classical computation, in practice qubits are often realized in higher-dimensional systems by truncating all but two levels, thereby reducing the size of the precious Hilbert space. We develop natural qudit gates for universal quantum computation, and exploit the entire accessible Hilbert space. Mathematically, we give representations of the generalized Pauli group for qudits in coupled spin systems and harmonic oscillators, and include analyses of the qubit and the infinite-dimensional limits.