[[36,10,4]] · QEC Challenge

[[36,10,4]] d =

kd²/n

4.444

X/Z

Share this result

Distance

X/Z asymmetry 1 · d_X = 4, d_Z = 4 · 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 4 · witness weight 4 (claimed upper_bound)

witness operator (support, 4 qubits)

[7, 10, 25, 28]

d_Z 4 · witness weight 4 (claimed upper_bound)

witness operator (support, 4 qubits)

[6, 17, 27, 35]

certificate exact, d = 4 · scipy/HiGHS MILP

X: no logical < 4 exists; Z: no logical < 4 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 8 · H_Z 8

qubit degrees H_X 4 · H_Z 4

trapping sets H_X (1,4)×36 (2,4)×72 (3,2)×36 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

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

(1,4): 36 (2,4): 72 (2,6): 360 (3,2): 36 (3,4): 252 (3,6): 2088 (3,8): 2736 (3,10): 288

trapping sets H_Z (1,4)×36 (2,4)×72 (3,2)×36 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

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

(1,4): 36 (2,4): 72 (2,6): 360 (3,2): 36 (3,4): 252 (3,6): 2088 (3,8): 2736 (3,10): 288

Construction & provenance

authors @MathysRennela

provenance submitted through the challenge

novelty novelty not audited

construction 2BGA (arXiv:2306.16400) on SmallGroup(18,5), from github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c, abelian.zip, diswtabelian_wt8wtL4_order18_k10.txt, line 1. nonidentity supports a=[3, 4, 11], b=[3, 6, 8].

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 ≤ 8 (computed)

How this code was found

the research note submitted with this code · raw markdown · all notes

[[36,10,4]] — two-block group-algebra code on SmallGroup(18,5)

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

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_wt8wtL4_order18_k10.txt, line 1. This row is SmallGroup(18,5) with nonidentity GAP supports a=[3, 4, 11], b=[3, 6, 8]. 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=10), and no lighter logical was found in the refutation search. Distance is a witness-backed upper bound d ≤ 4, 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(18,5), 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, 4, 11], b=[3, 6, 8] 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 = 36 - rank(HX) - rank(HZ) = 10. 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 18 (max weight 8) · Z-checks 18 (max weight 8)

H_X (18 checks, sparse supports)

[0, 6, 8, 17, 18, 24, 29, 34] [1, 9, 11, 16, 19, 26, 27, 35] [0, 2, 11, 13, 18, 20, 26, 33] [0, 3, 9, 12, 19, 21, 24, 30] [1, 4, 8, 15, 19, 22, 29, 31] [1, 5, 6, 14, 18, 23, 27, 32] [2, 6, 15, 16, 20, 24, 31, 35] [1, 2, 3, 7, 18, 21, 22, 25] [3, 8, 14, 16, 23, 26, 30, 34] [4, 9, 13, 17, 22, 27, 33, 34] [0, 4, 5, 10, 19, 20, 23, 28] [5, 11, 12, 17, 21, 29, 32, 35] [4, 6, 7, 12, 20, 25, 27, 30] [5, 7, 8, 13, 21, 26, 28, 31] [2, 9, 10, 14, 22, 24, 28, 32] [3, 10, 11, 15, 23, 25, 29, 33] [10, 12, 13, 16, 25, 31, 32, 34] [7, 14, 15, 17, 28, 30, 33, 35]

H_Z (18 checks, sparse supports)

[0, 2, 5, 7, 18, 20, 21, 28] [1, 3, 4, 10, 19, 22, 23, 25] [2, 6, 10, 12, 20, 24, 25, 32] [3, 7, 11, 13, 21, 25, 26, 33] [4, 7, 9, 14, 22, 27, 28, 30] [5, 8, 10, 15, 23, 28, 29, 31] [0, 3, 6, 14, 18, 23, 24, 30] [7, 12, 15, 16, 25, 30, 31, 35] [1, 2, 8, 13, 18, 22, 26, 31] [1, 5, 9, 12, 19, 21, 27, 32] [10, 13, 14, 17, 28, 32, 33, 34] [0, 4, 11, 15, 19, 20, 29, 33] [3, 8, 12, 17, 21, 29, 30, 34] [4, 6, 13, 16, 20, 27, 31, 34] [5, 11, 14, 16, 23, 26, 32, 35] [2, 9, 15, 17, 22, 24, 33, 35] [0, 8, 9, 16, 19, 24, 26, 34] [1, 6, 11, 17, 18, 27, 29, 35]

Code ID 36-10-4 · download JSON · raw on GitHub