arXiv:2609.35601
Low-Weight Canonical Logical Bases from Pair-Partition Codes
Koki Okada, Kenta Kasai
Abstract
We construct complete canonical logical bases for qubit CSS codes by assigning quaternary coefficients to binary circulant permutation matrix pair-partition (CPM-PP) checks, constructing and normalizing logical representatives, and expanding the result into binary matrices. When the two check systems have invertible submatrices on disjoint column sets, cofactor representatives are canonically paired by the inverse of a single pairing polynomial. The resulting pairs span the entire logical space. When the pairing polynomial is a cyclic-shift monomial with coefficient one, normalization preserves the binary weights of the representatives. We state the construction for general block dimensions and CPM size, work through a corresponding example, and report the parameters, check ranks, and basis weights of seven binary codes. Representative examples have parameters $[[320,80,14]]$, $[[448,112,18]]$, and $[[2048,512,24]]$. All three have maximum check weight 10 on both the X and Z sides. Their canonical logical representatives have binary weights 25, 27, and 27, respectively, on both the X and Z sides.
AI Summary
The paper addresses constructing complete, low-weight canonical logical $X/Z$ bases for quasi-cyclic CSS codes while retaining their circulant structure. It starts from binary circulant-permutation-matrix pair-partition checks, assigns coefficients in $\mathbb F_4$ that preserve commutation, constructs logical representatives over $R_P=\mathbb F_4[z,z^{-1}]/(z^P-1)$, and expands them into binary matrices. The construction requires invertible check submatrices on disjoint block-column sets. Cofactor seeds then have a common pairing polynomial $g=\Delta_Z^*\Delta_X$; multiplying one side by $g^{-1}$ gives canonical pairing. Invertibility fixes the check ranks, allowing completeness to follow from dimension counting and independence under logical pairing. For block dimensions $J\times L$ and circulant size $P$, the binary code has $n=2LP$ and $k=2(L-2J)P$. If $g=z^\nu$ with coefficient one, normalization is a cyclic shift and preserves binary representative weights. Seven explicit instances use $J=3,L=8$, all with binary check weight 10. Examples include $[[320,80,14]]$, $[[448,112,18]]$, and $[[2048,512,24]]$, with complete canonical bases of respective row weights 25, 27, and 27 on both sides. Matrix identities and ranks are checked computationally; exact distances are reported as certified by exhaustive lower-weight exclusion and matching logical witnesses. The invertibility condition need not hold for every pair-partition code. General polynomial normalization can increase weight, and quaternary-to-binary expansion itself increases check weight—from 8 to 10 in the worked example. Constructed basis weights are distinct from minimum distance.
The authors used OpenAI Codex to assist with manuscript drafting, translation, and revision; the development and review of mathematical arguments;
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 13 pages, 2 tables