[[57,3,9]] · QEC Challenge

[[57,3,9]] d ≤stabilizer

kd²/n

4.263

Share this result

Distance

a general stabilizer code has no X and Z sides: d is the minimum Pauli weight of a nontrivial logical operator (a Y factor counts one qubit), and the witness is one Pauli operator that commutes with every generator and is not a product of them

d 9 · witness Pauli weight 9 (6 Y factors; Hamming weight over 2n bits 15) (claimed upper_bound)

witness operator (Pauli string, 9 qubits)

IIIZIIIIIZIIIIIZIIIIIYYIIIIIIIIIIIIIIYYIIIIIIIIIIIIIIYYII X: [21, 22, 37, 38, 53, 54] Z: [3, 9, 15, 21, 22, 37, 38, 53, 54]

certificate none yet · distance stands as a self-certified upper bound (d ≤); the Pauli-weight certifier is not built yet, so stabilizer entries cannot earn d= for now

Diagnostics

computed by the verifier from the parity checks, the layout, and the stored witnesses; shown as evidence, not used for ranking

girth S 4 (shortest cycle of the generator Tanner graph; longer is friendlier to belief propagation)

check weights S 6

qubit degrees S 6

trapping sets S (1,6)×57 (2,8)×342 (3,8)×57 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

full (size, syndrome weight): count census for S

(1,6): 57 (2,8): 342 (2,10): 171 (3,8): 57 (3,10): 2166 (3,12): 3249 (3,14): 627

Construction & provenance

authors @FarLab

provenance submitted through the challenge

novelty novelty not audited

construction One-block cyclic stabilizer code: generator X^a Z^b and its 57 cyclic shifts, a(x) = x²⁵ + x²⁶ + x³¹ + x³², b(x) = x¹⁶ + x²⁶ + x³¹ + x⁴¹ in F_2[x]/(x⁵⁷ - 1); a = g p, b = g q with p, q palindromic so that a b* + b a* = 0; k = deg gcd(a, b, x⁵⁷ - 1)

model Claude Fable 5.1 (claimed, not verified)

builds on arXiv:quant-ph/0502086

date 2026-10-01

notes Found by a sweep of one-block palindromic cyclic codes (Camara-Ollivier-Tillich-type group-algebra code over Z_57, arXiv:quant-ph/0502086), n = 17..200, weight <= 8. Distance ladder: 300-trial Pauli-weight RIS screen, then 2 x 20,000 trials on fresh seeds (dropped 10->9). Novelty unknown: not checked against codetables.de; the dedup gate found no exact, WL-equivalent or Hadamard-image board entry. Genuinely non-CSS: a and b overlap, so every generator carries Y.

family other (a tag, not a ranking)

locality unrestricted (computed from the layout)

weight class weight ≤ 6 (computed)

How this code was found

the research note submitted with this code · raw markdown · all notes

[[57,3,9]] — one-block palindromic cyclic stabilizer code X^a Z^b, weight 6

Direction & hypothesis

The general-stabilizer board's low-weight cells (w <= 8) held only a handful of small codes and the two Chamon baselines (kd^2/n = 4), while the higher-k entries have weight 32. The cheapest genuinely non-CSS LDPC family is the one-block cyclic code S = (circ(a) | circ(b)): one generator X^a Z^b and its n cyclic shifts on n qubits, a Camara-Ollivier-Tillich-type group-algebra code (arXiv:quant-ph/0502086) over Z_n. The shifts commute iff a b* + b a* = 0 (b*(x) = b(1/x)); that holds whenever a = g p and b = g q with p, q palindromic (p = p*) and g arbitrary, and for even n also after b -> x^(n/2) b. Then k = deg gcd(a, b, x^n - 1) and the check weight is |supp a u supp b|. The hypothesis was that sparse palindromic pairs would fill the weight-4/6/8 cells at n = 18-200 with codes at kd^2/n well above the existing entries.

What was searched

All n from 17 to 200; p, q palindromic of weight <= 4 (p taken up to the multiplier

group Z_n^*), g in {1} u {1 + x^j}, both shift variants for even n, check weight <= 8. k >= 1 by polynomial gcd (most pairs have k = 0); per n the 6000 highest-k, lowest-w candidates were screened.

Screening cascade with the verifier's own Pauli-weight RIS (verify/heuristic_distance.py):

8 trials (drop d < 5, and kd^2/n < 3 for n > 40), then 300 trials; kept only if not dominated on (n, k, d, w) by any stabilizer board entry or earlier find.

Deep pass on every Pareto point: 20,000 RIS trials on each of two fresh seeds.

Evidence trail

Screen: d <= 9 at 300 trials. Deep: 2 x 20,000 trials found nothing lighter (dropped 10->9).

qldpc submit re-searched (20,000 trials) and the filed witness has Pauli weight 9.

Claim: d <= 9, witness-backed upper bound; the board's certifier does not minimise Pauli

weight, so no stabilizer entry is exact on the board.

Dead ends

Two-generator and non-palindromic pairs were not searched; the family is exactly the

one above.

Composite n (63, 68, ...) produce 50-80k k >= 1 candidates and dominate the run time; prime

n produce few and mostly k = 1 codes (the X_{i,i+1} Z_{i-j,i+j} weight-4 family, d up to 11 at n = 61).

Candidates that screened at 300 trials and dropped under the deep pass were discarded;

the deep pass changed the distance of a minority of finds by one or two.

Tools

Claude Fable 5.1 in Claude Code; numpy; verify/heuristic_distance.py (Pauli-weight RIS), cli/qldpc.py, verify/. Laptop CPU, a few hours for the whole sweep.

Reproduction

n = 57; a(x) = x^25 + x^26 + x^31 + x^32; b(x) = x^16 + x^26 + x^31 + x^41. Generator i (i = 0..n-1) is X on {i + e mod n : e in supp a} and Z on {i + e mod n : e in supp b} (both -> Y). S = (circ(a) | circ(b)); k = n - rank_2(S) = 3. Witness: X on [21, 22, 37, 38, 53, 54], Z on [3, 9, 15, 21, 22, 37, 38, 53, 54].

Stabilizer generators

generators 57 (max weight 6; 57 mixed X/Z) (one binary symplectic matrix S = (A | B); generator i is X on A_i and Z on B_i, Y where both)

generators (57, Pauli strings on 57 qubits)

IIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIII IIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIII IIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIII IIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIII IIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIII IIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIII IIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIII IIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIII IIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIII IIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIII IIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIII IIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIII IIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIII IIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZII IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZI IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZ ZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIII IZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIII IIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIII IIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIII IIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIII IIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIII IIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXII IIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXI IIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYX XIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIIIY YXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIIII IYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYIII IIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYII IIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXYI IIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIXY YIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIX XYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIII IXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIII IIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIII IIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIIII IIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIIII IIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZIII IIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZII IIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZI IIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIZ ZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIIII IZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIIII IIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIIII IIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIIII IIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIII IIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIII IIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIII IIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIII IIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIII IIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIIII IIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIIII IIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIIII IIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIIII IIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIIII IIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIIII IIIIIIIIIIIIIIIZIIIIIIIIXYIIIIYXIIIIIIIIZIIIIIIIIIIIIIIII

symplectic rows (A | B) (57, sparse supports)

X: [25, 26, 31, 32] Z: [16, 26, 31, 41] X: [26, 27, 32, 33] Z: [17, 27, 32, 42] X: [27, 28, 33, 34] Z: [18, 28, 33, 43] X: [28, 29, 34, 35] Z: [19, 29, 34, 44] X: [29, 30, 35, 36] Z: [20, 30, 35, 45] X: [30, 31, 36, 37] Z: [21, 31, 36, 46] X: [31, 32, 37, 38] Z: [22, 32, 37, 47] X: [32, 33, 38, 39] Z: [23, 33, 38, 48] X: [33, 34, 39, 40] Z: [24, 34, 39, 49] X: [34, 35, 40, 41] Z: [25, 35, 40, 50] X: [35, 36, 41, 42] Z: [26, 36, 41, 51] X: [36, 37, 42, 43] Z: [27, 37, 42, 52] X: [37, 38, 43, 44] Z: [28, 38, 43, 53] X: [38, 39, 44, 45] Z: [29, 39, 44, 54] X: [39, 40, 45, 46] Z: [30, 40, 45, 55] X: [40, 41, 46, 47] Z: [31, 41, 46, 56] X: [41, 42, 47, 48] Z: [0, 32, 42, 47] X: [42, 43, 48, 49] Z: [1, 33, 43, 48] X: [43, 44, 49, 50] Z: [2, 34, 44, 49] X: [44, 45, 50, 51] Z: [3, 35, 45, 50] X: [45, 46, 51, 52] Z: [4, 36, 46, 51] X: [46, 47, 52, 53] Z: [5, 37, 47, 52] X: [47, 48, 53, 54] Z: [6, 38, 48, 53] X: [48, 49, 54, 55] Z: [7, 39, 49, 54] X: [49, 50, 55, 56] Z: [8, 40, 50, 55] X: [0, 50, 51, 56] Z: [9, 41, 51, 56] X: [0, 1, 51, 52] Z: [0, 10, 42, 52] X: [1, 2, 52, 53] Z: [1, 11, 43, 53] X: [2, 3, 53, 54] Z: [2, 12, 44, 54] X: [3, 4, 54, 55] Z: [3, 13, 45, 55] X: [4, 5, 55, 56] Z: [4, 14, 46, 56] X: [0, 5, 6, 56] Z: [0, 5, 15, 47] X: [0, 1, 6, 7] Z: [1, 6, 16, 48] X: [1, 2, 7, 8] Z: [2, 7, 17, 49] X: [2, 3, 8, 9] Z: [3, 8, 18, 50] X: [3, 4, 9, 10] Z: [4, 9, 19, 51] X: [4, 5, 10, 11] Z: [5, 10, 20, 52] X: [5, 6, 11, 12] Z: [6, 11, 21, 53] X: [6, 7, 12, 13] Z: [7, 12, 22, 54] X: [7, 8, 13, 14] Z: [8, 13, 23, 55] X: [8, 9, 14, 15] Z: [9, 14, 24, 56] X: [9, 10, 15, 16] Z: [0, 10, 15, 25] X: [10, 11, 16, 17] Z: [1, 11, 16, 26] X: [11, 12, 17, 18] Z: [2, 12, 17, 27] X: [12, 13, 18, 19] Z: [3, 13, 18, 28] X: [13, 14, 19, 20] Z: [4, 14, 19, 29] X: [14, 15, 20, 21] Z: [5, 15, 20, 30] X: [15, 16, 21, 22] Z: [6, 16, 21, 31] X: [16, 17, 22, 23] Z: [7, 17, 22, 32] X: [17, 18, 23, 24] Z: [8, 18, 23, 33] X: [18, 19, 24, 25] Z: [9, 19, 24, 34] X: [19, 20, 25, 26] Z: [10, 20, 25, 35] X: [20, 21, 26, 27] Z: [11, 21, 26, 36] X: [21, 22, 27, 28] Z: [12, 22, 27, 37] X: [22, 23, 28, 29] Z: [13, 23, 28, 38] X: [23, 24, 29, 30] Z: [14, 24, 29, 39] X: [24, 25, 30, 31] Z: [15, 25, 30, 40]

Code ID 57-3-9 · download JSON · raw on GitHub