Â鶹´«Ã½Ó³»­

CSS-T codes are a class of stabilizer codes introduced by Rengaswamy et al with desired properties for quantum fault-tolerance. In this work, we comprehensively study non-degenerate CSS-T codes built from Reed-Muller codes. These classical codes allow for constructing optimal CSS-T code families with nonvanishing asymptotic rates up to 12 and possibly diverging minimum distance when non-degenerate.

We propose a new systematic construction of CSS-T codes from any given CSS code using a map Ï•. When Ï• is the identity map I, we retrieve the construction of hu2021mitigating and use it to prove the existence of asymptotically good binary CSS-T codes, resolving a previously open problem in the literature, and of asymptotically good quantum LDPC CSS-T codes.