[[35,18,1]] · QEC Challenge

[[35,18,1]] d ≤

kd²/n

0.514286

X/Z

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 1, d_Z ≤ 1 · w_X = 5, 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)

[21]

d_Z 1 · witness weight 1 (claimed upper_bound)

witness operator (support, 1 qubits)

[30]

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

check weights H_X 5 · H_Z 4

qubit degrees H_X 0–2 (mean 1.0) · H_Z 0–2 (mean 1.143)

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

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

(1,0): 6 (1,1): 23 (1,2): 6 (2,0): 30 (2,1): 32 (2,2): 8 (3,0): 38 (3,1): 70 (3,2): 42 (3,3): 12 (3,4): 4

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

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

(1,0): 7 (1,1): 16 (1,2): 12 (2,0): 7 (2,1): 34 (2,2): 19 (3,0): 20 (3,1): 62 (3,2): 40 (3,3): 20 (3,4): 6

Construction & provenance

authors @mathysrennela

provenance submitted through the challenge

novelty known parameter set; see provenance notes

construction code-calculus v0.2rc greedy gated

model Beam 1.0 (claimed, not verified)

builds on https://qecdb.org/codes/67a4b09939376ce8055b7d02 (isomorphic record; research/provenance/derived.json)

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

How this code was found

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

[[35,18,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 7 (max weight 5) · Z-checks 10 (max weight 4)

H_X (7 checks, sparse supports)

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

H_Z (10 checks, sparse supports)

[6, 14, 32, 33] [3, 4, 17, 20] [1, 8, 17, 23] [16, 19, 20, 32] [0, 5, 10, 11] [7, 11, 18, 24] [13, 18, 23, 31] [7, 27, 30, 34] [5, 6, 15, 30] [8, 12, 24, 29]

Code ID 35-18-1 · download JSON · raw on GitHub