← back to the board
[[108,36,2]] d =
n
108
k
36
d
2
kd²/n
1.333
w
7
X/Z
1
g
0.001
r
6.0
layers
2
swaps
386

Share this result

Distance

X/Z asymmetry 1 · d_X = 2, d_Z = 2 · w_X = 7, w_Z = 7 (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)
[91, 97]
d_Z 2 · witness weight 2 (claimed upper_bound)
witness operator (support, 2 qubits)
[46, 49]
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 7 · H_Z 7
qubit degrees H_X 2–5 (mean 3.5) · H_Z 2–5 (mean 3.5)
trapping sets H_X (1,2)×54 (2,0)×27 (3,2)×216 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,2): 54 (1,5): 54 (2,0): 27 (2,3): 108 (2,4): 54 (2,5): 324 (2,6): 27 (2,8): 324 (3,2): 216 (3,3): 648 (3,4): 162 (3,5): 972 (3,6): 972 (3,7): 810 (3,8): 4266 (3,9): 558 (3,11): 2430
trapping sets H_Z (1,2)×54 (2,0)×27 (3,2)×216 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,2): 54 (1,5): 54 (2,0): 27 (2,3): 108 (2,4): 54 (2,5): 324 (2,6): 27 (2,8): 324 (3,2): 216 (3,3): 648 (3,4): 162 (3,5): 972 (3,6): 972 (3,7): 810 (3,8): 4266 (3,9): 558 (3,11): 2430
witness diameter X 1.4142 · Z 2.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 = 6
X checkZ checkqubit site (54)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 386 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(54,10), from github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, nonabelian.zip, diswtnonabelian_wt7wtL2_order54_k36.txt, line 1. nonidentity supports a=[2], b=[2, 3, 4, 53].
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

[[108,36,2]] — two-block group-algebra code on SmallGroup(54,10)

Direction & hypothesis

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

What was searched

Scraped GitHub for downloadable parity-check matrix artifacts and parameter tables. From github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, nonabelian.zip, diswtnonabelian_wt7wtL2_order54_k36.txt, line 1. This row is SmallGroup(54,10) with nonidentity GAP supports a=[2], b=[2, 3, 4, 53]. 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=36), 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(54,10), 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, 4, 53] 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 = 108 - rank(HX) - rank(HZ) = 36. 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 54 (max weight 7) · Z-checks 54 (max weight 7)
H_X (54 checks, sparse supports)
[0, 1, 54, 55, 62, 65, 92] [0, 1, 54, 55, 68, 71, 98] [2, 5, 54, 56, 59, 76, 101] [3, 6, 54, 57, 60, 76, 101] [4, 7, 58, 61, 63, 75, 79] [2, 5, 55, 56, 59, 83, 104] [3, 6, 55, 57, 60, 83, 104] [4, 7, 58, 61, 69, 82, 86] [8, 14, 56, 62, 68, 80, 88] [9, 15, 56, 63, 69, 80, 88] [10, 16, 58, 64, 70, 74, 91] [11, 17, 57, 64, 65, 71, 100] [12, 18, 58, 66, 72, 74, 91] [13, 19, 67, 73, 77, 90, 93] [8, 14, 59, 62, 68, 87, 94] [9, 15, 59, 63, 69, 87, 94] [10, 16, 61, 64, 70, 81, 97] [11, 17, 60, 65, 70, 71, 103] [12, 18, 61, 66, 72, 81, 97] [13, 19, 67, 73, 84, 96, 99] [20, 27, 62, 65, 74, 81, 92] [21, 28, 57, 64, 75, 82, 100] [22, 29, 63, 75, 76, 79, 83] [23, 30, 57, 64, 77, 84, 100] [24, 31, 67, 78, 85, 89, 102] [25, 32, 66, 78, 79, 86, 106] [26, 33, 67, 80, 87, 89, 102] [20, 27, 68, 71, 74, 81, 98] [21, 28, 60, 70, 75, 82, 103] [22, 29, 69, 76, 82, 83, 86] [23, 30, 60, 70, 77, 84, 103] [24, 31, 73, 78, 85, 95, 105] [25, 32, 72, 79, 85, 86, 107] [26, 33, 73, 80, 87, 95, 105] [34, 40, 58, 74, 88, 91, 94] [35, 41, 63, 75, 79, 89, 95] [36, 42, 66, 78, 90, 96, 106] [37, 43, 77, 90, 91, 93, 97] [38, 44, 66, 78, 92, 98, 106] [39, 45, 56, 80, 88, 93, 99] [34, 40, 61, 81, 88, 94, 97] [35, 41, 69, 82, 86, 89, 95] [36, 42, 72, 85, 90, 96, 107] [37, 43, 84, 91, 96, 97, 99] [38, 44, 72, 85, 92, 98, 107] [39, 45, 59, 87, 93, 94, 99] [46, 49, 67, 89, 100, 102, 103] [47, 50, 77, 90, 93, 101, 104] [48, 51, 62, 65, 92, 102, 105] [46, 49, 73, 95, 100, 103, 105] [47, 50, 84, 96, 99, 101, 104] [48, 51, 68, 71, 98, 102, 105] [52, 53, 54, 76, 101, 106, 107] [52, 53, 55, 83, 104, 106, 107]
H_Z (54 checks, sparse supports)
[0, 1, 2, 3, 52, 54, 55] [0, 1, 5, 6, 53, 54, 55] [2, 5, 8, 9, 39, 56, 59] [3, 6, 11, 21, 23, 57, 60] [4, 7, 10, 12, 34, 58, 61] [2, 5, 14, 15, 45, 56, 59] [3, 6, 17, 28, 30, 57, 60] [4, 7, 16, 18, 40, 58, 61] [0, 8, 14, 20, 48, 62, 68] [4, 9, 15, 22, 35, 63, 69] [10, 11, 16, 21, 23, 64, 70] [0, 11, 17, 20, 48, 65, 71] [12, 18, 25, 36, 38, 66, 72] [13, 19, 24, 26, 46, 67, 73] [1, 8, 14, 27, 51, 62, 68] [7, 9, 15, 29, 41, 63, 69] [10, 16, 17, 28, 30, 64, 70] [1, 11, 17, 27, 51, 65, 71] [12, 18, 32, 42, 44, 66, 72] [13, 19, 31, 33, 49, 67, 73] [10, 12, 20, 27, 34, 74, 81] [4, 21, 22, 28, 35, 75, 82] [2, 3, 22, 29, 52, 76, 83] [13, 23, 30, 37, 47, 77, 84] [24, 25, 31, 36, 38, 78, 85] [4, 22, 25, 32, 35, 79, 86] [8, 9, 26, 33, 39, 80, 87] [16, 18, 20, 27, 40, 74, 81] [7, 21, 28, 29, 41, 75, 82] [5, 6, 22, 29, 53, 76, 83] [19, 23, 30, 43, 50, 77, 84] [24, 31, 32, 42, 44, 78, 85] [7, 25, 29, 32, 41, 79, 86] [14, 15, 26, 33, 45, 80, 87] [8, 9, 34, 39, 40, 88, 94] [24, 26, 35, 41, 46, 89, 95] [13, 36, 37, 42, 47, 90, 96] [10, 12, 34, 37, 43, 91, 97] [0, 20, 38, 44, 48, 92, 98] [13, 37, 39, 45, 47, 93, 99] [14, 15, 34, 40, 45, 88, 94] [31, 33, 35, 41, 49, 89, 95] [19, 36, 42, 43, 50, 90, 96] [16, 18, 37, 40, 43, 91, 97] [1, 27, 38, 44, 51, 92, 98] [19, 39, 43, 45, 50, 93, 99] [11, 21, 23, 46, 49, 100, 103] [2, 3, 47, 50, 52, 101, 104] [24, 26, 46, 48, 51, 102, 105] [17, 28, 30, 46, 49, 100, 103] [5, 6, 47, 50, 53, 101, 104] [31, 33, 48, 49, 51, 102, 105] [25, 36, 38, 52, 53, 106, 107] [32, 42, 44, 52, 53, 106, 107]
Code ID 108-36-2 · download JSON · raw on GitHub