[[48,10,6]] · QEC Challenge

← back to the board

[[48,10,6]] d =

kd²/n

7.5

X/Z

0.0111

5.099

layers

swaps

158

Share this result

Distance

X/Z asymmetry 1 · d_X = 6, d_Z = 6 · 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 6 · witness weight 6 (claimed upper_bound)

witness operator (support, 6 qubits)

[3, 15, 29, 31, 41, 43]

d_Z 6 · witness weight 6 (claimed upper_bound)

witness operator (support, 6 qubits)

[1, 3, 26, 30, 41, 46]

certificate exact, d = 6 · scipy/HiGHS MILP

X: no logical < 6 exists; Z: no logical < 6 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 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 4 · H_Z 4

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

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

(1,4): 48 (2,4): 72 (2,6): 528 (3,4): 240 (3,6): 2432 (3,8): 5904 (3,10): 576

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

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

(1,4): 48 (2,4): 72 (2,6): 528 (3,4): 240 (3,6): 2432 (3,8): 5904 (3,10): 576

witness diameter X 4.4721 · Z 5.3852 (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 sites (research/local2d/fold_layout.py) · 2026-09-19

X checkZ checkqubit site (24)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 158 nearest-neighbor SWAPs per round in total, at most 8 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 @mathysrennela

provenance submitted through the challenge

novelty novelty not audited

construction Coprime BB on Z_3xZ_8, bivariate A=[(0, 0), (1, 1), (0, 3), (1, 2)], B=[(0, 0), (0, 3), (1, 7), (1, 0)]

model MiMo V2.5 (claimed, not verified)

date 2026-09-15

family bivariate 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

[[48,10,6]] — from arXiv:2408.10001v6

Direction & hypothesis

Reconstructed from arXiv:2408.10001v6 (Wang & Mueller, 2026). Board-advancing code.

Evidence trail

RIS distance surrogate: d<=6 (both X and Z sides)
Witnesses confirmed by verifier's criteria

Tools

Source: arXiv:2408.10001v6
Verification: verify/validate_candidate.py

Parity checks

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

H_X (24 checks, sparse supports)

[0, 1, 3, 10, 24, 27, 31, 40] [1, 2, 4, 11, 25, 28, 32, 41] [2, 3, 5, 12, 26, 29, 33, 42] [3, 4, 6, 13, 27, 30, 34, 43] [4, 5, 7, 14, 28, 31, 35, 44] [5, 6, 8, 15, 29, 32, 36, 45] [6, 7, 9, 16, 30, 33, 37, 46] [7, 8, 10, 17, 31, 34, 38, 47] [8, 9, 11, 18, 24, 32, 35, 39] [9, 10, 12, 19, 25, 33, 36, 40] [10, 11, 13, 20, 26, 34, 37, 41] [11, 12, 14, 21, 27, 35, 38, 42] [12, 13, 15, 22, 28, 36, 39, 43] [13, 14, 16, 23, 29, 37, 40, 44] [0, 14, 15, 17, 30, 38, 41, 45] [1, 15, 16, 18, 31, 39, 42, 46] [2, 16, 17, 19, 32, 40, 43, 47] [3, 17, 18, 20, 24, 33, 41, 44] [4, 18, 19, 21, 25, 34, 42, 45] [5, 19, 20, 22, 26, 35, 43, 46] [6, 20, 21, 23, 27, 36, 44, 47] [0, 7, 21, 22, 24, 28, 37, 45] [1, 8, 22, 23, 25, 29, 38, 46] [0, 2, 9, 23, 26, 30, 39, 47]

H_Z (24 checks, sparse supports)

[0, 8, 17, 21, 24, 38, 45, 47] [1, 9, 18, 22, 24, 25, 39, 46] [2, 10, 19, 23, 25, 26, 40, 47] [0, 3, 11, 20, 24, 26, 27, 41] [1, 4, 12, 21, 25, 27, 28, 42] [2, 5, 13, 22, 26, 28, 29, 43] [3, 6, 14, 23, 27, 29, 30, 44] [0, 4, 7, 15, 28, 30, 31, 45] [1, 5, 8, 16, 29, 31, 32, 46] [2, 6, 9, 17, 30, 32, 33, 47] [3, 7, 10, 18, 24, 31, 33, 34] [4, 8, 11, 19, 25, 32, 34, 35] [5, 9, 12, 20, 26, 33, 35, 36] [6, 10, 13, 21, 27, 34, 36, 37] [7, 11, 14, 22, 28, 35, 37, 38] [8, 12, 15, 23, 29, 36, 38, 39] [0, 9, 13, 16, 30, 37, 39, 40] [1, 10, 14, 17, 31, 38, 40, 41] [2, 11, 15, 18, 32, 39, 41, 42] [3, 12, 16, 19, 33, 40, 42, 43] [4, 13, 17, 20, 34, 41, 43, 44] [5, 14, 18, 21, 35, 42, 44, 45] [6, 15, 19, 22, 36, 43, 45, 46] [7, 16, 20, 23, 37, 44, 46, 47]

Code ID 48-10-6 · download JSON · raw on GitHub