[[66,22,3]] · QEC Challenge

[[66,22,3]] d =

kd²/n

3.0

X/Z

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)

[50, 52, 54]

d_Z 3 · witness weight 3 (claimed upper_bound)

witness operator (support, 3 qubits)

[13, 16, 46]

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)×33 (2,2)×99 (3,0)×55 (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,4): 33 (2,2): 99 (2,4): 198 (2,6): 66 (3,0): 55 (3,2): 330 (3,4): 825 (3,6): 759 (3,8): 132

trapping sets H_Z (1,2)×33 (2,2)×99 (3,0)×55 (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,4): 33 (2,2): 99 (2,4): 198 (2,6): 66 (3,0): 55 (3,2): 330 (3,4): 825 (3,6): 759 (3,8): 132

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_wt6wtL2_order33_k22.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 unrestricted (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

[[66,22,3]] — two-block group-algebra code on SmallGroup(33,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_order33_k22.txt, line 1. This row is SmallGroup(33,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=22), 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(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=[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 = 66 - rank(HX) - rank(HZ) = 22. 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 6) · Z-checks 33 (max weight 6)

H_X (33 checks, sparse supports)

[0, 3, 33, 36, 62, 65] [0, 1, 33, 34, 62, 64] [2, 6, 33, 35, 36, 39] [1, 3, 34, 36, 64, 65] [2, 4, 33, 34, 35, 37] [5, 9, 35, 38, 39, 42] [4, 6, 34, 36, 37, 39] [5, 7, 35, 37, 38, 40] [8, 12, 38, 41, 42, 45] [7, 9, 37, 39, 40, 42] [8, 10, 38, 40, 41, 43] [11, 15, 41, 44, 45, 48] [10, 12, 40, 42, 43, 45] [11, 13, 41, 43, 44, 46] [14, 18, 44, 47, 48, 51] [13, 15, 43, 45, 46, 48] [14, 16, 44, 46, 47, 49] [17, 21, 47, 50, 51, 54] [16, 18, 46, 48, 49, 51] [17, 19, 47, 49, 50, 52] [20, 24, 50, 53, 54, 57] [19, 21, 49, 51, 52, 54] [20, 22, 50, 52, 53, 55] [23, 27, 53, 56, 57, 60] [22, 24, 52, 54, 55, 57] [23, 25, 53, 55, 56, 58] [26, 30, 56, 59, 60, 63] [25, 27, 55, 57, 58, 60] [26, 28, 56, 58, 59, 61] [29, 32, 59, 62, 63, 65] [28, 30, 58, 60, 61, 63] [29, 31, 59, 61, 62, 64] [31, 32, 61, 63, 64, 65]

H_Z (33 checks, sparse supports)

[0, 1, 2, 4, 33, 34] [1, 3, 4, 6, 34, 36] [2, 4, 5, 7, 35, 37] [0, 2, 3, 6, 33, 36] [4, 6, 7, 9, 37, 39] [5, 7, 8, 10, 38, 40] [2, 5, 6, 9, 35, 39] [7, 9, 10, 12, 40, 42] [8, 10, 11, 13, 41, 43] [5, 8, 9, 12, 38, 42] [10, 12, 13, 15, 43, 45] [11, 13, 14, 16, 44, 46] [8, 11, 12, 15, 41, 45] [13, 15, 16, 18, 46, 48] [14, 16, 17, 19, 47, 49] [11, 14, 15, 18, 44, 48] [16, 18, 19, 21, 49, 51] [17, 19, 20, 22, 50, 52] [14, 17, 18, 21, 47, 51] [19, 21, 22, 24, 52, 54] [20, 22, 23, 25, 53, 55] [17, 20, 21, 24, 50, 54] [22, 24, 25, 27, 55, 57] [23, 25, 26, 28, 56, 58] [20, 23, 24, 27, 53, 57] [25, 27, 28, 30, 58, 60] [26, 28, 29, 31, 59, 61] [23, 26, 27, 30, 56, 60] [28, 30, 31, 32, 61, 63] [0, 1, 29, 31, 62, 64] [26, 29, 30, 32, 59, 63] [1, 3, 31, 32, 64, 65] [0, 3, 29, 32, 62, 65]

Code ID 66-22-3 · download JSON · raw on GitHub