[[25,5,3]] · QEC Challenge

[[25,5,3]] d ≤stabilizer

kd²/n

1.8

Share this result

Distance

a general stabilizer code has no X and Z sides: d is the minimum Pauli weight of a nontrivial logical operator (a Y factor counts one qubit), and the witness is one Pauli operator that commutes with every generator and is not a product of them

d 3 · witness Pauli weight 3 (claimed upper_bound)

witness operator (Pauli string, 3 qubits)

IIIIIIIXIIIIIIIIZIIIIIIZI X: [7] Z: [16, 23]

certificate none yet · distance stands as a self-certified upper bound (d ≤); the Pauli-weight certifier is not built yet, so stabilizer entries cannot earn d= for now

Diagnostics

computed by the verifier from the parity checks, the layout, and the stored witnesses; shown as evidence, not used for ranking

girth S 4 (shortest cycle of the generator Tanner graph; longer is friendlier to belief propagation)

check weights S 6

qubit degrees S 6

trapping sets S (1,6)×25 (2,4)×25 (3,6)×125 (smallest syndrome weight at each size, connected sets of up to 3 qubits)

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

(1,6): 25 (2,4): 25 (2,6): 25 (2,8): 75 (2,10): 50 (3,6): 125 (3,8): 400 (3,10): 450 (3,12): 250 (3,14): 100

Construction & provenance

authors @davidplu

provenance submitted through the challenge

novelty novelty not audited

construction Cyclic shifts modulo 25 of X support [5, 20], Z support [4, 11, 14, 21]; inversion-symmetric supports.

model GPT-6 (claimed, not verified)

builds on arXiv:quant-ph/9608006

date 2026-09-30

notes Bounded pilot using repository Pauli RIS; literature novelty unverified. Inspired by challenge PR #2445.

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

[[25,5,3]] cyclic stabilizer with weight-6 checks

Direction & hypothesis

Target the unrestricted, weight-6 non-CSS stabilizer board using sparse inversion-symmetric cyclic generators. This is an instance of established additive cyclic constructions, not a new family. The trusted gate reports board advancement against upstream 7ea128673cd867fec57d614d8c847d9f2d790c60. Literature novelty is unverified. No circuit-performance improvement is claimed.

What was searched

The campaign sampled 320 candidates: 160 each at check weights 6 and 8, odd lengths 11 through 31. Disjoint inversion-pair supports define the X and Z halves. Candidate ordering used Python random seed 300930. Initial screening used 80 Pauli RIS trials per candidate; six representatives received deeper searches. This was a bounded sample, not exhaustive enumeration.

Evidence trail

The earlier deep pass requested 20,000 Pauli RIS trials with a 30-second cap, followed by 400,000 accelerator trials on doubled matrices. The new pass requested the same Pauli budget followed by 2,000,000 accelerator trials, seed 301104; both returned lightest Pauli weight 3. The accelerated doubled-matrix search is re-scored by Pauli weight and is not two million independent direct-Pauli trials. Receipts are repro/cyclic-25-5-3/previous-search.json and repro/cyclic-25-5-3/deep-search.json.

The final candidate gate passed structural, rank, commutation, witness and refutation checks, with no exact or WL duplicate detected. Its receipt is repro/cyclic-25-5-3/current-gate.json. All distance metadata remains witness-backed upper_bound. A search that fails to find a lighter logical does not establish a distance lower bound. Duplicate tests do not cover every local Clifford equivalence.

Dead ends and literature limits

None of the six campaign candidates establishes a new unrestricted parameter record. The weight-8 [[21,3,5]] candidate was set aside because an inspected published [[21,3,6]] admits weight-8 generators. For this submission, the Grassl reference achieves distance 7. Exhaustive rowspace analysis of that specific reference gave minimum spanning check weight 12; this is not an optimality claim across all published codes. The submission offers a sparse-check tradeoff or matching distance, not a general literature record.

Tools

GPT-6 in Codex; repository GF(2), Pauli RIS, gf2_fast doubled-matrix search, and unchanged trusted validation tools. No custom distance checker or verifier modification. No decoding benchmark is included.

Reproduction

For every shift t from 0 through 24, add one generator with X support {(a+t) mod 25: a in [5, 20]} and Z support {(b+t) mod 25: b in [4, 11, 14, 21]}. The resulting binary symplectic matrix has 25 rows and 50 columns. The code JSON stores all generators and a nontrivial weight-3 Pauli logical witness.

Run python verify/qldpc_verify.py codes/25-5-3-cyclic.json from the repository root. The construction is related to CRSS, Section 5 and the single-generator cyclic framework of Kovalev, Dumer and Pryadko. The search was initially inspired by challenge PR #2445.

Stabilizer generators

generators 25 (max weight 6; 25 mixed X/Z) (one binary symplectic matrix S = (A | B); generator i is X on A_i and Z on B_i, Y where both)

generators (25, Pauli strings on 25 qubits)

IIIIZXIIIIIZIIZIIIIIXZIII IIIIIZXIIIIIZIIZIIIIIXZII IIIIIIZXIIIIIZIIZIIIIIXZI IIIIIIIZXIIIIIZIIZIIIIIXZ ZIIIIIIIZXIIIIIZIIZIIIIIX XZIIIIIIIZXIIIIIZIIZIIIII IXZIIIIIIIZXIIIIIZIIZIIII IIXZIIIIIIIZXIIIIIZIIZIII IIIXZIIIIIIIZXIIIIIZIIZII IIIIXZIIIIIIIZXIIIIIZIIZI IIIIIXZIIIIIIIZXIIIIIZIIZ ZIIIIIXZIIIIIIIZXIIIIIZII IZIIIIIXZIIIIIIIZXIIIIIZI IIZIIIIIXZIIIIIIIZXIIIIIZ ZIIZIIIIIXZIIIIIIIZXIIIII IZIIZIIIIIXZIIIIIIIZXIIII IIZIIZIIIIIXZIIIIIIIZXIII IIIZIIZIIIIIXZIIIIIIIZXII IIIIZIIZIIIIIXZIIIIIIIZXI IIIIIZIIZIIIIIXZIIIIIIIZX XIIIIIZIIZIIIIIXZIIIIIIIZ ZXIIIIIZIIZIIIIIXZIIIIIII IZXIIIIIZIIZIIIIIXZIIIIII IIZXIIIIIZIIZIIIIIXZIIIII IIIZXIIIIIZIIZIIIIIXZIIII

symplectic rows (A | B) (25, sparse supports)

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

Code ID 25-5-3-cyclic · download JSON · raw on GitHub