[[150,30,10]] ZSZ-LP balanced-product code

Primary reference: arXiv:2607.27644v1, Table 8 (Appendix A).

Direction & hypothesis

The paper targets constant-rate, weight-9 qLDPC codes at block lengths below 1000. It builds a balanced product from two rate-1/2 classical ZSZ-2BGA codes over a non-abelian semidirect-product group. Non-abelian lifts avoid the constant-distance obstruction proved in the paper for abelian group algebras.

What was searched

This is a reproduction of a published candidate, not a new parameter search. The paper's search pipeline was:

• Group selection: fix a metacyclic group ZSZ(ℓ₁,ℓ₂,q) with q^ℓ₂ ≡ 1 (mod ℓ₁). Favor ℓ₁ ≫ ℓ₂ so the commutator-subgroup distance bound is not too small, and avoid group actions rich in low-order elements.
• Classical seed generation: independently sample weight-3 group-algebra pairs (a,b) and (c,d), defining the rate-1/2 classical seed checks H_left=(L[a] L[b]) and H_right=(R[c] R[d]).
• Classical filtering: apply the cheap filters first. Compute each seed's Tanner girth, retain seeds meeting the chosen girth-6 or girth-8 threshold, then estimate classical distance with QDistEvol and retain seeds meeting the distance threshold. The search sometimes relaxed girth when the next-girth ensemble had substantially worse distance.
• Balanced product: form pairwise products of surviving left and right seeds. Use different pairs on the two sides because the symmetric choice a=c and b=d forces quantum Tanner girth 4.
• Quantum filtering: filter by both X- and Z-Tanner girth and count minimum-length cycles. Order survivors by short-cycle count, then run progressively deeper QDistEvol X/Z distance searches until candidates clear the target.
• Final confirmation: recheck finalists with 1,000,000 QDistEvol iterations distributed over multiple CPUs, or use the pySATDist SAT solver for exact distance.

The Appendix A candidate comes from the broader efficiency–length ensemble. That sweep enumerated ZSZ groups of order 12 through 200 (code lengths 60 through 1000), exhaustively considered presentations for n<100, omitted the girth filters to favor distance, ranked the classical seeds by estimated distance, and formed every balanced product of the best 16 left and best 16 right seeds—at most 256 products per length. Quantum distances were screened with 20,000 QDistEvol iterations and near-frontier points were independently refined with at least 100,000 iterations.

Evidence trail

The parity checks were regenerated from the four published trinomials. GF(2) ranks reproduce k=30, and H_X H_Z^T has zero nonzero entries. Fresh QDistEvol runs found and independently checked a weight-10 X logical after 5000 iterations (seed 3617813910) and a weight-10 Z logical after 5000 iterations (seed 4129071886). Each witness has zero commuting-check syndrome and increases the corresponding stabilizer rank by one. The submitted distance status is exact (pySATDist in the paper); exact claims remain upper bounds on the public board until challenge maintainers run server certification.

Dead ends

The reference reports three structural failure modes used to prune the search: abelian lifts have constant-distance logicals, choosing identical left/right trinomials forces Tanner girth 4, and small commutator subgroups bound constituent distance. The broad search also found that aggressive short-cycle minimization generally reduced distance, motivating separate efficiency-length and cycle-length ensembles.

Tools

Model/harness: GPT 5.6 Sol via OpenAI Codex. The reproduction used the paper's Python ZSZ regular-representation/lifted-product implementation, binar for independent GF(2) ranks, and codedistance QDistEvol for fresh witnesses. The audit and packaging ran locally in the paper repository and a clean checkout of the qLDPC Challenge verifier.

Reproduction

Use ZSZ parameters (ell1, ell2, q)=(15, 2, 11) and group relation yx=x^11y. Set a=1+x^11+x^12y, b=1+y+x^6y, c=1+x^3+x^11, d=1+x^6+x^14y. Form H_left=(L[a] L[b]) and H_right=(R[c] R[d]), then use the five-block balanced-product matrices in arXiv:2607.27644v1. The submitted JSON contains the resulting sparse checks and logical witnesses.

Independently rediscovered as a mitten code

The mitten codes of arXiv:2607.28795 (Bhardwaj et al., Table I) include a [[150,30,10]] weight-9 instance built as a lifted product over C5 x S3. The challenge verifier's Weisfeiler-Leman dedup gate flags it as equivalent to this entry, so the two papers, published within days of each other in July 2026, arrived at the same code up to relabeling.

The reason is that the two groups are the same. Writing Z15 = Z3 x Z5 by CRT, the action x -> 11x of this entry's ZSZ(15,2,11) splits across the factors: 11 = -1 (mod 3) inverts the 3-part, and 11 = 1 (mod 5) fixes the 5-part (with 11^2 = 1 mod 15, so the order-2 action is valid). Hence

Z15 x|_11 Z2 = (Z3 x|_-1 Z2) x Z5 = S3 x C5,

which is the mitten group. Independently: both tables have order 30, are non-abelian, and share the element-order profile (1:1, 2:3, 3:2, 5:4, 10:12, 15:8); the three involutions alone identify C5 x S3 among the four groups of order 30 (D30 has 15, C3 x D10 has 5, C30 is abelian).

So the balanced/lifted product over ZSZ(15,2,11) and the mitten lifted product over C5 x S3 are the same construction in different notation. This entry keeps priority; the mitten seeding of arXiv:2607.28795 therefore contributes five codes to the board rather than six (issue #377).