2000 character limit reached
CSS-$T$ codes over Binary Extension Fields and their Physical Foundations
Published 23 Jul 2025 in quant-ph | (2507.17611v1)
Abstract: We investigate the class of CSS-$T$ codes, a family of quantum error-correcting codes that allows for a transversal $T$-gate. We extend the definition of a pair of linear codes $(C_1,C_2)$, $C_i\subseteq\mathbb{F}_qn$, forming a $q$-ary CSS-$T$ code over binary extension fields, and demonstrate the existence of asymptotically good sequences of LDPC CSS-$T$ codes over any such field.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.