← back to the board
[[66,2,11]] d ≤
n
66
k
2
d
11
kd²/n
3.667
w
8
X/Z
1
g
0.0027
r
6.0828
layers
2
swaps
322

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 11, d_Z ≤ 11 · 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 11 · witness weight 11 (claimed upper_bound)
witness operator (support, 11 qubits)
[9, 15, 20, 21, 24, 29, 34, 47, 48, 52, 62]
d_Z 11 · witness weight 11 (claimed upper_bound)
witness operator (support, 11 qubits)
[2, 3, 7, 20, 21, 34, 40, 46, 53, 62, 64]
certificate none yet · distance stands as a self-certified upper bound (d ≤)

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)×33 (2,2)×33 (3,2)×33 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,2): 33 (1,6): 33 (2,2): 33 (2,4): 33 (2,6): 363 (2,8): 33 (2,10): 330 (3,2): 33 (3,4): 330 (3,6): 2112 (3,8): 1881 (3,10): 5511 (3,12): 1958 (3,14): 2145 (3,16): 165
trapping sets H_Z (1,2)×33 (2,2)×33 (3,2)×33 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,2): 33 (1,6): 33 (2,2): 33 (2,4): 33 (2,6): 363 (2,8): 33 (2,10): 330 (3,2): 33 (3,4): 330 (3,6): 2112 (3,8): 1881 (3,10): 5511 (3,12): 1958 (3,14): 2145 (3,16): 165
witness diameter X 6.0828 · Z 6.4031 (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.083
X checkZ checkqubit site (34)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 322 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(33,1), from github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, abelian.zip, diswtabelian_wt8wtL2_order33_k2.txt, line 1. nonidentity supports a=[3], b=[2, 3, 4, 8, 15].
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

[[66,2,11]] — two-block group-algebra code on SmallGroup(33,1)

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.67.

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_order33_k2.txt, line 1. This row is SmallGroup(33,1) with nonidentity GAP supports a=[3], b=[2, 3, 4, 8, 15]. 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 ≤ 11, 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(33,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=[3], b=[2, 3, 4, 8, 15] 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 = 66 - 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 33 (max weight 8) · Z-checks 33 (max weight 8)
H_X (33 checks, sparse supports)
[0, 29, 33, 34, 36, 50, 62, 63] [1, 31, 33, 34, 36, 52, 59, 64] [0, 2, 33, 35, 37, 39, 53, 65] [3, 32, 33, 34, 36, 54, 61, 65] [1, 4, 34, 35, 37, 39, 55, 62] [2, 5, 35, 36, 38, 40, 42, 56] [3, 6, 35, 36, 37, 39, 57, 64] [4, 7, 33, 37, 38, 40, 42, 58] [5, 8, 38, 39, 41, 43, 45, 59] [6, 9, 34, 38, 39, 40, 42, 60] [7, 10, 35, 40, 41, 43, 45, 61] [8, 11, 41, 42, 44, 46, 48, 62] [9, 12, 37, 41, 42, 43, 45, 63] [10, 13, 38, 43, 44, 46, 48, 64] [11, 14, 33, 44, 45, 47, 49, 51] [12, 15, 40, 44, 45, 46, 48, 65] [13, 16, 34, 41, 46, 47, 49, 51] [14, 17, 35, 47, 48, 50, 52, 54] [15, 18, 36, 43, 47, 48, 49, 51] [16, 19, 37, 44, 49, 50, 52, 54] [17, 20, 38, 50, 51, 53, 55, 57] [18, 21, 39, 46, 50, 51, 52, 54] [19, 22, 40, 47, 52, 53, 55, 57] [20, 23, 41, 53, 54, 56, 58, 60] [21, 24, 42, 49, 53, 54, 55, 57] [22, 25, 43, 50, 55, 56, 58, 60] [23, 26, 44, 56, 57, 59, 61, 63] [24, 27, 45, 52, 56, 57, 58, 60] [25, 28, 46, 53, 58, 59, 61, 63] [26, 29, 47, 59, 60, 62, 64, 65] [27, 30, 48, 55, 59, 60, 61, 63] [28, 31, 49, 56, 61, 62, 64, 65] [30, 32, 51, 58, 62, 63, 64, 65]
H_Z (33 checks, sparse supports)
[0, 1, 2, 3, 7, 14, 33, 35] [0, 1, 3, 4, 9, 16, 34, 37] [2, 4, 5, 6, 10, 17, 35, 38] [0, 1, 3, 5, 6, 18, 36, 39] [2, 4, 6, 7, 12, 19, 37, 40] [5, 7, 8, 9, 13, 20, 38, 41] [2, 4, 6, 8, 9, 21, 39, 42] [5, 7, 9, 10, 15, 22, 40, 43] [8, 10, 11, 12, 16, 23, 41, 44] [5, 7, 9, 11, 12, 24, 42, 45] [8, 10, 12, 13, 18, 25, 43, 46] [11, 13, 14, 15, 19, 26, 44, 47] [8, 10, 12, 14, 15, 27, 45, 48] [11, 13, 15, 16, 21, 28, 46, 49] [14, 16, 17, 18, 22, 29, 47, 50] [11, 13, 15, 17, 18, 30, 48, 51] [14, 16, 18, 19, 24, 31, 49, 52] [0, 17, 19, 20, 21, 25, 50, 53] [14, 16, 18, 20, 21, 32, 51, 54] [1, 17, 19, 21, 22, 27, 52, 55] [2, 20, 22, 23, 24, 28, 53, 56] [3, 17, 19, 21, 23, 24, 54, 57] [4, 20, 22, 24, 25, 30, 55, 58] [5, 23, 25, 26, 27, 31, 56, 59] [6, 20, 22, 24, 26, 27, 57, 60] [7, 23, 25, 27, 28, 32, 58, 61] [1, 8, 26, 28, 29, 30, 59, 62] [9, 23, 25, 27, 29, 30, 60, 63] [3, 10, 26, 28, 30, 31, 61, 64] [0, 4, 11, 29, 31, 32, 33, 62] [0, 12, 26, 28, 30, 32, 63, 65] [1, 6, 13, 29, 31, 32, 34, 64] [2, 3, 15, 29, 31, 32, 36, 65]
Code ID 66-2-11 · download JSON · raw on GitHub