← back to the board
[[100,50,2]] d =
n
100
k
50
d
2
kd²/n
2.0
w
6
X/Z
1
g
0.02
r
3.1623
layers
2
swaps
92

Share this result

Distance

X/Z asymmetry 1 · d_X = 2, d_Z = 2 · 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 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[40, 43]
d_Z 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[50, 51]
certificate exact, d = 2 · scipy/HiGHS MILP
X: no logical < 2 exists; Z: no logical < 2 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)×50 (2,0)×50 (3,0)×200 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,2): 50 (1,4): 50 (2,0): 50 (2,2): 200 (2,4): 100 (3,0): 200 (3,2): 500 (3,4): 400 (3,6): 200
trapping sets H_Z (1,2)×50 (2,0)×50 (3,0)×200 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,2): 50 (1,4): 50 (2,0): 50 (2,2): 200 (2,4): 100 (3,0): 200 (3,2): 500 (3,4): 400 (3,6): 200
witness diameter X 1.0 · Z 1.0 (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
r = 3.162
X checkZ checkqubit site (53)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 92 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(50,2), from github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, abelian.zip, diswtabelian_wt6wtL2_order50_k50.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 bilayer (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

[[100,50,2]] — two-block group-algebra code on SmallGroup(50,2)

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 = 2.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_order50_k50.txt, line 1. This row is SmallGroup(50,2) 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=50), and no lighter logical was found in the refutation search. Distance is a witness-backed upper bound d ≤ 2, not an exact certificate. The published distance (d=2) 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(50,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=[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 = 100 - rank(HX) - rank(HZ) = 50. 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 50 (max weight 6) · Z-checks 50 (max weight 6)
H_X (50 checks, sparse supports)
[0, 1, 50, 51, 98, 99] [0, 1, 50, 51, 98, 99] [2, 4, 50, 51, 52, 54] [3, 5, 53, 55, 70, 75] [2, 4, 50, 51, 52, 54] [3, 5, 53, 55, 70, 75] [6, 9, 52, 54, 56, 59] [7, 10, 53, 55, 57, 60] [8, 11, 58, 61, 80, 84] [6, 9, 52, 54, 56, 59] [7, 10, 53, 55, 57, 60] [8, 11, 58, 61, 80, 84] [12, 16, 56, 59, 62, 66] [13, 17, 57, 60, 63, 67] [14, 18, 58, 61, 64, 68] [15, 19, 65, 69, 88, 91] [12, 16, 56, 59, 62, 66] [13, 17, 57, 60, 63, 67] [14, 18, 58, 61, 64, 68] [15, 19, 65, 69, 88, 91] [20, 25, 62, 66, 70, 75] [21, 26, 63, 67, 71, 76] [22, 27, 64, 68, 72, 77] [23, 28, 65, 69, 73, 78] [24, 29, 74, 79, 94, 96] [20, 25, 62, 66, 70, 75] [21, 26, 63, 67, 71, 76] [22, 27, 64, 68, 72, 77] [23, 28, 65, 69, 73, 78] [24, 29, 74, 79, 94, 96] [30, 34, 71, 76, 80, 84] [31, 35, 72, 77, 81, 85] [32, 36, 73, 78, 82, 86] [33, 37, 74, 79, 83, 87] [30, 34, 71, 76, 80, 84] [31, 35, 72, 77, 81, 85] [32, 36, 73, 78, 82, 86] [33, 37, 74, 79, 83, 87] [38, 41, 81, 85, 88, 91] [39, 42, 82, 86, 89, 92] [40, 43, 83, 87, 90, 93] [38, 41, 81, 85, 88, 91] [39, 42, 82, 86, 89, 92] [40, 43, 83, 87, 90, 93] [44, 46, 89, 92, 94, 96] [45, 47, 90, 93, 95, 97] [44, 46, 89, 92, 94, 96] [45, 47, 90, 93, 95, 97] [48, 49, 95, 97, 98, 99] [48, 49, 95, 97, 98, 99]
H_Z (50 checks, sparse supports)
[0, 1, 2, 4, 50, 51] [0, 1, 2, 4, 50, 51] [2, 4, 6, 9, 52, 54] [3, 5, 7, 10, 53, 55] [2, 4, 6, 9, 52, 54] [3, 5, 7, 10, 53, 55] [6, 9, 12, 16, 56, 59] [7, 10, 13, 17, 57, 60] [8, 11, 14, 18, 58, 61] [6, 9, 12, 16, 56, 59] [7, 10, 13, 17, 57, 60] [8, 11, 14, 18, 58, 61] [12, 16, 20, 25, 62, 66] [13, 17, 21, 26, 63, 67] [14, 18, 22, 27, 64, 68] [15, 19, 23, 28, 65, 69] [12, 16, 20, 25, 62, 66] [13, 17, 21, 26, 63, 67] [14, 18, 22, 27, 64, 68] [15, 19, 23, 28, 65, 69] [3, 5, 20, 25, 70, 75] [21, 26, 30, 34, 71, 76] [22, 27, 31, 35, 72, 77] [23, 28, 32, 36, 73, 78] [24, 29, 33, 37, 74, 79] [3, 5, 20, 25, 70, 75] [21, 26, 30, 34, 71, 76] [22, 27, 31, 35, 72, 77] [23, 28, 32, 36, 73, 78] [24, 29, 33, 37, 74, 79] [8, 11, 30, 34, 80, 84] [31, 35, 38, 41, 81, 85] [32, 36, 39, 42, 82, 86] [33, 37, 40, 43, 83, 87] [8, 11, 30, 34, 80, 84] [31, 35, 38, 41, 81, 85] [32, 36, 39, 42, 82, 86] [33, 37, 40, 43, 83, 87] [15, 19, 38, 41, 88, 91] [39, 42, 44, 46, 89, 92] [40, 43, 45, 47, 90, 93] [15, 19, 38, 41, 88, 91] [39, 42, 44, 46, 89, 92] [40, 43, 45, 47, 90, 93] [24, 29, 44, 46, 94, 96] [45, 47, 48, 49, 95, 97] [24, 29, 44, 46, 94, 96] [45, 47, 48, 49, 95, 97] [0, 1, 48, 49, 98, 99] [0, 1, 48, 49, 98, 99]
Code ID 100-50-2 · download JSON · raw on GitHub