Search arXivSearch

arXiv · 2607.12242

Quantum Codes from $r$-Nearly Self-Orthogonal Linear Codes via Jordan Canonical Form over $\mathbb{F}_{q^2}$

Abstract

We introduce a Jordan-canonical-form framework for constructing $q$-ary quantum stabilizer codes from arbitrary classical linear codes over $\F_{q^2}$. The framework does not require the classical linear code $\mathcal{C}$ to satisfy the dual-containing condition (i.e., self-orthogonality). Given a classical code $\mathcal{C}=[n,k,d]_{q^2}$ with parity-check matrix $H$, 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 $\mathcal{C}$ is $r$-nearly dual containing, or, equivalently, $\mathcal{C}^{\perp_h}$ is $r$-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 $A=HH^{\dagger}$ through rank-one perturbations along the Jordan basis $W=P^{-1}$ of the decomposition $A=PJ_AP^{-1}$, we construct an explicit Hermitian self-orthogonal code $\mathcal{C}_{\mathrm{so}}=[n+r,n-k]_{q^2}$. A sufficient distance-preservation criterion guarantees that the resulting $q$-ary quantum code has parameters $[[n+r,2k-n+r,\geq d]]_q$. Applying this construction to classical codes produces several record quantum codes that improve or supplement the best-known parameters in Grassl's tables.

Explore related subjects

Keep this discovery

BibTeXRIS

Liangdong Lu, Ruipan Yang, Yang Liu, Qiang Fu, Guanmin Guo. 2026-09-01. Quantum Codes from $r$-Nearly Self-Orthogonal Linear Codes via Jordan Canonical Form over $\mathbb{F}_{q^2}$. https://arxiv.org/abs/2607.12242

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

The maximum entropy state

We give an algorithm for calculating the maximum entropy state as the least fixed point of a Scott continuous mapping on the domain of classical states in their Bayesian order.

math.PR

Quantum channel discrimination against jammers

We study the problem of quantum channel discrimination between two channels with an adversary input party (a.k.a. a jammer). This setup interpolates between the best-case channel discrimination as studied by (Wang & Wilde, 2019) and the worst-case channel discrimination as studied by (Fang, Fawzi, & Fawzi, 2025), thereby generalizing both frameworks. To address this problem, we introduce the notion of minimax channel divergence and establish several of its key mathematical properties. We prove the Stein's lemma in this new setting, showing that the optimal type-II error exponent in the asymptotic regime under parallel strategies is characterized by the regularized minimax channel divergence.

quant-ph