arXiv:2610.02392 · IEEE Open Journal of the Communications Society
Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d,q)PG(d,q): Construction, Structural Theorems, and Monte-Carlo Performance
Michel Kulhandjian, Lajos Hanzo
Abstract
We propose Q(q,d), a family of q-ary non-CSS qudit stabilizer codes with prime power q and dimension d >= 2, constructed from Singer difference sets and non-degenerate quadrics in PG(d,q). The parity check H = (A | M_Q A) couples the Singer-circulant incidence matrix A with the quadric circulant M_Q, and a Cancellation Lemma uses the identity (k - lambda) = q^{d-1} = 0 mod p to make H symplectic-isotropic over F_q. Five structural theorems carry the novelty: a cross-correlation modular-constancy identity nu = 1 mod q at q odd, d >= 3, with a two-value pattern that proves a 2-torsion distance ceiling; a CRT zero-count identity; an explicit Clifford bridge identifying Q(q,2) as a graph-state encoding of the trivial Singer CSS code, with the 2021 low-density-spreading (LDS) sign-flip pattern realised by a symmetric circulant; a paired column-rigidity equality d_min = R_P + 1; and a lower bound d_min(Q(7,2)) >= 8 from an exhaustive Singer-Frobenius search. A Hamada-Smith specialisation yields the closed-form logical dimension k(p,d) = theta_d(p) - C(p+d-1, d) - 1, and the flagship Q(p,2) = [[p^2 + p + 1, p(p+1)/2, d_min]]_p attains asymptotic rate one-half. We conjecture d_min(Q(p,2)) = p + 1 for odd primes, proven at p = 5 and lower-bounded to >= 8 at p = 7. Instances include Q(3,2) = [[13,6,3]]_3, Q(5,2) = [[31,15,6]]_5, Q(7,2) = [[57,28, d>=8]]_7, and Q(3,4) = [[121,105,3]]_3. Monte-Carlo over 1.5 x 10^6 trials shows Q(5,2) achieves a 70-fold per-logical-qudit improvement over Steane [[7,1,3]]_2 at depolarising rate 10^-3 with zero silent logical errors. A textbook bounded-distance decoder is used; Berlekamp-Massey-style cyclic decoding is left as the natural sequel.
AI Summary
The paper studies whether Singer difference sets and trace-defined quadrics in projective geometry can generate structured qudit stabilizer codes. It constructs $\mathcal Q(q,d)$ with check matrix $H=(A\mid M_QA)$, where $A$ is the Singer-circulant point–hyperplane incidence matrix and $M_Q$ is a circulant quadric indicator. Symplectic isotropy follows from the difference-set identity and $q^{d-1}=0$ in characteristic $p$. For prime $q=p$, a Hamada–Smith rank formula gives $k=\theta_d(p)-\binom{p+d-1}{d}-1$; the $d=2$ family has length $p^2+p+1$ and rate approaching $1/2$. Reported instances include $[[13,6,3]]_3$, $[[31,15,6]]_5$, and $[[57,28,d\ge8]]_7$. Distances are investigated through support-restricted centralizer kernels, with exhaustive cyclic/Frobenius symmetry-reduced searches. Further results concern modular cross-correlations, a claimed weight-two logical obstruction for odd $q$ and odd $d\ge3$, CRT zero patterns, and an explicit symmetric-circulant Clifford encoding at $d=2$. Bounded-distance decoding simulations report agreement with binomial failure bounds and no observed silent logical errors for $\mathcal Q(5,2)$. The advertised $70$-fold comparison with Steane at depolarising probability $10^{-3}$ uses block-failure bounds divided by logical dimension, across different qudit dimensions. The general flagship distance remains conjectural, the $p=7$ result lacks a matching upper bound, and efficient structure-specific decoding is deferred. The manuscript also contains incompatible statements about CSS status and some distance bounds; its universal paired-rigidity equality does not account for low-weight stabilizers in degenerate codes.
Central claim may not hold: The claimed universal equality d_min=R_P+1 incorrectly counts low-weight stabilizers as logical operators and is false for degenerate stabilizer codes such as the Shor code. The modular-constancy proof substitutes correlation for the construction's convolution, whose values recomputed from the supplied (3,3) trace table already contradict the claimed constant residue, while the two-value corollary also conflicts with the paper's (3,5) data. The paper asserts both a universal distance bound yielding [[40,29,≥4]]_3 and the incompatible distance-2 result for that same instance, and its appendix supplies trace indicators inconsistent with its own construction recipe. The advertised 70-fold per-logical-qudit improvement uses analytical block-failure estimates divided by k, a quantity that is not generally a single-logical-qudit error probability and is not resolved by the reported low-rate Monte-Carlo data. The claimed structural absence of silent logical errors is false because nontrivial logical Pauli errors have zero syndrome and positive probability under the specified depolarising channel.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- Accepted for publication in IEEE Open Journal of the Communications Society