← back to the board
[[256,2,16]] d ≤
n
256
k
2
d
16
kd²/n
2.0
w
4
X/Z
1
g
0.125
r
2.8284
layers
1
swaps
644

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 16, d_Z ≤ 16 · 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 16 · witness weight 16 (claimed upper_bound)
witness operator (support, 16 qubits)
[13, 29, 44, 59, 75, 91, 107, 123, 139, 156, 173, 189, 204, 220, 237, 253]
d_Z 16 · witness weight 16 (claimed upper_bound)
witness operator (support, 16 qubits)
[15, 30, 46, 63, 64, 80, 111, 127, 128, 144, 175, 191, 192, 208, 239, 255]
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 8 · H_Z 8 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)
check weights H_X 4 · H_Z 4
qubit degrees H_X 2 · H_Z 2
trapping sets H_X (1,2)×256 (2,2)×768 (3,2)×2304 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,2): 256 (2,2): 768 (3,2): 2304 (3,4): 512
trapping sets H_Z (1,2)×256 (2,2)×768 (3,2)×2304 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,2): 256 (2,2): 768 (3,2): 2304 (3,4): 512
witness diameter X 15.5242 · Z 15.0333 (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)

Verified 2D layout

as measured by the verifier: every check drawn over the submitted coordinates; the interaction radius is the longest dashed pair
r = 2.828
X checkZ checkqubit site (256)dashed: the pair setting the interaction radiushover a check to isolate its qubits; click to pin — repeated clicks cycle through overlapping checks; click empty space to release
routing cost 644 nearest-neighbor SWAPs per round in total, at most 3 for one check (heuristic: MST lower bound on the layout, with one lattice step = the minimum qubit spacing 1; not a rank)

Construction & provenance

provenance submitted through the challenge
novelty novelty not audited
construction Rotated toric code on the periodic 16x16 lattice: all plaquette checks, (i+j) even -> X; distance 16 (cycle lengths).
date 2026-09-20
notes Rotated surface/toric ladder fill: standard topological configuration, distance exact by construction (a row or column of plaquettes is a weight-d logical; none lighter exists). Staged for review; novelty vs the wider literature unverified beyond the cited family origin.
family topological (a tag, not a ranking)
locality 2D-local single (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

[[256,2,16]] rotated toric code (weight-4, 2D-local single-layer)

Direction & hypothesis

The board's least populated primary-track cell is weight-4 x local-2d-single (175 of 1,126 entries at the time of writing): the surface-code-like regime that most qLDPC families (weight >= 6 checks) cannot reach. The standard topological ladders are only seeded at a few sizes on the board (rotated surface [[L^2,1,L]] at L = 5,7,9,11; rotated toric [[L^2,2,L]] at L = 4,6,8), so the hypothesis was that the missing square sizes extend this cell's Pareto frontier on d, at both k = 1 (surface) and k = 2 (toric).

What was searched

Full enumeration of both rotated ladders under the board's admission caps (n <= 700, or the extended tier n <= 1000 with w <= 8 and d <= 40; w = 4 throughout): every square L with admissible(n, 4, L) true, plus every rectangular (L1, L2) configuration -- 1,270 configurations in total. Each was packaged with the kit's own submit.make_submission (RIS witness search) and passed through the trusted gate verify/validate_candidate.py. The gate's novelty verdict split the enumeration exactly along a structural line: squares advance, rectangles never (each [[L1*L2,1,L2]] is strictly dominated by its own square [[L2^2,1,L2]]: same k, same d, same weight, strictly fewer qubits). Only board-advancing survivors were kept; this PR is one of them.

Evidence trail

  • Witness search (kit surrogate, RIS): <= 3,000 trials/side scaled with n;
  • the lightest logical found on each side has weight 16 (a row or column of plaquettes), matching the exact-by-construction distance.

  • Trusted gate (verify/validate_candidate.py): verify ok, distance not
  • refuted (independent fresh-seed RIS search found nothing lighter), not a board duplicate (fingerprint and WL signature checked against the whole board), and board-advancing in the weight-4 x local-2d-single cell.

  • Claim carried: witness-backed upper bound, d <= 16. The distance is exact
  • by construction (no logical lighter than a minimum non-contractible chain exists on the torus), but it is submitted as an upper bound; a maintainer can run verify/certify.py to upgrade it.

Dead ends

  • Rectangular rotated surface/toric codes: all dominated by their own square
  • (see above) -- generated and gate-checked, then discarded.

  • [[9,1,3]] (dominated by the seeded [[7,1,3]]) and [[8,2,2]] (dominated by
  • [[4,2,2]]): gate-flagged as not board-advancing, discarded.

  • Rotated toric L = 10,12,14: parameter sets already on the board
  • ([[100,2,10]] generalized-bicycle, [[144,2,12]] trivariate-bicycle, [[196,2,14]] bivariate-bicycle), skipped as parameter duplicates.

  • An initial torus layout used a ring fold with a seam gap of 3 grid units,
  • which pushed the measured interaction radius past the single-layer cap for L >= 10 (demoting those codes to local-2d-bilayer). The seeded entries' fold convention (seam gap 1) keeps every plaquette diameter at 2*sqrt(2) for every L; that is what this submission uses.

  • Unrotated surface [[2d^2-2d+1,1,d]] and 2D color codes were attempted for a
  • companion fill but their from-scratch constructions failed self-checks; deferred until built from published constructions.

Tools

GLM 5.3 Flash (Zed coding agent); repo kit only (research/kit/submit.py, verify/validate_candidate.py, qldpc_verify), numpy-only constructions. Constructions were verified bit-for-bit (check-support set equality) against the board's own seeded codes/25-1-5.json (L = 5,7,9) and codes/16-2-4.json (L = 4,6,8) before scaling to new sizes.

Reproduction

Rotated toric code [[L^2,2,L]], L = 16 (even):

  • qubits q = (i, j) -> q = i*L + j on an L x L torus (periodic in both axes);
  • for each (i, j) in {0..L-1}^2 the periodic 2x2 plaquette
  • {(i,j), (i,j+1 mod L), (i+1 mod L, j), (i+1 mod L, j+1 mod L)} is an X check when i+j is even and a Z check when i+j is odd;

  • layout: ring fold per axis, i -> 2i for i < L/2 and i -> 2(L-i)-1 for
  • i >= L/2 (the seeded entries' convention; seam gap 1, so every plaquette has diameter 2*sqrt(2)), single layer. Distance: a non-contractible row or column of plaquettes is a weight-L logical; none lighter exists (cycle lengths of the torus).

Parity checks

X-checks 128 (max weight 4) · Z-checks 128 (max weight 4)
H_X (128 checks, sparse supports)
[0, 1, 16, 17] [2, 3, 18, 19] [4, 5, 20, 21] [6, 7, 22, 23] [8, 9, 24, 25] [10, 11, 26, 27] [12, 13, 28, 29] [14, 15, 30, 31] [17, 18, 33, 34] [19, 20, 35, 36] [21, 22, 37, 38] [23, 24, 39, 40] [25, 26, 41, 42] [27, 28, 43, 44] [29, 30, 45, 46] [16, 31, 32, 47] [32, 33, 48, 49] [34, 35, 50, 51] [36, 37, 52, 53] [38, 39, 54, 55] [40, 41, 56, 57] [42, 43, 58, 59] [44, 45, 60, 61] [46, 47, 62, 63] [49, 50, 65, 66] [51, 52, 67, 68] [53, 54, 69, 70] [55, 56, 71, 72] [57, 58, 73, 74] [59, 60, 75, 76] [61, 62, 77, 78] [48, 63, 64, 79] [64, 65, 80, 81] [66, 67, 82, 83] [68, 69, 84, 85] [70, 71, 86, 87] [72, 73, 88, 89] [74, 75, 90, 91] [76, 77, 92, 93] [78, 79, 94, 95] [81, 82, 97, 98] [83, 84, 99, 100] [85, 86, 101, 102] [87, 88, 103, 104] [89, 90, 105, 106] [91, 92, 107, 108] [93, 94, 109, 110] [80, 95, 96, 111] [96, 97, 112, 113] [98, 99, 114, 115] [100, 101, 116, 117] [102, 103, 118, 119] [104, 105, 120, 121] [106, 107, 122, 123] [108, 109, 124, 125] [110, 111, 126, 127] [113, 114, 129, 130] [115, 116, 131, 132] [117, 118, 133, 134] [119, 120, 135, 136] [121, 122, 137, 138] [123, 124, 139, 140] [125, 126, 141, 142] [112, 127, 128, 143] [128, 129, 144, 145] [130, 131, 146, 147] [132, 133, 148, 149] [134, 135, 150, 151] [136, 137, 152, 153] [138, 139, 154, 155] [140, 141, 156, 157] [142, 143, 158, 159] [145, 146, 161, 162] [147, 148, 163, 164] [149, 150, 165, 166] [151, 152, 167, 168] [153, 154, 169, 170] [155, 156, 171, 172] [157, 158, 173, 174] [144, 159, 160, 175] [160, 161, 176, 177] [162, 163, 178, 179] [164, 165, 180, 181] [166, 167, 182, 183] [168, 169, 184, 185] [170, 171, 186, 187] [172, 173, 188, 189] [174, 175, 190, 191] [177, 178, 193, 194] [179, 180, 195, 196] [181, 182, 197, 198] [183, 184, 199, 200] [185, 186, 201, 202] [187, 188, 203, 204] [189, 190, 205, 206] [176, 191, 192, 207] [192, 193, 208, 209] [194, 195, 210, 211] [196, 197, 212, 213] [198, 199, 214, 215] [200, 201, 216, 217] [202, 203, 218, 219] [204, 205, 220, 221] [206, 207, 222, 223] [209, 210, 225, 226] [211, 212, 227, 228] [213, 214, 229, 230] [215, 216, 231, 232] [217, 218, 233, 234] [219, 220, 235, 236] [221, 222, 237, 238] [208, 223, 224, 239] [224, 225, 240, 241] [226, 227, 242, 243] [228, 229, 244, 245] [230, 231, 246, 247] [232, 233, 248, 249] [234, 235, 250, 251] [236, 237, 252, 253] [238, 239, 254, 255] [1, 2, 241, 242] [3, 4, 243, 244] [5, 6, 245, 246] [7, 8, 247, 248] [9, 10, 249, 250] [11, 12, 251, 252] [13, 14, 253, 254] [0, 15, 240, 255]
H_Z (128 checks, sparse supports)
[1, 2, 17, 18] [3, 4, 19, 20] [5, 6, 21, 22] [7, 8, 23, 24] [9, 10, 25, 26] [11, 12, 27, 28] [13, 14, 29, 30] [0, 15, 16, 31] [16, 17, 32, 33] [18, 19, 34, 35] [20, 21, 36, 37] [22, 23, 38, 39] [24, 25, 40, 41] [26, 27, 42, 43] [28, 29, 44, 45] [30, 31, 46, 47] [33, 34, 49, 50] [35, 36, 51, 52] [37, 38, 53, 54] [39, 40, 55, 56] [41, 42, 57, 58] [43, 44, 59, 60] [45, 46, 61, 62] [32, 47, 48, 63] [48, 49, 64, 65] [50, 51, 66, 67] [52, 53, 68, 69] [54, 55, 70, 71] [56, 57, 72, 73] [58, 59, 74, 75] [60, 61, 76, 77] [62, 63, 78, 79] [65, 66, 81, 82] [67, 68, 83, 84] [69, 70, 85, 86] [71, 72, 87, 88] [73, 74, 89, 90] [75, 76, 91, 92] [77, 78, 93, 94] [64, 79, 80, 95] [80, 81, 96, 97] [82, 83, 98, 99] [84, 85, 100, 101] [86, 87, 102, 103] [88, 89, 104, 105] [90, 91, 106, 107] [92, 93, 108, 109] [94, 95, 110, 111] [97, 98, 113, 114] [99, 100, 115, 116] [101, 102, 117, 118] [103, 104, 119, 120] [105, 106, 121, 122] [107, 108, 123, 124] [109, 110, 125, 126] [96, 111, 112, 127] [112, 113, 128, 129] [114, 115, 130, 131] [116, 117, 132, 133] [118, 119, 134, 135] [120, 121, 136, 137] [122, 123, 138, 139] [124, 125, 140, 141] [126, 127, 142, 143] [129, 130, 145, 146] [131, 132, 147, 148] [133, 134, 149, 150] [135, 136, 151, 152] [137, 138, 153, 154] [139, 140, 155, 156] [141, 142, 157, 158] [128, 143, 144, 159] [144, 145, 160, 161] [146, 147, 162, 163] [148, 149, 164, 165] [150, 151, 166, 167] [152, 153, 168, 169] [154, 155, 170, 171] [156, 157, 172, 173] [158, 159, 174, 175] [161, 162, 177, 178] [163, 164, 179, 180] [165, 166, 181, 182] [167, 168, 183, 184] [169, 170, 185, 186] [171, 172, 187, 188] [173, 174, 189, 190] [160, 175, 176, 191] [176, 177, 192, 193] [178, 179, 194, 195] [180, 181, 196, 197] [182, 183, 198, 199] [184, 185, 200, 201] [186, 187, 202, 203] [188, 189, 204, 205] [190, 191, 206, 207] [193, 194, 209, 210] [195, 196, 211, 212] [197, 198, 213, 214] [199, 200, 215, 216] [201, 202, 217, 218] [203, 204, 219, 220] [205, 206, 221, 222] [192, 207, 208, 223] [208, 209, 224, 225] [210, 211, 226, 227] [212, 213, 228, 229] [214, 215, 230, 231] [216, 217, 232, 233] [218, 219, 234, 235] [220, 221, 236, 237] [222, 223, 238, 239] [225, 226, 241, 242] [227, 228, 243, 244] [229, 230, 245, 246] [231, 232, 247, 248] [233, 234, 249, 250] [235, 236, 251, 252] [237, 238, 253, 254] [224, 239, 240, 255] [0, 1, 240, 241] [2, 3, 242, 243] [4, 5, 244, 245] [6, 7, 246, 247] [8, 9, 248, 249] [10, 11, 250, 251] [12, 13, 252, 253] [14, 15, 254, 255]
Code ID 256-2-16 · download JSON · raw on GitHub