RT info:eu-repo/semantics/article
T1 An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
A1 Camps Moreno, Eduardo
A1 López, Hiram H.
A1 Matthews, Gretchen
A1 Ruano Benito, Diego
A1 San José Rubio, Rodrigo
A1 Soprunov, Ivan
K1 CSS-T construction
K1 Schur product of linear codes
K1 Cyclic codes
K1 Quantum codes
K1 12 Matemáticas
AB CSS-T codes were recently introduced as quantum error-correcting codes that respecta transversal gate. A CSS-T code depends on a CSS-T pair, which is a pair of binarycodes (C1, C2) such that C1 contains C2 , C2 is even, and the shortening of the dual ofC1 with respect to the support of each codeword of C2 is self-dual. In this paper, wegive new conditions to guarantee that a pair of binary codes (C1, C2) is a CSS-T pair.We define the poset of CSS-T pairs and determine the minimal and maximal elementsof the poset. We provide a propagation rule for nondegenerate CSS-T codes. We applysome main results to Reed–Muller, cyclic and extended cyclic codes. We characterizeCSS-T pairs of cyclic codes in terms of the defining cyclotomic cosets. We find cyclicand extended cyclic codes to obtain quantum codes with better parameters than thosein the literature.
PB Springer
YR 2024
FD 2024
LK https://uvadoc.uva.es/handle/10324/75198
UL https://uvadoc.uva.es/handle/10324/75198
LA eng
NO Quantum Information Processing, 2024, vol. 23, n.7
NO Producción Científica
DS UVaDOC
RD 16-abr-2025