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

d_Z 6 · witness weight 6 (claimed upper_bound)

certificate exact, d = 6 · scipy/HiGHS MILP

X: no logical < 6 exists; Z: no logical < 6 exists

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

qubit degrees H_X 3 · H_Z 3

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

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

witness diameter X 4.4721 · Z 4.1231 (Euclidean support diameter of the stored distance witnesses in the layout; an upper bound on the exhibited logicals’ spread, not a minimum over all logicals)

syndrome-extraction memory circuits committed under circuits/30-4-6/ · canonical noise recipe, 6 rounds, stim 1.16.0

d_circ ≤ 6 (min over bases; penalty-only, clamped to ≤ d)

d_circ^X 6 · fault-set witness of 6 mechanisms (claimed upper_bound)

d_circ^Z 6 · fault-set witness of 6 mechanisms (claimed upper_bound)

no measured logical error rate yet; d_circ is a floor, and the measured tier records the prefactor it cannot see

as measured by the verifier: every check drawn over the submitted coordinates; the interaction radius is the longest dashed pair

routing cost 56 nearest-neighbor SWAPs per round in total, at most 5 for one check (heuristic: MST lower bound on the layout, with one lattice step = the minimum qubit spacing 1; not a rank)

authors Zijian Liang and Ke Liu and Hao Song and Yu-An Chen

provenance literature baseline

construction Twisted-torus bivariate-bicycle code from Generalized toric codes on twisted tori for quantum error correction (PRX Quantum 6, 020357, 2025). Stabilizers f(x,y)=1+x+x², g(x,y)=1+y+x² on the abelian quotient group Z²/L with twist basis a_1=[0, 3], a_2=[5, 1] (n=2|det[a_1,a_2]|=2*15). Reconstructed from the published polynomials and twist; CSS form H_X=[f|g], H_Z=[gbar|fbar].

model classical construction (no AI model)

reference arXiv:2503.03827

date 2025

notes Reconstructed baseline from Liang, Liu, Song, Chen, Generalized toric codes on twisted tori for quantum error correction (PRX Quantum 6, 020357, 2025), arXiv:2503.03827. The [[n,k,d]] parameter set and stabilizer polynomials are published in that paper; this entry reproduces them. Distance is an upper bound per the paper (probabilistic for d>20); the witness is the surrogate logical of that weight. Seeded to fill a board coverage gap at this block size, not a discovery. Layout certification: a verifier-accepted honest bilayer layout (stacked 3x5 grid, 2 qubits per site, layers=2, measured interaction radius ~4.472) was found by @mathysrennela (Aug 2026). It earns the code the local-2d-bilayer class and makes the site's geometric efficiency g = 4kd^2/(n rho^2 r^4) computable. Code authorship unchanged; layout credit to @mathysrennela.

family bivariate bicycle (a tag, not a ranking)

locality 2D-local bilayer (computed from the layout)

weight class weight ≤ 6 (computed)

no research note was staged with this submission — notes are requested for new submissions (notes/README.md)

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

Code ID 30-4-6 · download JSON · raw on GitHub