Year: 2026
Type: preprint
Abstract: In this paper, we focus on the problem of computing the set of diagonal transversal gates fixing a CSS code. We determine the logical actions of the gates as well as the groups of transversal gates that induce non-trivial logical gates and logical identities. We explicitly declare the set of equations defining the groups, a key advantage and differentiator of our approach. We compute the complete set of transversal stabilizers and transversal gates for any CSS code arising from monomial codes, a family that includes decreasing monomial codes and polar codes. As a consequence, we recover and extend some results in the literature on CSS-T codes, triorthogonal codes, and divisible codes.
Source: arXiv (Cornell University)
Institutions: Université de Bordeaux, Virginia Tech, University of Arizona
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: Collaborative Research: CIF: Medium: QODED: Quantum codes Optimized for the Dynamics between Encoded Computation and Decoding using Classical Coding Techniques, Coding for Storage, Computing, and Quantum Error Correction, G3480869486, Collaborative Research: Evaluation Codes, Duals, and Applications, Collaborative Research: Evaluation Codes, Duals, and Applications, G4509960801, G6033112984, G6296285101, G7084143925
OpenAlex ID: W7126207234
Cites:
Cited by:
Related to:
