Calderbank-Shor-Steane (CSS) codes, constructed from nested classical codes
C2⊆C1, are typically optimized for good code parameters. However, practical quantum computing equally demands fault-tolerant logical gates. In this work, we characterize nested pairs
(C1,C2) whose resulting CSS codes realize a target logical diagonal gate via transversal physical
Z-rotations. In doing so, we recover a result of Camps-Moreno et al. that CSS codes can realize only logical single-qubit
Z-rotations and multi-qubit controlled
Z-rotations via transversal physical
Z-rotations. Building on our characterization, we develop the ''appending construction'', that takes as input an
[[n′,k′]] CSS code
Q′ and a target logical
Z-rotation (single-qubit or multi-controlled)
UL, and extends
Q′ by systematically appending
n′′ physical qubits to obtain an
[[n,k]] CSS code
Q with
n=n′+n′′ and
k=k′. The target logical gate
UL is realized in
Q by applying a well-chosen physical transversal
Z-rotation to the
n′′ appended physical qubits. Moreover, any logical gate realized via transversal physical
Z-rotations in the input code
Q′ remains transversally realizable in the extended code
Q. The CSS code
Q may incur a loss in minimum distance, but the loss can be controlled through the parameter choices made in the construction. By repeatedly applying the appending construction, we can extend any CSS code
Q′ to obtain a CSS code
Q that supports fault-tolerant implementations of multiple desired logical
Z-rotations. The cost to be paid for this is the increased physical qubit overhead as the number of target logical gates grows. To illustrate our methodology, we construct CSS code families that transversally realize addressable logical single-qubit and multi-controlled
Z-rotations.
In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach to characterize all stabilizer codes for which transversal T and T†gates preserve the codespace. Our Heisenberg perspective reduces this question to a finite geometry problem that translates to the design of certain classical codes. We prove three corollaries of this result: (a) For any non-degenerate [n, k, d] stabilizer code supporting a physical transversal T (which might not be logical T), there exists an [n, k, d]] CSS code with the same property; (b) Triorthogonal codes form the most general family of CSS codes that realize logical transversal T via physical transversal T; (c) Triorthogonality is necessary for physical transversal T on a CSS code to realize the logical identity. The main tool we use is a recent characterization of a particular family of diagonal gates in the Clifford hierarchy that are efficiently described by symmetric matrices over rings of integers [N. Rengaswamy et al., Phys. Rev. A 100, 022304]. We refer to these operations as Quadratic Form Diagonal (QFD) gates. Our framework generalizes all existing stabilizer code constructions that realize logical gates via transversal T. We provide several examples of codes and briefly discuss connections to decreasing monomial codes, pin codes, generalized triorthogonality and quasitransversality. We partially extend these results towards characterizing all stabilizer codes that support transversal π/2ℓZ-rotations. In particular, using Ax's theorem on residue weights of polynomials, we provide an alternate characterization of logical gates induced by transversal π/2ℓZ-rotations on a family of quantum Reed-Muller codes. We also briefly discuss a general approach to analyze QFD gates that might lead to a characterization of all stabilizer codes that support any given physical transversal 1- or 2-local diagonal gate.
Finding efficient schemes for non-Clifford logic or magic state preparation is one of the central challenges on the way to fault-tolerant quantum computation. Many of the proposed schemes rely on diagonal non-Clifford logical gates acting on CSS codes in space or decorating CSS-type syndrome-extraction circuits in spacetime. Here we propose and implement efficient algorithms to find all (spacetime) logical gates of a given CSS code (circuit) composed from a prescribed set of ansatz gates. Depending on the choice of ansatz gates, this means finding transversal gates, more general locality-preserving logical circuits, folding gates, or similar. While we focus on qubit diagonal gates in the Clifford hierarchy, we also discuss the generalization to arbitrary diagonal non-hierarchy gates, certain non-diagonal gates, as well as prime and composite-dimensional qudits. Our method works by rephrasing code-space preserving gates as the kernel of the ``pullback'' of the
X check matrix onto phase functions, which maps between finite abelian 2-groups. We implement a fast ``filtration'' method to find this kernel. The runtime for finding fault-tolerant logical gates in a qLDPC code with
O(n) qubits or a circuit with
O(n) gates in a naive dense implementation is
O(n3), with potential for improvement making use of sparsity.
The challenge of quantum computing is to combine error resilience with universal computation. Diagonal gates such as the transversal T gate play an important role in implementing a universal set of quantum operations. This paper introduces a framework that describes the process of preparing a code state, applying a diagonal physical gate, measuring a code syndrome, and applying a Pauli correction that may depend on the measured syndrome (the average logical channel induced by an arbitrary diagonal gate). It focuses on CSS codes, and describes the interaction of code states and physical gates in terms of generator coefficients determined by the induced logical operator. The interaction of code states and diagonal gates depends very strongly on the signs of Z -stabilizers in the CSS code, and the proposed generator coefficient framework explicitly includes this degree of freedom. The paper derives necessary and sufficient conditions for an arbitrary diagonal gate to preserve the code space of a stabilizer code, and provides an explicit expression of the induced logical operator. When the diagonal gate is a quadratic form diagonal gate (introduced by Rengaswamy et al.), the conditions can be expressed in terms of divisibility of weights in the two classical codes that determine the CSS code. These codes find application in magic state distillation and elsewhere. When all the signs are positive, the paper characterizes all possible CSS codes, invariant under transversal Z -rotation through π/2l , that are constructed from classical Reed-Muller codes by deriving the necessary and sufficient constraints on l . The generator coefficient framework extends to arbitrary stabilizer codes but there is nothing to be gained by considering the more general class of non-degenerate stabilizer codes.
In this work, we study quantum CSS codes with transversal
T gates. Here,
T gate transversality is meant in the strongest sense; the application of physical
T to every physical qubit yields logical
T on every logical qubit, without Clifford corrections. Despite the importance of the
T gate in fault-tolerant quantum computation, the parameters of asymptotic families of such codes have not been improved since the work of Hastings and Haah in 2017, and Haah in 2018. In this work, we significantly broaden the achievable parameters of quantum code families with transversal
T gates, both expanding the regime of achievable polynomial rate and distance, and constructing such codes with constant rate and growing distance; this is the first time the latter has been achieved, even when allowing Clifford corrections after the transversal
T gate. These are also the first codes achieving
γ→0 for a code with a transversal
T gate, where
γ is the overhead exponent of magic state distillation.
To do this, we develop a framework of divisible decreasing monomial codes, punctured at a downward-closed set on the Boolean hypercube to create logical qubits. We prove a closed-form expression for the distance of such a code punctured at such a set, which may be of independent interest. We first instantiate this with an explicit construction based on weighted Reed-Muller codes, puncturing at low Hamming-weight points, and then with a randomised construction, where a small random set of points is protected from the puncturing to save quantum code distance, achieving improved parameters.
Transversal Pauli Z rotations provide a natural route to fault-tolerant logical diagonal gates in quantum Calderbank-Shor-Steane (CSS) codes, but their capability is inherently constrained. We develop a homological framework that organizes transversal diagonal gates in terms of their logical action and physical implementation, revealing two layers of structure that govern their behavior. At a fixed level, we establish that their logical action admits a classification in terms of homological data of the underlying chain complex, extending the standard description of logical operators. We then formulate the refinement to finer angles as a lifting problem and derive two Bockstein-type obstruction maps, whose vanishing is a necessary and sufficient condition for the existence of a transversal logical diagonal gate at the next level. Within this framework, known algebraic conditions such as divisibility and triorthogonality are reinterpreted as necessary conditions for the existence of transversal logical diagonal gates with uniform rotation angles. Our results identify homological obstructions governing transversal implementability and provide a conceptual foundation for a formal theory of transversal structures in quantum error correction.