An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance

DOI10.1007/S11128-024-04427-5zbMATH Open1542.94169MaRDI QIDQ6566200

Eduardo Camps, Rodrigo San-José, Hiram H. López, Diego Ruano, Gretchen L. Matthews, Ivan Soprunov

Publication date: 3 July 2024

Published in: Quantum Information Processing (Search for Journal in Brave)

zbMATH Keywords

cyclic codesquantum codesSchur product of linear codesCSS-T construction

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Quantum coding (general) (81P70)

Cites Work

• Stabilizer quantum codes from \(J\)-affine variety codes and a new Steane-like enlargement
• The theory of cyclic codes and a generalization to additive codes
• Coding theory package for Macaulay2
• Squares of matrix-product codes
• New quantum codes from CSS codes
• Multiple-particle interference and quantum error correction
• Nonbinary quantum codes
• On Squares of Cyclic Codes
• Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing
• Quantum error correction via codes over GF(4)
• Good quantum error-correcting codes exist

This page was built for publication: An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566200)