arXiv:2610.19459
Quantum LDPC Codes from Polynomial Minors
Vahid Nourozi, Roxana Smarandache, David G. M. Mitchell
Abstract
We construct quantum codes from codewords of a cyclic code and the minors of a polynomial matrix. The construction uses a two-row, three-column matrix whose minors yield a second matrix satisfying the CSS orthogonality condition. We derive the code dimension from the greatest common divisors of the entries and minors, with a simplified formula for odd lifting factors. A residue characterization identifies additional common factors of the minors and leads to a method for controlling the dimension through polynomial selection. We also give a condition for changing the minor generator without changing the code. Explicit polynomial constructions yield 13 quantum codes with verified minimum distances, including a $[[255,80,12]]$ code of rate $80/255$.
AI Summary
The paper studies how polynomial minors can construct quasi-cyclic CSS codes while allowing algebraic control of the number of logical qubits. Starting from a $2\times3$ matrix over $\mathbb F_2[x]/(x^N+1)$, it forms a second check matrix from the three minors; the determinant identity ensures CSS orthogonality. The main specialization uses rows $(a,b,c)$ and $(x^tc,a,b)$, with the appropriate circulant transposes. The dimension is derived using Smith invariants and polynomial gcds. For odd $N$, it is $K=\deg g+2\deg g_1$, where $g$ is the common gcd of the entries with $x^N+1$ and $g_1$ is the corresponding gcd of the minors. A residue-field characterization identifies when an additional irreducible factor divides all minors, enabling dimension selection through local conditions and the Chinese remainder theorem. A separate criterion characterizes polynomial multipliers that change the minor generator without changing its row space. Thirteen explicit codes have stated exact minimum distances, including $[[255,80,12]]$ and $[[189,58,10]]$. For the former, a weight-12 logical operator and exhaustive support/coset calculations establish $d_X=12$ and $12\le d_Z\le20$; its rate is $80/255$, with check-row weights 22 and 61. For the latter, $d_X=10$ and $d_Z=12$. Dimension control does not guarantee sparse entries or distance. Minor-generated checks are generally heavier than the original checks, and multipliers can sometimes reduce their weight. Constructions with low weights in both check matrices and decoding-performance studies are left for future work.
Error found: Under the paper's convention of reducing products modulo x^N+1, the reduced minors need not have polynomial gcd divisible by g², so the polynomial F required by the general dimension theorem can fail to exist.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.