Quantum Matrix-Product Codes: CSS-T Characterization and Maximality

RESUMO

CSS-T codes are quantum error-correcting codes that play an important role in fault-tolerant quantum computation, as they help mitigate the proliferation of errors. They admit a transversal T-gate and are defined from a pair of nested classical binary linear codes satisfying a specific algebraic condition expressed in terms of their Schur square. We extend this algebraic characterization to the propagation rule known as the $(u \mid u+v)$-construction, that is, the matrix-product code constructed from two constituent codes. Moreover, for cyclic constituent codes, we provide an explicit characterization in terms of the defining cyclotomic sets, which extends existing results for cyclic codes. This framework allows the construction of new and longer CSS-T codes.