[[12,6,2]] · QEC Challenge

[[12,6,2]] d ≤

kd²/n

2.0

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 found by @MathysRennela · research/kit/surrogate.lightest_logical · found at 100 trials · survived 100 trials · 2026-10-19

witness operator (support, 2 qubits)

[10, 11]

d_Z 2 · witness weight 2 (claimed upper_bound)

witness found by @MathysRennela · research/kit/surrogate.lightest_logical · found at 100 trials · survived 100 trials · 2026-10-19

witness operator (support, 2 qubits)

[0, 1]

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 2–6 (mean 4.667) · H_Z 6

qubit degrees H_X 1–2 (mean 1.167) · H_Z 1–2 (mean 1.5)

trapping sets H_X (1,1)×10 (2,0)×14 (3,0)×32 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

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

(1,1): 10 (1,2): 2 (2,0): 14 (2,1): 16 (3,0): 32 (3,1): 16 (3,2): 24

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

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

(1,1): 6 (1,2): 6 (2,0): 6 (2,1): 24 (2,2): 12 (3,0): 32 (3,1): 60 (3,2): 24 (3,3): 24

Construction & provenance

authors @MathysRennela

provenance submitted through the challenge

novelty novelty not audited

construction repair of codes/12-7-1.json by adding one X-check [0, 1]

model Beam 1.0 (claimed, not verified)

date 2026-10-19

family other (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

[[12,6,2]] — repair of d=1 code by adding one X check

Direction & hypothesis

Unrestricted / weight-6 cell. Raise distance of a d = 1 frontier sliver to 2 by adding one commuting check.

What was searched

Single-check additions on the deficient side of 12 open d = 1 PR codes.

Evidence trail

Repaired code passes verify/qldpc_verify.py and validate_candidate.py. Distance is a witness-backed upper bound (d <= 2).

Dead ends

Eight of twelve repairs were duplicates or dominated; four survived.

Tools

Model: Beam 1.0. Repo tooling: research/kit/coordination.py.

Reproduction

Add X check [0, 1] to the d = 1 code of PR 3937.

Parity checks

X-checks 3 (max weight 6) · Z-checks 3 (max weight 6)

H_X (3 checks, sparse supports)

[2, 3, 6, 7, 8, 9] [4, 5, 8, 9, 10, 11] [0, 1]

H_Z (3 checks, sparse supports)

[0, 1, 2, 3, 6, 7] [2, 3, 4, 5, 8, 9] [0, 1, 4, 5, 10, 11]

Code ID 12-6-2-b · download JSON · raw on GitHub