[[24,15,2]] · QEC Challenge

[[24,15,2]] d ≤

kd²/n

2.5

X/Z

Share this result

Distance

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

witness operator (support, 2 qubits)

[15, 17]

d_Z 2 · witness weight 2 (claimed upper_bound)

witness operator (support, 2 qubits)

[2, 4]

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 8 · H_Z 8

qubit degrees H_X 1–2 (mean 1.333) · H_Z 1–2 (mean 1.667)

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

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

(1,1): 16 (1,2): 8 (2,0): 40 (2,1): 48 (2,2): 16 (3,0): 64 (3,1): 208 (3,2): 124 (3,3): 32

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

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

(1,1): 8 (1,2): 16 (2,0): 24 (2,1): 40 (2,2): 60 (3,0): 16 (3,1): 232 (3,2): 344 (3,3): 48 (3,4): 32

Construction & provenance

authors @MathysRennela

provenance submitted through the challenge

novelty novelty not audited

construction C-DELETE-CHECK a1 from 24-14-2.json

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

How this code was found

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

[[24,15,2]] C-DELETE-CHECK a1 from 24-14-2.json

Direction & hypothesis

Board-advancing code found by the priced construction calculus. Operation: C-DELETE-CHECK applied to a board entry, raising k / lowering check weight while keeping a witness-backed distance. Rule used: C-DELETE-CHECK.

What was searched

A single deletion move on an existing board code, validated by the trusted gate.

Evidence trail

Distance witnesses: X=[12, 17], Z=[8, 11]. The gate's refutation search found no lighter logical.

Dead ends

None recorded for this candidate.

Tools

Model: Beam 1.0. The local verdict is verify/validate_candidate.py.

Reproduction

Reconstruct the parent board code, delete the named check, and recompute n, k, and the witness-backed distance. The resulting checks are the submitted ones.

Parity checks

X-checks 4 (max weight 8) · Z-checks 5 (max weight 8)

H_X (4 checks, sparse supports)

[0, 1, 3, 5, 13, 17, 20, 23] [2, 4, 7, 9, 12, 14, 15, 19] [2, 4, 7, 9, 13, 16, 17, 21] [6, 8, 10, 11, 14, 18, 19, 22]

H_Z (5 checks, sparse supports)

[0, 2, 3, 7, 12, 13, 15, 17] [1, 4, 5, 9, 12, 13, 15, 17] [2, 6, 7, 10, 14, 16, 19, 21] [4, 8, 9, 11, 14, 16, 19, 21] [0, 3, 6, 10, 18, 20, 22, 23]

Code ID 24-15-2 · download JSON · raw on GitHub