[[80,30,2]] · QEC Challenge

[[80,30,2]] d =

kd²/n

1.5

X/Z

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)

[58, 62]

d_Z 2 · witness weight 2 (claimed upper_bound)

witness operator (support, 2 qubits)

[48, 61]

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)×40 (2,0)×40 (3,0)×80 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

full (size, syndrome weight): count census for H_X

(1,2): 40 (1,4): 40 (2,0): 40 (2,2): 80 (2,4): 160 (2,6): 160 (3,0): 80 (3,2): 120 (3,4): 1080 (3,6): 1440 (3,8): 960

trapping sets H_Z (1,2)×40 (2,0)×20 (3,2)×640 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

full (size, syndrome weight): count census for H_Z

(1,2): 40 (1,4): 40 (2,0): 20 (2,2): 80 (2,4): 280 (3,2): 640 (3,4): 960 (3,6): 600 (3,8): 80

Construction & provenance

authors @MathysRennela

provenance submitted through the challenge

novelty novelty not audited

construction 2BGA (arXiv:2306.16400) on SmallGroup(40,10), from github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, nonabelian.zip, diswtnonabelian_wt6wtL2_order40_k30.txt, line 1. nonidentity supports a=[2], b=[2, 9, 13].

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

[[80,30,2]] — two-block group-algebra code on SmallGroup(40,10)

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 = 1.50.

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_wt6wtL2_order40_k30.txt, line 1. This row is SmallGroup(40,10) with nonidentity GAP supports a=[2], b=[2, 9, 13]. 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=30), 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(40,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, 9, 13] 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 = 80 - rank(HX) - rank(HZ) = 30. 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 40 (max weight 6) · Z-checks 40 (max weight 6)

H_X (40 checks, sparse supports)

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

H_Z (40 checks, sparse supports)

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

Code ID 80-30-2 · download JSON · raw on GitHub