[[114,4,11]] · QEC Challenge

[[114,4,11]] d =

114

kd²/n

4.246

X/Z

Share this result

Distance

X/Z asymmetry 1 · d_X = 11, d_Z = 11 · w_X = 5, w_Z = 5 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)

d_X 11 · witness weight 11 (claimed upper_bound)

witness operator (support, 11 qubits)

[3, 22, 24, 31, 40, 66, 70, 71, 76, 81, 107]

d_Z 11 · witness weight 11 (claimed upper_bound)

witness operator (support, 11 qubits)

[23, 24, 34, 45, 63, 72, 85, 94, 102, 103, 111]

certificate exact, d = 11 · CryptoMiniSat 5.14 SAT

X: no logical < 11 exists; Z: no logical < 11 exists

Diagnostics

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

girth H_X 6 · H_Z 6 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)

check weights H_X 5 · H_Z 5

qubit degrees H_X 2–3 (mean 2.5) · H_Z 2–3 (mean 2.5)

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

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

(1,2): 57 (1,3): 57 (2,2): 57 (2,3): 342 (2,4): 171 (3,2): 57 (3,3): 1083 (3,4): 1881 (3,5): 684 (3,6): 342 (3,7): 57

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

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

(1,2): 57 (1,3): 57 (2,2): 57 (2,3): 342 (2,4): 171 (3,2): 57 (3,3): 1083 (3,4): 1881 (3,5): 684 (3,6): 342 (3,7): 57

Construction & provenance

authors Lee, Gideon

provenance literature baseline

construction Two-block group-algebra code C(a,b) of arXiv:2610.13880 (Table 11) over the cyclic group C57 (GAP SmallGroup(57,2)): H_X = (L(a) | R(b)), H_Z = (R(b)^T | L(a)^T) with L and R the left and right regular representations, a = 1 + x + x²³, b = 1 + x³ in a generator x of order 57, i.e. the generalized bicycle code with A = a(x), B = b(x). The stored matrices use the qubit ordering of the paper's database (record 28f4521e3bcc3b62, github.com/gideonlsx/bicycle-race @ aed705a, data/codes.jsonl, CC BY 4.0): qubits 0..56 are the left block and 57..113 the right block, group elements numbered as GAP's Elements(SmallGroup(57,2)) with e0 the identity, x = e4, so a = e0 + e4 + e15, b = e0 + e8. Rebuilt from the database's group data; CSS commutation, k, check weight and both of the paper's witnesses were re-checked on the rebuilt matrices.

model Claude Fable 5.1 (Claude Code) (claimed, not verified)

reference arXiv:2610.13880

date 2026-10-12

notes Literature reconstruction. The paper states d = 11 exactly (d_X: ladder in the screen (frontier mode, exact_on_accept; cluster engine, symmetry roots); d_Z: ladder in the screen (frontier mode, exact_on_accept; cluster engine, symmetry roots); verification record: one engine). Readings here: qldpc submit's RIS (20,000 NumPy trials per side) and its 2,000,000-trial accelerator pass, plus the verifier's refutation search; witnessed upper bound, see notes/114-4-11.md.

family generalized bicycle (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

[[114,4,11]] two-block code over C57 from the Bicycle Race census (arXiv:2610.13880), rebuilt from the paper's database

Direction & hypothesis

arXiv:2610.13880 (Gideon Lee, "Bicycle Race: small two-block codes on the Pareto frontier", 9 October 2026) enumerates about 10^8 two-block group-algebra codes C(a,b) of check weight five to nine over groups of order at most 160 (n <= 320), with exact distances, and publishes a database of 12,448 of them (github.com/gideonlsx/bicycle-race @ aed705a, file data/codes.jsonl, CC BY 4.0), each with a witness logical. The question here is narrow: which of the codes the paper tabulates (Tables 2, 3, 9 and 11, and the ones named in Sec. 3) advance the board's four-axis frontier (n, k, d, check weight) and are not already on it? This entry is one of the 28 that do.

What was searched

Screen: the 45 distinct parameter triples in those tables were compared

with every CSS entry on main under the site's Pareto rule (an entry dominates when n <=, k >=, d >=, w <= with at least one strict), at the paper's check weight. Thirteen are already on the board at the same or a lower weight ([[60,4,8]], [[64,18,8]], [[84,14,10]], [[90,8,10]], [[90,12,9]], [[102,20,10]], [[144,12,12]], [[180,8,16]], [[182,6,18]], [[186,10,14]], [[192,8,16]], [[288,12,18]] and [[288,16,16]]); four are dominated by board entries ([[168,12,12]] by [[144,12,12]], [[198,8,16]] by [[180,8,16]], [[200,16,12]] by [[192,16,12]], and [[216,4,16]] by [[192,4,16]]); Table 9's [[192,12,14]] and [[192,16,12]] are Lin-Pryadko archive codes, not in the paper's database, and already on the board. The remaining 28 are new nondominated points and are filed one per PR.

This code: record 28f4521e3bcc3b62 of the database (Table 11 of the paper;

database labels front, front-2D), over the cyclic group C57 (GAP SmallGroup(57,2)), check weight 5 (block weights 3 + 2): a = 1 + x + x^23, b = 1 + x^3 in a generator x of order 57, i.e. the generalized bicycle code with A = a(x), B = b(x). The stored matrices use the qubit ordering of the paper's database (record 28f4521e3bcc3b62, github.com/gideonlsx/bicycle-race @ aed705a, data/codes.jsonl, CC BY 4.0): qubits 0..56 are the left block and 57..113 the right block, group elements numbered as GAP's Elements(SmallGroup(57,2)) with e0 the identity, x = e4, so a = e0 + e4 + e15, b = e0 + e8.

Rebuild: the generators' right-multiplication permutations in the

database's data/groups.jsonl give the multiplication table; then H_X = (L(a) | R(b)), H_Z = (R(b)^T | L(a)^T) with qubits 0..|G|-1 the left block. A short standalone NumPy script did this and checked CSS commutation, k = n - rank H_X - rank H_Z = 4, max check weight 5, and both of the paper's witnesses (weight 11 X, weight 11 Z, in the kernel of the other side's checks and outside its own stabilizer row space) before anything was submitted.

Distance: the paper states d = 11 exactly. Its record: d_X "ladder in the screen (frontier mode, exact_on_accept; cluster engine, symmetry roots)";

d_Z "ladder in the screen (frontier mode, exact_on_accept; cluster engine, symmetry roots)"; verification "one engine". Here, qldpc submit's own search (20,000 NumPy RIS trials per side, then a 2,000,000-trial accelerator pass) read d_X <= 11 and d_Z <= 11, and the verifier's refutation search found nothing lighter than 11.

Evidence trail

| instrument | trials | lightest logical | |---|---:|---:| | paper: exact search (record above) | exact | 11 on both sides, witnesses shipped with the record | | qldpc submit RIS (NumPy) + accelerator pass, per side | 20,000 + 2,000,000 | X 11, Z 11 | | the verifier's refutation gate (qldpc_verify, refute=True) | gate | nothing below 11 |

Claim: d <= 11 on both sides, a witnessed upper bound agreeing with the paper's exact distance. An exact certificate (verify/certify.py) is the maintainer-side tier and is not asserted here.

Dead ends

The 17 tabulated codes listed above add nothing to the board and were not

filed.

Only the tabulated codes were screened. The database's 2,435 codes labelled

as lying on the paper's own front are a larger pool a later pass could screen against the board the same way.

Tools

Claude Fable 5.1 (Claude Code): a standalone NumPy rebuild script (the construction above, from the database's group data), cli/qldpc.py submit for the witness search, the verifier and the PR draft, and verify/qldpc_verify.py on the final JSON.

Reproduction

Clone github.com/gideonlsx/bicycle-race @ aed705a and run its scripts/codes.py on record 28f4521e3bcc3b62: it rebuilds the code from data/groups.jsonl and data/codes.jsonl and checks the witnesses in pure Python. Or build it from the construction above. The JSON here carries both check matrices and both witnesses, so the entry verifies without the download.

Parity checks

X-checks 57 (max weight 5) · Z-checks 57 (max weight 5)

H_X (57 checks, sparse supports)

[0, 46, 56, 57, 104] [1, 48, 53, 58, 106] [2, 3, 49, 59, 107] [3, 44, 55, 60, 108] [0, 4, 51, 61, 109] [5, 6, 52, 62, 110] [1, 6, 47, 63, 111] [2, 7, 54, 64, 112] [8, 9, 55, 57, 65] [4, 9, 50, 66, 113] [5, 10, 56, 58, 67] [1, 11, 12, 59, 68] [7, 12, 53, 60, 69] [3, 8, 13, 61, 70] [4, 14, 15, 62, 71] [0, 10, 15, 63, 72] [6, 11, 16, 64, 73] [7, 17, 18, 65, 74] [2, 13, 18, 66, 75] [9, 14, 19, 67, 76] [10, 20, 21, 68, 77] [5, 16, 21, 69, 78] [12, 17, 22, 70, 79] [13, 23, 24, 71, 80] [8, 19, 24, 72, 81] [15, 20, 25, 73, 82] [16, 26, 27, 74, 83] [11, 22, 27, 75, 84] [18, 23, 28, 76, 85] [19, 29, 30, 77, 86] [14, 25, 30, 78, 87] [21, 26, 31, 79, 88] [22, 32, 33, 80, 89] [17, 28, 33, 81, 90] [24, 29, 34, 82, 91] [25, 35, 36, 83, 92] [20, 31, 36, 84, 93] [27, 32, 37, 85, 94] [28, 38, 39, 86, 95] [23, 34, 39, 87, 96] [30, 35, 40, 88, 97] [31, 41, 42, 89, 98] [26, 37, 42, 90, 99] [33, 38, 43, 91, 100] [34, 44, 45, 92, 101] [29, 40, 45, 93, 102] [36, 41, 46, 94, 103] [37, 47, 48, 95, 104] [32, 43, 48, 96, 105] [39, 44, 49, 97, 106] [40, 50, 51, 98, 107] [35, 46, 51, 99, 108] [42, 47, 52, 100, 109] [43, 53, 54, 101, 110] [38, 49, 54, 102, 111] [45, 50, 55, 103, 112] [41, 52, 56, 105, 113]

H_Z (57 checks, sparse supports)

[0, 8, 57, 61, 72] [1, 10, 58, 63, 68] [2, 11, 59, 64, 75] [3, 12, 59, 60, 70] [4, 13, 61, 66, 71] [5, 14, 62, 67, 78] [6, 15, 62, 63, 73] [7, 16, 64, 69, 74] [8, 17, 65, 70, 81] [9, 18, 65, 66, 76] [10, 19, 67, 72, 77] [11, 20, 68, 73, 84] [12, 21, 68, 69, 79] [13, 22, 70, 75, 80] [14, 23, 71, 76, 87] [15, 24, 71, 72, 82] [16, 25, 73, 78, 83] [17, 26, 74, 79, 90] [18, 27, 74, 75, 85] [19, 28, 76, 81, 86] [20, 29, 77, 82, 93] [21, 30, 77, 78, 88] [22, 31, 79, 84, 89] [23, 32, 80, 85, 96] [24, 33, 80, 81, 91] [25, 34, 82, 87, 92] [26, 35, 83, 88, 99] [27, 36, 83, 84, 94] [28, 37, 85, 90, 95] [29, 38, 86, 91, 102] [30, 39, 86, 87, 97] [31, 40, 88, 93, 98] [32, 41, 89, 94, 105] [33, 42, 89, 90, 100] [34, 43, 91, 96, 101] [35, 44, 92, 97, 108] [36, 45, 92, 93, 103] [37, 46, 94, 99, 104] [38, 47, 95, 100, 111] [39, 48, 95, 96, 106] [40, 49, 97, 102, 107] [41, 50, 98, 103, 113] [42, 51, 98, 99, 109] [43, 52, 100, 105, 110] [44, 53, 60, 101, 106] [45, 54, 101, 102, 112] [46, 55, 57, 103, 108] [0, 47, 63, 104, 109] [48, 56, 58, 104, 105] [1, 49, 59, 106, 111] [2, 50, 66, 107, 112] [3, 51, 61, 107, 108] [4, 52, 62, 109, 113] [5, 53, 58, 69, 110] [6, 54, 64, 110, 111] [7, 55, 60, 65, 112] [9, 56, 57, 67, 113]

Code ID 114-4-11 · download JSON · raw on GitHub