[[58,2,11]] · QEC Challenge

[[58,2,11]] d ≤stabilizer

kd²/n

4.172

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 11 · witness Pauli weight 11 (2 Y factors; Hamming weight over 2n bits 13) (claimed upper_bound)

witness operator (Pauli string, 11 qubits)

IZIZIIIIIIIIIIIZIIIIXIIIIIIIZIYXYIZIIIIIIIXIIIIZIIIIIIIIII X: [20, 30, 31, 32, 42] Z: [1, 3, 15, 28, 30, 32, 34, 47]

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)×58 (2,8)×348 (3,8)×116 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

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

(1,6): 58 (2,8): 348 (2,10): 174 (3,8): 116 (3,10): 2204 (3,12): 3016 (3,14): 754

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 58 cyclic shifts, a(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_58, 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 (held). 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

[[58,2,11]] — 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 <= 11 at 300 trials. Deep: 2 x 20,000 trials found nothing lighter (held).

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

Claim: d <= 11, 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 = 58; a(x) = x^28 + x^30; b(x) = x^13 + x^24 + x^34 + x^45. 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) = 2. Witness: X on [20, 30, 31, 32, 42], Z on [1, 3, 15, 28, 30, 32, 34, 47].

Stabilizer generators

generators 58 (max weight 6; 58 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 (58, Pauli strings on 58 qubits)

IIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIII IIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIII IIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIII IIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIII IIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIII IIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIII IIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIII IIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIII IIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIII IIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIII IIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZII IIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZI IIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZ ZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIII IZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIII IIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIII IIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIII IIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIII IIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIII IIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIII IIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIII IIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZII IIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZI IIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZ ZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIII IZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXII IIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIXI IIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXIX XIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIXI IXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIIIX XIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZIII IXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZII IIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZI IIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIIIZ ZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIIII IZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIIII IIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIIII IIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIIII IIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIIII IIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIIII IIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIIII IIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZIII IIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZII IIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZI IIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIIIZ ZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIIII IZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIIII IIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIIII IIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIIII IIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIIII IIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIIII IIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIIII IIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIIII IIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIIII IIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIIII IIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIIII IIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIIII IIIIIIIIIIIIZIIIIIIIIIIZIIIXIXIIIZIIIIIIIIIIZIIIIIIIIIIIII

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

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

Code ID 58-2-11 · download JSON · raw on GitHub