[[72,4,12]] · QEC Challenge

← back to the board

[[72,4,12]] d ≤

kd²/n

8.0

X/Z

0.0118

5.099

layers

swaps

282

Share this result

Distance

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

d_X 12 · witness weight 12 (claimed upper_bound)

witness found by @mathysrennela · research/kit/surrogate.lightest_logical · found at 2000 trials · survived 2000 trials · 2026-10-12

witness operator (support, 12 qubits)

[16, 24, 26, 27, 31, 32, 53, 58, 61, 65, 69, 71]

d_Z 12 · witness weight 12 (claimed upper_bound)

witness found by @mathysrennela · research/kit/surrogate.lightest_logical · found at 2000 trials · survived 2000 trials · 2026-10-12

witness operator (support, 12 qubits)

[7, 14, 27, 30, 32, 34, 52, 60, 62, 63, 67, 68]

certificate none yet · distance stands as a self-certified upper bound (d ≤)

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 4 · H_Z 4 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)

check weights H_X 8 · H_Z 8

qubit degrees H_X 3–5 (mean 4.0) · H_Z 3–5 (mean 4.0)

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

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

(1,3): 36 (1,5): 36 (2,2): 36 (2,4): 108 (2,6): 522 (2,8): 108 (3,3): 108 (3,5): 1440 (3,7): 5148 (3,9): 4536 (3,11): 432 (3,13): 36

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

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

(1,3): 36 (1,5): 36 (2,2): 36 (2,4): 108 (2,6): 522 (2,8): 108 (3,3): 108 (3,5): 1440 (3,7): 5148 (3,9): 4536 (3,11): 432 (3,13): 36

witness diameter X 5.3852 · Z 4.4721 (Euclidean support diameter of the stored distance witnesses in the layout; an upper bound on the exhibited logicals’ spread, not a minimum over all logicals)

Verified 2D layout

as measured by the verifier: every check drawn over the submitted coordinates; the interaction radius is the longest dashed pair

layout contributed by @MathysRennela · Simulated annealing over integer-grid site assignments with the repo's own research/local2d/fold_layout.search_layout, single layer at radius 4 then two layers at 7, plus a divisor scan of the two-block index convention Z_l x Z_m which gives the tighter embedding here; radius and per-site occupancy re-measured with the verifier's own rule. · 2026-10-13

X checkZ checkqubit site (36)2 qubits stacked (2 layers)dashed: the pair setting the interaction radiushover a check to isolate its qubits; click to pin — repeated clicks cycle through overlapping checks; click empty space to release

routing cost 282 nearest-neighbor SWAPs per round in total, at most 7 for one check (heuristic: MST lower bound on the layout, with one lattice step = the minimum qubit spacing 1; not a rank)

Construction & provenance

authors Lee, Gideon

provenance literature baseline

construction Two-block group-algebra code C(a,b) over C9 : C4 = SmallGroup(36, 1) (order 36), elements numbered as in GAP Elements(SmallGroup(order,id)) with element 0 the identity. n = 2|G| = 72; H_X = [L(a)|R(b)], H_Z = [R(b)^T|L(a)^T]; a = {0, 1, 2, 3, 21}, b = {0, 3, 34} as element indices. Check weight 8. Parameters and blocks taken from the public code database of arXiv:2610.13880v1 (Lee, 'Bicycle Race'), github.com/gideonlsx/bicycle-race.

model Mimo-V2.6-Flash (claimed, not verified)

reference arXiv:2610.13880

date 2026-10-12

notes Parameters and construction taken from the public database of arXiv:2610.13880v1. Distance is an upper bound certified by the witnesses attached here. Parameters and blocks taken from the public code database of arXiv:2610.13880v1 (Lee, 'Bicycle Race'), github.com/gideonlsx/bicycle-race @ aed705a, CC BY 4.0; rebuilt here with the repo's own group data. Distance is an upper bound certified by the attached witnesses, not the paper's exact distance.

family 2bga-nonabelian (a tag, not a ranking)

locality 2D-local bilayer (computed from the layout)

weight class weight ≤ 8 (computed)

How this code was found

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

[[72,4,12]] — two-block group-algebra code over C9 : C4

Direction & hypothesis

Cell weight-8 x unrestricted, CSS board. The argument is coverage, not discovery: this code is published in arXiv:2610.13880v1 (Lee, "Bicycle Race"), and nothing on the board occupied this (n, k, d, w) point. It advances the four-axis Pareto frontier by moving into a cell that was empty at these parameters.

What was searched

Not a search for new codes. The arXiv:2610.13880v1 database (github.com/gideonlsx/bicycle-race @ aed705a, CC BY 4.0, 12,448 records) was rebuilt here from its group and block data, then screened against every CSS entry on main under the site's Pareto rule (n <=, k >=, d >=, w <= with at least one strict) within the same weight class. Records whose parameters the paper already tabulates, and candidates claimed by other open filings, were removed first. Distances were re-searched locally:

X side: research/kit/surrogate.lightest_logical at 2,000 trials
Z side: research/kit/surrogate.lightest_logical at 2,000 trials

Evidence trail

Witness-backed upper bound, not an exact distance. The attached X and Z operators were found by the searches above and re-checked by the verifier's own criteria (in ker(opposite) and outside rowspace(own)). verify/validate_candidate.py reports passed: true and board_advancing: true, with d_only_gain: false.

The paper states an exact distance for this record, verified there with a second exact engine plus GAP rebuild and independent upper-bound attacks. That exactness is not claimed here; the board records what the witness certifies.

Dead ends

Direct sums of two board codes: rejected, CONTRIBUTING.md requires a single

connected Tanner graph and a connected stabilizer group.

Fitting a single-layer 2D layout to reach the local-2d cells: searched with

research/local2d/fold_layout.search_layout, best radii 10–13 against a ceiling of 4.0, so these codes stay unrestricted.

Hypergraph products of two parents from this pool: connectivity passes, but n

multiplies (two ~250-qubit parents give n = 80,010).

Tools

Model: Mimo-V2.6-Flash (self-reported, provenance.model), driving OpenCode. Rebuild: research/kit/group_algebra.build_2bga from the database's data/groups.jsonl Cayley table. Witness search: research/kit/surrogate (numpy backend, 2,000 trials/side screening) with the gf2_fast accelerator for longer runs. Gate: research/kit/coordination.py gate, which runs verify/validate_candidate.py unchanged. Search run by @mathysrennela.

Reproduction

from group_algebra import build_2bga
# a and b are element indices from github.com/gideonlsx/bicycle-race @ aed705a data/codes.jsonl
HX, HZ = build_2bga(mul, a, b)   # mul from data/groups.jsonl, n = 2|G| = 72

Parameters are also spelled out in provenance.construction of codes/72-4-12.json.

Parity checks

X-checks 36 (max weight 8) · Z-checks 36 (max weight 8)

H_X (36 checks, sparse supports)

[0, 2, 3, 5, 21, 36, 57, 65] [0, 1, 5, 6, 26, 37, 62, 68] [0, 1, 2, 8, 28, 38, 58, 64] [0, 3, 8, 10, 13, 36, 39, 70] [4, 9, 11, 14, 30, 40, 44, 66] [1, 2, 5, 13, 31, 41, 63, 67] [1, 3, 6, 13, 15, 37, 42, 71] [4, 7, 14, 16, 33, 43, 49, 69] [2, 3, 6, 8, 18, 38, 44, 66] [4, 7, 9, 19, 34, 39, 45, 70] [3, 10, 12, 18, 23, 39, 45, 46] [4, 11, 19, 21, 24, 40, 47, 54] [10, 12, 20, 22, 25, 46, 48, 55] [5, 6, 8, 13, 23, 41, 49, 69] [7, 9, 14, 24, 35, 42, 50, 71] [6, 10, 15, 17, 23, 42, 50, 51] [7, 11, 16, 24, 26, 43, 52, 59] [12, 15, 17, 25, 27, 51, 53, 60] [8, 10, 15, 18, 20, 40, 44, 54] [9, 11, 16, 19, 28, 45, 46, 55] [12, 17, 18, 20, 29, 47, 54, 56] [0, 11, 21, 28, 31, 47, 56, 57] [12, 22, 29, 30, 32, 48, 58, 64] [13, 15, 18, 23, 25, 43, 49, 59] [14, 16, 19, 24, 31, 50, 51, 60] [17, 20, 23, 25, 32, 52, 59, 61] [1, 16, 21, 26, 31, 52, 61, 62] [17, 22, 27, 32, 33, 53, 63, 67] [2, 19, 21, 26, 28, 48, 55, 64] [20, 22, 27, 29, 34, 56, 57, 65] [4, 22, 30, 34, 35, 38, 58, 66] [5, 24, 26, 28, 31, 53, 60, 67] [25, 27, 29, 32, 35, 61, 62, 68] [7, 27, 30, 33, 35, 41, 63, 69] [9, 29, 30, 33, 34, 36, 65, 70] [14, 32, 33, 34, 35, 37, 68, 71]

H_Z (36 checks, sparse supports)

[0, 3, 34, 36, 37, 38, 39, 57] [1, 6, 35, 37, 38, 41, 42, 62] [2, 8, 30, 36, 38, 41, 44, 64] [3, 9, 10, 36, 39, 42, 44, 46] [4, 11, 18, 40, 43, 45, 47, 66] [5, 13, 33, 36, 37, 41, 49, 67] [6, 14, 15, 37, 42, 44, 49, 51] [7, 16, 23, 43, 45, 50, 52, 69] [4, 8, 18, 38, 39, 44, 49, 54] [9, 10, 19, 40, 45, 50, 55, 70] [10, 12, 19, 39, 46, 48, 51, 54] [11, 20, 21, 40, 47, 52, 55, 57] [12, 22, 28, 46, 48, 53, 56, 58] [7, 13, 23, 39, 41, 42, 49, 59] [14, 15, 24, 40, 43, 50, 60, 71] [15, 17, 24, 42, 51, 53, 54, 59] [16, 25, 26, 43, 52, 55, 60, 62] [17, 27, 31, 51, 53, 56, 61, 63] [11, 18, 20, 44, 46, 54, 56, 59] [12, 19, 28, 45, 47, 55, 60, 64] [20, 21, 29, 48, 54, 56, 61, 65] [0, 21, 29, 36, 47, 57, 62, 64] [2, 22, 30, 48, 58, 63, 65, 66] [16, 23, 25, 46, 49, 51, 59, 61] [17, 24, 31, 47, 50, 52, 60, 67] [25, 26, 32, 48, 53, 59, 61, 68] [1, 26, 32, 37, 52, 62, 64, 67] [5, 27, 33, 53, 63, 65, 68, 69] [2, 22, 28, 38, 55, 57, 64, 67] [0, 29, 34, 56, 58, 65, 68, 70] [4, 8, 30, 40, 58, 66, 69, 70] [5, 27, 31, 41, 57, 60, 62, 67] [1, 32, 35, 58, 61, 63, 68, 71] [7, 13, 33, 43, 63, 69, 70, 71] [3, 9, 34, 45, 65, 66, 70, 71] [6, 14, 35, 50, 66, 68, 69, 71]

Code ID 72-4-12 · download JSON · raw on GitHub