← back to the board
[[41,19,3]] d ≤
n
41
k
19
d
3
kd²/n
4.171
w
21
X/Z
1
g
0.003
r
6.0828
layers
2
swaps
8

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 3, d_Z ≤ 3 · w_X = 21, w_Z = 20 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)
d_X 3 · witness weight 3 (claimed upper_bound)
witness operator (support, 3 qubits)
[9, 18, 22]
d_Z 3 · witness weight 3 (claimed upper_bound)
witness operator (support, 3 qubits)
[1, 9, 13]
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 18–21 (mean 19.333) · H_Z 16–20 (mean 17.6)
qubit degrees H_X 1–9 (mean 5.659) · H_Z 1–8 (mean 4.293)
trapping sets H_X (1,1)×4 (2,1)×10 (3,0)×14 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 4 (1,2): 2 (1,3): 3 (1,4): 4 (1,5): 3 (1,6): 3 (1,7): 13 (1,8): 6 (1,9): 3 (2,1): 10 (2,2): 22 (2,3): 29 (2,4): 53 (2,5): 90 (2,6): 197 (2,7): 177 (2,8): 101 (2,9): 30 (3,0): 14 (3,1): 117 (3,2): 226 (3,3): 459 (3,4): 952 (3,5): 1653 (3,6): 2245 (3,7): 2235 (3,8): 1320 (3,9): 369 (3,10): 44
trapping sets H_Z (1,1)×4 (2,1)×11 (3,0)×6 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 4 (1,2): 2 (1,3): 8 (1,4): 7 (1,5): 9 (1,6): 7 (1,7): 3 (1,8): 1 (2,1): 11 (2,2): 29 (2,3): 81 (2,4): 148 (2,5): 188 (2,6): 134 (2,7): 65 (2,8): 18 (2,9): 1 (3,0): 6 (3,1): 92 (3,2): 479 (3,3): 1124 (3,4): 1934 (3,5): 2253 (3,6): 1902 (3,7): 1022 (3,8): 327 (3,9): 65 (3,10): 3
witness diameter X 5.3852 · Z 2.8284 (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 @dorakingx · Simulated annealing over site assignments on an integer grid with the repo's own research/local2d/fold_layout.search_layout (max-diameter objective, several bounding boxes and seeds); single layer at radius 4 tried first, then two layers at 7. Radius and per-site occupancy re-measured with the verifier's rule. · 2026-10-02
r = 6.083
X checkZ checkqubit site (21)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 8 nearest-neighbor SWAPs per round in total, at most 2 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 @vprusso
provenance submitted through the challenge
novelty known parameter set; see provenance notes
construction Check deletion from the board entry [[41,17,3]] (codes/41-17-3.json): rows [6, 10] of H_Z removed. Dropping two independent stabiliser generators frees two logical qubits and cannot raise the distance.
model Claude Claude Opus 5 (claimed, not verified)
date 2026-09-21
notes Found by sweeping every single-row deletion of every small board entry and keeping those that land undominated. The parent's remaining checks are unchanged.
family check-deletion (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

[[41,19,3]] by two-row check deletion from 41-17-3

Hypothesis

Every stabiliser generator costs one logical qubit, so dropping two independent generators returns k + 2 on the same n physical qubits at a distance that can only fall.

Whether the trade is worth taking

Usually not. Across 5,033 pair deletions of board entries, 12.5% kept a distance of 3 or more, against 40% for single-row deletion on the same parents. Dropping a second generator costs far more distance than the first. This code is one of the few where it lands undominated anyway, in a k + 2 region of its cell that nothing on the board covers.

Construction

Parent: codes/41-17-3.json. Rows [6, 10] of H_Z are removed; every other check is untouched. The pair is checked for independence (the rank must fall by exactly two) and the result for Tanner connectivity before anything else runs.

Distance

Two-sided random information-set search, then the heavier side on its own in the quotient ker(H_opposite) / rowspace(H_own), since a two-sided search returns the minimum over both sides and never surfaces the heavier one. Deleting rows leaves H_X and H_Z with different shapes, so every witness is classified by the conditions it actually satisfies rather than by the search's argument order.

Boundary

Distance is an upper bound from witness search, not a proof. The parent's own distance claim is inherited context. Literature novelty is unverified.

Parity checks

X-checks 12 (max weight 21) · Z-checks 10 (max weight 20)
H_X (12 checks, sparse supports)
[0, 1, 3, 5, 6, 7, 8, 10, 12, 13, 16, 17, 18, 19, 21, 23, 25, 26, 29, 40] [0, 1, 2, 4, 5, 6, 7, 9, 11, 12, 15, 16, 17, 18, 20, 22, 24, 25, 28, 39, 40] [0, 3, 4, 5, 6, 8, 10, 11, 15, 16, 17, 19, 21, 23, 24, 27, 38, 39, 40] [1, 2, 3, 4, 5, 7, 9, 10, 14, 15, 16, 18, 20, 22, 23, 26, 37, 38, 39, 40] [0, 2, 3, 4, 6, 8, 9, 13, 14, 15, 17, 19, 21, 22, 25, 36, 37, 38, 39] [1, 2, 3, 5, 7, 8, 12, 13, 14, 16, 18, 20, 21, 24, 36, 37, 38, 40] [0, 1, 2, 4, 6, 7, 11, 12, 13, 14, 15, 17, 19, 20, 23, 35, 36, 37, 39] [0, 1, 3, 5, 6, 10, 11, 12, 13, 16, 18, 19, 22, 34, 35, 36, 38, 40] [0, 1, 2, 4, 5, 9, 10, 11, 12, 14, 15, 17, 18, 21, 33, 34, 35, 37, 39, 40] [0, 3, 4, 8, 9, 10, 11, 13, 16, 17, 20, 32, 33, 34, 35, 36, 38, 39, 40] [1, 2, 3, 7, 8, 9, 10, 12, 14, 15, 16, 19, 31, 32, 33, 34, 37, 38, 39, 40] [0, 2, 6, 7, 8, 9, 11, 13, 15, 18, 30, 31, 32, 33, 35, 36, 37, 38, 39]
H_Z (10 checks, sparse supports)
[0, 3, 6, 11, 15, 16, 17, 19, 21, 27, 34, 35, 36, 37, 39, 40] [0, 1, 2, 6, 10, 11, 12, 14, 15, 16, 18, 20, 22, 23, 26, 40] [0, 1, 5, 6, 7, 9, 10, 11, 12, 17, 19, 21, 22, 23, 24, 25, 34, 35, 36, 37] [1, 2, 7, 8, 10, 13, 16, 18, 19, 22, 23, 34, 37, 38, 39, 40] [0, 6, 8, 9, 11, 12, 13, 14, 16, 17, 18, 21, 24, 28, 30, 33, 35, 36, 39, 40] [0, 4, 10, 11, 12, 13, 17, 20, 23, 28, 30, 33, 34, 35, 38, 39] [0, 1, 2, 3, 6, 10, 13, 14, 15, 16, 17, 23, 24, 28, 30, 32, 35, 36, 37, 40] [0, 1, 3, 5, 6, 7, 8, 10, 12, 24, 30, 31, 32, 34, 35, 40] [0, 2, 4, 5, 6, 7, 9, 10, 11, 13, 15, 18, 23, 24, 30, 31, 32, 33, 34, 39] [1, 2, 3, 5, 7, 9, 15, 18, 24, 28, 29, 31, 32, 35, 38, 39]
Code ID 41-19-3 · download JSON · raw on GitHub