Quantum error codes with new algebra rules extend fault tolerance
Quantum Matrix-Product Codes: CSS-T Characterization and Maximality
Information Theory
Summary
Quantum computers need ways to protect information from errors caused by noise. The authors study a special kind of quantum error-correcting code called CSS-T codes that allow certain quantum operations to be done safely. They figured out how these codes behave when combined using a mathematical method called the matrix-product construction, especially for codes with cyclic patterns. This work helps build longer and potentially more powerful quantum error-correcting codes.
What this means in practice
- •For quantum hardware engineers: Design quantum hardware error correction protocols that use longer CSS-T codes supporting transversal T-gates for enhanced fault tolerance.
- •For cryptography system developers: Construct quantum-resistant cryptographic protocols incorporating advanced CSS-T codes with well-characterized algebraic structures for improved security assumptions.
A theory result. No direct application yet.
Authors
Delio Jaramillo-Velez, Alessandro Neri, Adway Patra, Diego Ruano, Flavio Salizzoni
Abstract
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.