[[34,11,1]] · QEC Challenge

[[34,11,1]] d ≤

kd²/n

0.323529

X/Z

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 1, d_Z ≤ 1 · w_X = 4, w_Z = 4 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)

d_X 1 · witness weight 1 (claimed upper_bound)

witness operator (support, 1 qubits)

[5]

d_Z 1 · witness weight 1 (claimed upper_bound)

witness operator (support, 1 qubits)

[0]

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 acyclic · H_Z acyclic (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)

check weights H_X 2–4 (mean 3.333) · H_Z 2–4 (mean 3.455)

qubit degrees H_X 0–2 (mean 1.176) · H_Z 0–2 (mean 1.118)

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

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

(1,0): 2 (1,1): 24 (1,2): 8 (2,0): 18 (2,1): 25 (2,2): 8 (3,0): 17 (3,1): 37 (3,2): 15 (3,3): 10 (3,4): 2

trapping sets H_Z (1,0)×4 (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_Z

(1,0): 4 (1,1): 22 (1,2): 8 (2,0): 14 (2,1): 32 (2,2): 5 (3,0): 32 (3,1): 23 (3,2): 21 (3,3): 10

Construction & provenance

authors @mathysrennela

provenance submitted through the challenge

novelty novelty not audited

construction code-calculus v0.2rc greedy gated

model Beam 1.0 (claimed, not verified)

date 2026-11-12

notes Generated by the priced construction calculus. Distance is reported only with witness-backed upper bounds; lower interval bounds are kept in the separate local ledger.

family other (a tag, not a ranking)

locality unrestricted (computed from the layout)

weight class weight ≤ 4 (computed)

How this code was found

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

[[34,11,1]] — code-calculus v0.2rc greedy gated

Direction & hypothesis

Frontier gaps in the CSS track via greedy multi-step composition of C-DELETE-CHECK, E-PEEL, and E-PUNCTURE (code-calculus v0.2rc).

What was searched

CSS parents from codes/ with n <= 10, up to 3 greedy steps, budget 16 RIS trials per candidate, sector swap enabled, domination pruning. See the greedy gated campaign (code-calculus v0.2rc).

Evidence trail

Witness-backed upper bound validated by verify/validate_candidate.py (passed: true). Model: Beam 1.0.

Dead ends

Sector-swap-only, strict C-ADD-CHECK addition, and E-GLUE produced no board-advancing codes in this campaign.

Tools

code-calculus-dev (latest), research/kit coordination.

Reproduction

Run the greedy gated campaign (code-calculus v0.2rc) at n<=10, 3 steps, budget 16.

Parity checks

X-checks 12 (max weight 4) · Z-checks 11 (max weight 4)

H_X (12 checks, sparse supports)

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

H_Z (11 checks, sparse supports)

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

Code ID 34-11-1 · download JSON · raw on GitHub