← back to the board
[[30,10,3]] d =
n
30
k
10
d
3
kd²/n
3.0
w
6
X/Z
1
g
0.0469
r
4.0
layers
1
swaps
32

Share this result

Distance

X/Z asymmetry 1 · d_X = 3, d_Z = 3 · w_X = 6, w_Z = 6 (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)
[0, 15, 26]
d_Z 3 · witness weight 3 (claimed upper_bound)
witness operator (support, 3 qubits)
[26, 28, 29]
certificate exact, d = 3 · scipy/HiGHS MILP
X: no logical < 3 exists; Z: no logical < 3 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 6 · H_Z 6
qubit degrees H_X 2–4 (mean 3.0) · H_Z 2–4 (mean 3.0)
trapping sets H_X (1,2)×15 (2,2)×45 (3,0)×25 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,2): 15 (1,4): 15 (2,2): 45 (2,4): 90 (2,6): 30 (3,0): 25 (3,2): 150 (3,4): 375 (3,6): 345 (3,8): 60
trapping sets H_Z (1,2)×15 (2,2)×45 (3,0)×25 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,2): 15 (1,4): 15 (2,2): 45 (2,4): 90 (2,6): 30 (3,0): 25 (3,2): 150 (3,4): 375 (3,6): 345 (3,8): 60
witness diameter X 3.1623 · Z 2.2361 (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-09-26
r = 4
X checkZ checkqubit site (30)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 32 nearest-neighbor SWAPs per round in total, at most 3 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(15,1), from github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, abelian.zip, diswtabelian_wt6wtL2_order15_k10.txt, line 1. nonidentity supports a=[2], b=[2, 3, 5].
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 single (computed from the layout)
weight class weight ≤ 6 (computed)

How this code was found

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

[[30,10,3]] — two-block group-algebra code on SmallGroup(15,1)

Direction & hypothesis

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

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_wt6wtL2_order15_k10.txt, line 1. This row is SmallGroup(15,1) with nonidentity GAP supports a=[2], b=[2, 3, 5]. 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=10), and no lighter logical was found in the refutation search. Distance is a witness-backed upper bound d ≤ 3, not an exact certificate. The published distance (d=3) 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(15,1), 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=[2], b=[2, 3, 5] 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 = 30 - rank(HX) - rank(HZ) = 10. 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 15 (max weight 6) · Z-checks 15 (max weight 6)
H_X (15 checks, sparse supports)
[0, 3, 15, 18, 26, 29] [0, 1, 15, 16, 26, 28] [2, 6, 15, 17, 18, 21] [1, 3, 16, 18, 28, 29] [2, 4, 15, 16, 17, 19] [5, 9, 17, 20, 21, 24] [4, 6, 16, 18, 19, 21] [5, 7, 17, 19, 20, 22] [8, 12, 20, 23, 24, 27] [7, 9, 19, 21, 22, 24] [8, 10, 20, 22, 23, 25] [11, 14, 23, 26, 27, 29] [10, 12, 22, 24, 25, 27] [11, 13, 23, 25, 26, 28] [13, 14, 25, 27, 28, 29]
H_Z (15 checks, sparse supports)
[0, 1, 2, 4, 15, 16] [1, 3, 4, 6, 16, 18] [2, 4, 5, 7, 17, 19] [0, 2, 3, 6, 15, 18] [4, 6, 7, 9, 19, 21] [5, 7, 8, 10, 20, 22] [2, 5, 6, 9, 17, 21] [7, 9, 10, 12, 22, 24] [8, 10, 11, 13, 23, 25] [5, 8, 9, 12, 20, 24] [10, 12, 13, 14, 25, 27] [0, 1, 11, 13, 26, 28] [8, 11, 12, 14, 23, 27] [1, 3, 13, 14, 28, 29] [0, 3, 11, 14, 26, 29]
Code ID 30-10-3 · download JSON · raw on GitHub