[[160,32,10]] ZSZ-LP balanced-product code

Primary reference: arXiv:2607.27644v1, Table 1.

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 Table 1 candidates came from the full cascade. For each selected ZSZ group, a few thousand independently sampled left and right seed codes were enough to produce the reported finalists.

Evidence trail

The parity checks were regenerated from the four published trinomials. GF(2) ranks reproduce k=32, 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 3198912388) and a weight-10 Z logical after 5000 iterations (seed 4000939696). 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)=(16, 2, 9) and group relation yx=x^9y. Set a=1+x^13+x^14y, b=1+x^3y+x^13y, c=1+x^14+x^12y, d=1+x^7+x^11. 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.