The Eastin-Knill theorem states that no quantum error-correcting code can have a universal set of transversal gates. For Calderbank-Shor-Steane codes that can implement Clifford gates transversally, it suffices to provide one additional non-Clifford gate, such as the T gate, to achieve universality. Common methods to implement fault-tolerant T gates, e.g., magic state distillation, generate a significant hardware overhead that will likely prevent their practical usage in the near-term future. Recently, methods have been developed to mitigate the effect of noise in shallow quantum circuits that are not protected by error correction. Error mitigation methods require no additional hardware resources but suffer from a bad asymptotic scaling and apply only to a restricted class of quantum algorithms. In this Letter, we combine both approaches and show how to implement encoded Clifford+T circuits where Clifford gates are protected from noise by error correction while errors introduced by noisy encoded T gates are mitigated using the quasiprobability method. As a result, Clifford+T circuits with a number of T gates inversely proportional to the physical noise rate can be implemented on small error-corrected devices without magic state distillation. We argue that such circuits can be out of reach for state-of-the-art classical simulation algorithms.
The Eastin-Knill theorem states that no quantum error-correcting code can have a universal set of transversal gates. For Calderbank-Shor-Steane codes that can implement Clifford gates transversally, it suffices to provide one additional non-Clifford gate, such as the T gate, to achieve universality. Common methods to implement fault-tolerant T gates, e.g., magic state distillation, generate a significant hardware overhead that will likely prevent their practical usage in the near-term future. Recently, methods have been developed to mitigate the effect of noise in shallow quantum circuits that are not protected by error correction. Error mitigation methods require no additional hardware resources but suffer from a bad asymptotic scaling and apply only to a restricted class of quantum algorithms. In this Letter, we combine both approaches and show how to implement encoded Clifford+T circuits where Clifford gates are protected from noise by error correction while errors introduced by noisy encoded T gates are mitigated using the quasiprobability method. As a result, Clifford+T circuits with a number of T gates inversely proportional to the physical noise rate can be implemented on small error-corrected devices without magic state distillation. We argue that such circuits can be out of reach for state-of-the-art classical simulation algorithms.
Fault tolerance is widely regarded as indispensable for achieving scalable and reliable quantum computing. However, the spacetime overhead required for fault-tolerant quantum computating remains prohibitively large. A critical challenge arises in many quantum algorithms with Clifford + φ compiling, where logical rotation gates RZL(φ) serve as essential components. The Eastin-Knill theorem prevents their transversal implementation in quantum error correction codes and necessitating resource-intensive workarounds through T-gate compilation combined with magic state distillation and injection. In this work, we consider error-structure-tailored fault tolerance, where fault-tolerance conditions are analyzed by combining perturbative analysis of realistic dissipative noise processes with the structural properties of stabilizer codes. Based on this framework, we design 1-fault-tolerant continuous-angle rotation gates in stabilizer codes, implemented via dispersive-coupling Hamiltonians. Our approach could circumvent the need for T-gate compilation and distillation, offering a hardware-efficient solution that maintains simplicity, minimizes physical footprint, and requires only nearest-neighbor interactions. Integrating with recent small-angle-state preparation techniques, we can suppress the gate error to 91∣φ∣p2 for small rotation angle (where p denotes the physical error rate). For current achievable hardware parameters (p=10−3), this enables reliable execution of over 107 small-angle rotations when ∣φ∣≈10−3, meeting the requirements of many near-term quantum applications. Compared to the 15-to-1 magic state distillation and magic state cultivation approaches, our method reduces spacetime resource costs by factors of 1337.5 and 43.6, respectively, for a Heisenberg Hamiltonian simulation task under realistic hardware assumptions.
The Eastin-Knill theorem rules out a universal set of transversal logical gates on any code that detects single-qubit errors. The theorem constrains one partition of the qubits at a time. We show that depth-one layers of few-qubit gates, each respecting its own partition, can together generate a universal logical gate set on an error-correcting code. Each logical gate generator is then a single depth-one layer followed by error correction of the same stabilizer code, with no magic-state distillation, code switching, gauge fixing, lattice surgery, or other gadgets. We show that such codes can be found by applying an entangling circuit to a lower-distance "seed" code admitting a depth-one non-Clifford gate and an appropriate "kernel" code. We construct 47 codes with depth-one generating sets that tolerate at least one faulty gate per layer, including a [[37,1,7]] and a [[59,1,9]] code, both of check weight at most eight.
Magic state distillation is one of the leading candidates for implementing universal fault-tolerant logical gates. However, the distillation circuits themselves are not fault-tolerant, so there is additional cost to first implement encoded Clifford gates with negligible error. In this paper we present a scheme to fault-tolerantly and directly prepare magic states using flag qubits. One of these schemes requires only three ancilla qubits, even with noisy Clifford gates. We compare the physical qubit and gate cost of our scheme to the magic state distillation protocol of Meier, Eastin, and Knill (MEK), which is efficient and uses a small stabilizer circuit. For low enough noise rates, we show that in some regimes the overhead can be improved by several orders of magnitude compared to the MEK scheme which uses Clifford operations encoded in the codes considered in this work.
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realization of large-scale quantum algorithms that could lead to extremely impactful scientific or commercial results. Achieving a universal set of quantum gate operations in a fault-tolerant, error-corrected framework suffers from a conservation of unpleasantness. In general, no matter what error-correction technique is employed, there is always one element of a universal gate set that carries a significant resource overhead---either in physical qubits, computational time, or both. Specifically, this is due to the application of non-Clifford gates. A common method for realizing these gates for stabilizer codes such as the surface code is a combination of three protocols: state injection, distillation, and gate teleportation. These protocols contribute to the resource overhead compared with logical operations such as a CNOT gate and contribute to the qubit resources for any error-corrected quantum algorithm. In this paper, we introduce a very simple protocol to potentially reduce this overhead for non-Clifford gates: transversal injection. Transversal injection modifies the initial physical states of all data qubits in a stabilizer code before standard encoding and results in the direct preparation of a large class of single qubit states, including resource states for non-Clifford logic gates. Preliminary results hint at high-quality fidelities at larger distances and motivate further research on this technique.
We study the use of triorthogonal codes for universal fault-tolerant quantum computation and propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both universality and a transversal gate set. We show that our methods reduce the resource overhead compared with existing fault-tolerant protocols. We develop a simple fault-tolerant implementation of the logical Hadamard gate for triorthogonal codes by exploiting the fact that they have transversal controlled-Z (CZ) gates, resulting in a circuit with reduced overhead. We also introduce a procedure for generating a symmetric Calderbank-Shor-Steane code paired with a triorthogonal code, which allows CNOT and CZ gate transversality across the pair of codes. In addition, we present logical state teleportation circuits that transfer encoded states between the two codes, allowing all logical operations to be performed transversally. Our methods can be integrated into the Steane error correction framework without incurring additional resource cost. Finally, using the 15-qubit code as an example, we demonstrate that our protocols significantly reduce the gate overhead compared with other existing methods. These results highlight the potential of combining distinct code structures to achieve low-overhead, universal fault-tolerant quantum computation.
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