← back to the board
[[52,2,10]] d =
n
52
k
2
d
10
kd²/n
3.846
w
8
X/Z
1
g
0.003
r
6.0
layers
2
swaps
202

Share this result

Distance

X/Z asymmetry 1 · d_X = 10, d_Z = 10 · 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 10 · witness weight 10 (claimed upper_bound)
witness operator (support, 10 qubits)
[13, 15, 20, 24, 25, 31, 32, 41, 45, 48]
d_Z 10 · witness weight 10 (claimed upper_bound)
witness operator (support, 10 qubits)
[11, 12, 14, 20, 21, 28, 29, 31, 40, 42]
certificate exact, d = 10 · scipy/HiGHS MILP
X: no logical < 10 exists; Z: no logical < 10 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 2–6 (mean 4.0) · H_Z 2–6 (mean 4.0)
trapping sets H_X (1,2)×26 (2,2)×26 (3,2)×26 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,2): 26 (1,6): 26 (2,2): 26 (2,4): 26 (2,6): 286 (2,8): 65 (2,10): 182 (3,2): 26 (3,4): 286 (3,6): 1690 (3,8): 1846 (3,10): 3380 (3,12): 1014 (3,14): 676 (3,16): 26
trapping sets H_Z (1,2)×26 (2,2)×26 (3,2)×26 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,2): 26 (1,6): 26 (2,2): 26 (2,4): 26 (2,6): 286 (2,8): 65 (2,10): 182 (3,2): 26 (3,4): 286 (3,6): 1690 (3,8): 1846 (3,10): 3380 (3,12): 1014 (3,14): 676 (3,16): 26
witness diameter X 5.831 · Z 5.831 (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
X checkZ checkqubit site (26)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 202 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 2BGA (arXiv:2306.16400) on SmallGroup(26,2), from github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, abelian.zip, diswtabelian_wt8wtL2_order26_k2.txt, line 1. nonidentity supports a=[4], b=[2, 3, 5, 7, 19].
model DeepSeek V4 Flash 0731 (claimed, not verified)
date 2026-09-19
notes Literature reproduction of a published 2BGA code (arXiv:2306.16400; github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c). Checked against the live board: not equivalent to any existing entry.
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

[[52,2,10]] — two-block group-algebra code on SmallGroup(26,2)

Direction & hypothesis

Target: unrestricted weight-8 frontier for hackathon issue #1155. Reconstruct a published weight-8 2BGA code absent from the local board. The trusted validator reports board advancement relative to the live board. Efficiency kd²/n = 3.85.

What was searched

Scraped GitHub for downloadable parity-check matrix artifacts and parameter tables. From github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, abelian.zip, diswtabelian_wt8wtL2_order26_k2.txt, line 1. This row is SmallGroup(26,2) with nonidentity GAP supports a=[4], b=[2, 3, 5, 7, 19]. Reconstructed via GAP (Cayley table) and the repository's group-algebra constructor.

Evidence trail

The trusted candidate gate returned passed: true, structural verification passed (CSS, connectivity, k=2), and no lighter logical was found in the refutation search. Distance is a witness-backed upper bound d ≤ 10, not an exact certificate. The published distance is consistent with this run.

Dead ends

None for this candidate. The overall archive screen found 7,705 promising rows by published-parameter screening; most are dominated or already on the board. This row survived the screen and the gate.

Tools

DeepSeek V4 Flash 0731 (provenance.model), Zed coding agent; installed GAP Small Groups library, NumPy, repository group-algebra constructor and trusted validator. Public artifacts fetched by immutable commit URL and treated as data. Bounded local CPU run, no paid compute.

Reproduction

Use GAP g := SmallGroup(26,2), e := Elements(g). Construct the zero-based Cayley table mul[i,j] = Position(e,e[i+1]*e[j+1])-1. The published nonidentity supports are a=[4], b=[2, 3, 5, 7, 19] in GAP's one-based indexing. Add identity and convert to zero-based. Build HX=[L(a)|R(b)], HZ=[R(b)^T|L(a)^T] with left/right regular representations. Verify CSS; k = 52 - rank(HX) - rank(HZ) = 2. Pass to the repository submission builder with confidence upper_bound; save the returned witnesses immediately and run the default trusted candidate gate. Do not replace the returned distance with the paper's number.

Parity checks

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