quantum information theory

Quantum Codes from -Nearly Self-Orthogonal Linear Codes via Jordan Canonical Form over

arXiv:2607.12242

summary

The paper presents a Jordan‑canonical‑form method to build q‑ary quantum stabilizer codes from any classical linear code over \(\mathbb{F}_{q^2}\) without requiring self‑orthogonality, by reducing the rank of a Hermitian inner‑product matrix and obtaining explicit Hermitian self‑orthogonal codes.

Abstract

We introduce a Jordan-canonical-form framework for constructing -ary quantum stabilizer codes from arbitrary classical linear codes over $\F_{q^2}$. The framework does not require the classical linear code to satisfy the dual-containing condition (i.e., self-orthogonality). Given a classical code with parity-check matrix , we measure the obstruction to Hermitian self-orthogonality by the rank $r=(n-k)-\dim_{\F_{q^2}}(\mathcal{C}^{\perp_h}\cap \mathcal{C})$. The ingredient code is -nearly dual containing, or, equivalently, is -nearly self-orthogonal, by which we mean that $r=\Rank(HH^{\dagger})=\dim_{\F_{q^2}}(\mathcal{C}^{\perp_h})-\dim_{\F_{q^2}}(\mathcal{C}^{\perp_h}\cap \mathcal{C})$. By systematically reducing the rank of the Hermitian inner-product matrix through rank-one perturbations along the Jordan basis of the decomposition , we construct an explicit Hermitian self-orthogonal code . A sufficient distance-preservation criterion guarantees that the resulting -ary quantum code has parameters . Applying this construction to classical codes produces several record quantum codes that improve or supplement the best-known parameters in Grassl's tables.

Topics & keywords

#quantum error correction#stabilizer codes#linear codes#Jordan canonical form#self-orthogonal codesHermitian self-orthogonalr-nearly dual containingrank-one perturbationparity-check matrixGrassl's tables
Quantum Codes from $r$-Nearly Self-Orthogonal Linear Codes via Jordan Canonical Form over $\mathbb{F}_{q^2}$ · wovepaper