[[84,4,13]] · QEC Challenge

← back to the board

[[84,4,13]] d ≤

kd²/n

8.048

X/Z

0.0048

6.4031

layers

swaps

569

Share this result

Distance

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

d_X 13 · witness weight 13 (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, 13 qubits)

[5, 15, 16, 17, 24, 25, 36, 52, 56, 57, 58, 61, 64]

d_Z 13 · witness weight 13 (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, 13 qubits)

[1, 19, 24, 27, 29, 34, 42, 43, 55, 59, 62, 68, 72]

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 9 · H_Z 9

qubit degrees H_X 4–5 (mean 4.5) · H_Z 4–5 (mean 4.5)

trapping sets H_X (1,4)×42 (2,5)×126 (3,5)×168 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

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

(1,4): 42 (1,5): 42 (2,5): 126 (2,6): 273 (2,7): 588 (2,8): 378 (3,5): 168 (3,6): 546 (3,7): 2562 (3,8): 4956 (3,9): 7910 (3,10): 9240 (3,11): 3864 (3,12): 672 (3,13): 294

trapping sets H_Z (1,4)×42 (2,5)×126 (3,5)×168 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

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

(1,4): 42 (1,5): 42 (2,5): 126 (2,6): 273 (2,7): 588 (2,8): 378 (3,5): 168 (3,6): 546 (3,7): 2562 (3,8): 4956 (3,9): 7910 (3,10): 9240 (3,11): 3864 (3,12): 672 (3,13): 294

witness diameter X 6.3246 · 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 (44)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 569 nearest-neighbor SWAPs per round in total, at most 12 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 C42 = SmallGroup(42, 6) (order 42), elements numbered as in GAP Elements(SmallGroup(order,id)) with element 0 the identity. n = 2|G| = 84; H_X = [L(a)|R(b)], H_Z = [R(b)^T|L(a)^T]; a = {0, 1, 2, 3, 27}, b = {0, 5, 16, 37} as element indices. Check weight 9. 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 generalized bicycle (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

[[84,4,13]] — two-block group-algebra code over C42

Direction & hypothesis

Cell weight-9plus 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| = 84

Parameters are also spelled out in provenance.construction of codes/84-4-13.json.

Parity checks

X-checks 42 (max weight 9) · Z-checks 42 (max weight 9)

H_X (42 checks, sparse supports)

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

H_Z (42 checks, sparse supports)

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

Code ID 84-4-13 · download JSON · raw on GitHub