arXiv:2610.12782
Coset Lifted Product Codes: Constructing Quantum LDPC Codes from Non-Normal Subgroup Actions
Rajendra Prasad Rajpurohit, V. Lalitha, Shayan Srinivasa Garani
Abstract
We introduce coset lifted product (CLP) codes, a family of quantum LDPC codes that combine the protograph structure of lifted product codes with the coset action of Aydin, Tamo, and Barg \cite{AydinTamoBarg2026}. Given a finite group $G$, a subgroup $H \le G$ that need not be normal, a protograph $A$ over $\mathbb F_2[G]$, and a protograph $B$ over $\mathbb F_2[N_G(H)]$, the two protographs act on the cosets $G/H$ from the left and from the right to produce quantum CSS codes. Further, for groups of odd order, we give an explicit formula for the dimension as a sum over the irreducible representations $ρ$ of $G$ of hypergraph product dimensions. A search over $14,843$ pairs $(G,H)$ with $H$ restricted to be non-normal and $120 \le n \le 400$ yields certified codes that exceed the best published value of $Q=kd^2/n$ at check weights $6,7$ and $9$, i.e., we obtain $[[360,20,20]]$ at $w=6$, a $[[360,24,20]]$ code at $w=7$, and codes $[[252,16,18]]$ and $[[288,16,20]]$ at $w=9$. Our search also produce high-distance codes with parameters $[[168,10,14]], [[240,8,20]]$ at $w=6$ and $[[216,8,18]]$ at $w=7$.
AI Summary
The paper asks how non-normal subgroup coset actions can be incorporated into lifted-product quantum LDPC constructions, and whether the resulting design space yields improved finite-length code parameters. It defines coset lifted product (CLP) codes using a protograph $A$ over $\mathbb F_2[G]$ acting on $G/H$ from the left and a protograph $B$ over $\mathbb F_2[N_G(H)]$ acting from the right. These commuting actions guarantee CSS orthogonality for arbitrary protograph sizes. The construction includes regular-action lifted products and previously introduced coset-based two-block codes. For groups of odd order, a representation-theoretic decomposition gives an explicit dimension formula as a sum of hypergraph-product dimensions. Each summand uses the image of $A$ in an irreducible representation and the induced action of $B$ on its multiplicity space, whose dimension is the dimension of the subgroup-fixed space. A restricted search over $14{,}843$ group–subgroup pairs, primarily using a scalar $A$ and a $2\times2$ protograph $B$, produces certified codes reported to exceed published values of $Q=kd^2/n$ at fixed maximum check weights: $[[360,20,20]]$ at weight 6, $[[360,24,20]]$ at weight 7, and $[[252,16,18]]$ and $[[288,16,20]]$ at weight 9. Distances are screened with randomized searches and certified using integer programming over logical-operator sectors; construction data are printed. The dimension formula is restricted to odd-order groups. Several additional candidates have only distance upper bounds, with higher bounds explicitly flagged as potentially unstable under longer searches. The numerical search covers restricted subgroup choices, protograph layouts, and block lengths.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.