← back to the board
[[168,8,5]] d =
n
168
k
8
d
5
kd²/n
1.19
w
4
X/Z
1
g
1.19
r
1.4142
layers
1
swaps
0

Share this result

Distance

X/Z asymmetry 1 · d_X = 5, d_Z = 5 · 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 5 · witness weight 5 (claimed upper_bound)
witness operator (support, 5 qubits)
[65, 66, 81, 95, 96]
d_Z 5 · witness weight 5 (claimed upper_bound)
witness operator (support, 5 qubits)
[57, 58, 59, 77, 78]
certificate exact, d = 5 · CryptoMiniSat 5.14 SAT
X: no logical < 5 exists; Z: no logical < 5 exists

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 2–4 (mean 3.55) · H_Z 2–4 (mean 3.55)
qubit degrees H_X 1–2 (mean 1.69) · H_Z 1–2 (mean 1.69)
trapping sets H_X (1,1)×52 (2,0)×16 (3,0)×4 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 52 (1,2): 116 (2,0): 16 (2,1): 108 (2,2): 264 (3,0): 4 (3,1): 280 (3,2): 612 (3,3): 68 (3,4): 144
trapping sets H_Z (1,1)×52 (2,0)×16 (3,0)×4 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 52 (1,2): 116 (2,0): 16 (2,1): 108 (2,2): 264 (3,0): 4 (3,1): 280 (3,2): 612 (3,3): 68 (3,4): 144
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)

Verified 2D layout

as measured by the verifier: every check drawn over the submitted coordinates; the interaction radius is the longest dashed pair
r = 1.414
X checkZ checkqubit site (168)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 0 nearest-neighbor SWAPs per round in total, at most 0 for one check (heuristic: MST lower bound on the layout, with one lattice step = the minimum qubit spacing 1; not a rank)

Construction & provenance

authors @Xo1otl
provenance submitted through the challenge
novelty novelty not audited
construction contributed via qldpc submit
model Claude Claude Opus 5 (claimed, not verified)
date 2026-08-20
notes Same multi-band construction as the board's [[126,6,5]], [[202,10,5]], [[278,14,5]], at rows=3: k = 3*3-1 = 8. Same k as [[112,8,5]] but a different code (different n; this one carries a layout). Pareto scope stated honestly: frontier in the 8 layout-restricted cells; in the 4 unrestricted cells [[112,8,5]] dominates it. Distance is a witness-backed upper bound from 20000 RIS trials per side, not a certified exact distance.
family other (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

[[168,8,5]] — multi-band dense packing at an odd band count

Direction & hypothesis

Target cell: local-2d-single x weight-4. This entry is the multi-band packing at rows = 3 — the family's only odd-band-count submission, filling the gap between its 2-band ladder and its 4-band instances.

The dense packing of arXiv:2511.06758 (Fujiu, Nagayama, Nishio, Kawaguchi, Satoh) is a pair of bands of rotated surface-code patches. Freeing the band count extends the packing into a second dimension, above a measured band-pitch threshold.

What was searched

A survey of the 338 board codes across the 12 cells, then a multi-band scan parameterized as rows x m x pitch over band counts, patch counts, and vertical band pitch. Screening used the kit's RIS distance surrogate; this code's witness search ran 20,000 RIS trials per CSS side.

Evidence trail

This code is rows = 3 bands, m = 3 patches per even band and 2 on the middle band, at vertical pitch 6 and horizontal patch pitch 2d + 2 = 12, d = 5. The logical count is the full patch count:

k = rows * m - floor(rows / 2) = 3 * 3 - 1 = 8, n = 168, w = 4

single layer, interaction radius sqrt(2).

**Frontier scope, stated honestly: this entry holds a Pareto position in the 8 local-2d-single and local-2d-bilayer cells, not all 12.** In the 4 unrestricted cells the board's [[112,8,5]] — the same k = 8 and d = 5 at lower n, weight 4 but carrying no layout — dominates it. Where a layout is required, nothing dominates this code.

The threshold. At the published vertical pitch d - 1, adding bands adds qubits and no logicals. Above a threshold pitch, k becomes the full patch count with distance preserved. Measured thresholds: pitch_min = 6 at d = 5, 10 at d = 7, 12 at d = 9. Below it the distance collapses to a flat 6 regardless of d and n; at pitch >= 2d the bands disconnect (distance 1); odd pitch breaks CSS outright. Like the family's other multi-band entries this code sits at pitch_min(5) = 6 exactly. The odd rows works the same as even — the threshold and the k formula depend on band adjacency, not parity.

Distance claim, stated precisely: witness-backed upper bound. 20,000 RIS trials per side found a lightest logical of weight 5 on both the X and Z sides and nothing lighter, so both sides carry confidence: upper_bound. No certificate accompanies this and no exact claim is made.

Connectivity: the Tanner graph is a single component, checked by union-find over qubits joined by sharing any check on either side, scanning all 160 checks — one component covering all 168 qubits. A packing whose bands failed to fuse would be a direct sum of independent smaller codes with an inherited [[n,k,d]]. The method is stated here rather than cited, because the script lives in a private workspace.

The board's multi-band entries [[126,6,5]], [[202,10,5]], [[278,14,5]] and the two-band ladder rungs trade n against k and are all mutually non-dominated with this entry.

Dead ends

  • Extra bands at the published pitch d - 1: qubits grow, k does not.
  • Sub-threshold pitches: distance collapses to a flat 6, independent of d
  • and n.

  • pitch >= 2d: bands disconnect, distance 1.
  • Odd pitch: breaks CSS outright (band *pitch* parity matters; band *count*
  • parity does not).

  • Efficiency: a Pareto result, not a density record. k d^2 / n = 1.190
  • here; the board's best is 1.564.

Tools

Claude Opus 5 (matching provenance.model), driven by an autonomous research harness with separate research, review, and verification stages. Repo tooling: research/kit/submit.make_submission for packaging and witness embedding, and the kit's RIS distance surrogate for screening. Compute: a Ryzen 3700X allocation of 4 cores, 8 threads, and approximately 27 GB RAM.

Reproduction

For d = 5, rows = 3, m = 3, pitch = 6:

  • Three bands at vertical pitch 6, horizontal patch pitch 2d + 2 = 12.
  • Even-indexed bands (top and bottom) carry m = 3 rotated surface-code
  • patches of distance 5; the middle band carries 2, offset half a horizontal pitch (6) to the right. Total 8 patches, and k = 8.

  • Data qubits occupy the odd/odd sites of the mask.
  • Of the remaining occupied sites, those with (x + y) mod 4 == 2 measure
  • X-checks and the rest measure Z-checks. Even bands carry (x + y) mod 4 == 0 checks on vertical patch edges and == 2 on horizontal edges; odd bands the reverse.

  • Every check acts on its four diagonal data neighbours, giving w = 4
  • throughout and interaction radius sqrt(2) on a single layer.

The two-band, pitch d - 1 case of this rule is the published packing and is exactly research/build_dense_surface.py in this repo. Generalize its band count and patch counts, then raise the vertical pitch to at least pitch_min(d).

Parity checks

X-checks 80 (max weight 4) · Z-checks 80 (max weight 4)
H_X (80 checks, sparse supports)
[0, 1] [2, 3] [5, 6] [7, 8] [10, 11] [12, 13] [1, 2, 16, 17] [3, 4, 18, 19] [6, 7, 21, 22] [8, 9, 23, 24] [11, 12, 26, 27] [13, 14, 28, 29] [15, 16, 30, 31] [17, 18, 32, 33] [20, 21, 35, 36] [22, 23, 37, 38] [25, 26, 40, 41] [27, 28, 42, 43] [31, 32, 46, 47] [33, 34, 48, 49] [36, 37, 52, 53] [38, 39, 54, 55] [41, 42, 58, 59] [43, 44, 60, 61] [45, 46, 62, 63] [47, 48, 64, 65] [49, 50, 66, 67] [51, 52, 68, 69] [53, 54, 70, 71] [55, 56, 72, 73] [57, 58, 74, 75] [59, 60, 76, 77] [63, 64] [65, 66, 79, 80] [67, 68, 81, 82] [69, 70, 83] [71, 72, 84, 85] [73, 74, 86, 87] [75, 76, 88] [77, 78] [89, 90] [79, 91, 92] [80, 81, 93, 94] [82, 83, 95, 96] [84, 97, 98] [85, 86, 99, 100] [87, 88, 101, 102] [103, 104] [90, 91, 107, 108] [92, 93, 109, 110] [94, 95, 111, 112] [96, 97, 113, 114] [98, 99, 115, 116] [100, 101, 117, 118] [102, 103, 119, 120] [104, 105, 121, 122] [106, 107, 123, 124] [108, 109, 125, 126] [112, 113, 128, 129] [114, 115, 130, 131] [118, 119, 133, 134] [120, 121, 135, 136] [124, 125, 139, 140] [126, 127, 141, 142] [129, 130, 144, 145] [131, 132, 146, 147] [134, 135, 149, 150] [136, 137, 151, 152] [138, 139, 153, 154] [140, 141, 155, 156] [143, 144, 158, 159] [145, 146, 160, 161] [148, 149, 163, 164] [150, 151, 165, 166] [154, 155] [156, 157] [159, 160] [161, 162] [164, 165] [166, 167]
H_Z (80 checks, sparse supports)
[0, 1, 15, 16] [2, 3, 17, 18] [4, 19] [5, 6, 20, 21] [7, 8, 22, 23] [9, 24] [10, 11, 25, 26] [12, 13, 27, 28] [14, 29] [15, 30] [16, 17, 31, 32] [18, 19, 33, 34] [20, 35] [21, 22, 36, 37] [23, 24, 38, 39] [25, 40] [26, 27, 41, 42] [28, 29, 43, 44] [30, 31, 45, 46] [32, 33, 47, 48] [34, 49, 50] [35, 36, 51, 52] [37, 38, 53, 54] [39, 55, 56] [40, 41, 57, 58] [42, 43, 59, 60] [44, 61] [45, 62] [46, 47, 63, 64] [48, 49, 65, 66] [50, 51, 67, 68] [52, 53, 69, 70] [54, 55, 71, 72] [56, 57, 73, 74] [58, 59, 75, 76] [60, 61, 77, 78] [66, 67, 80, 81] [68, 69, 82, 83] [72, 73, 85, 86] [74, 75, 87, 88] [79, 80, 92, 93] [81, 82, 94, 95] [84, 85, 98, 99] [86, 87, 100, 101] [89, 90, 106, 107] [91, 92, 108, 109] [93, 94, 110, 111] [95, 96, 112, 113] [97, 98, 114, 115] [99, 100, 116, 117] [101, 102, 118, 119] [103, 104, 120, 121] [105, 122] [106, 123] [107, 108, 124, 125] [109, 110, 126, 127] [111, 112, 128] [113, 114, 129, 130] [115, 116, 131, 132] [117, 118, 133] [119, 120, 134, 135] [121, 122, 136, 137] [123, 124, 138, 139] [125, 126, 140, 141] [127, 142] [128, 129, 143, 144] [130, 131, 145, 146] [132, 147] [133, 134, 148, 149] [135, 136, 150, 151] [137, 152] [138, 153] [139, 140, 154, 155] [141, 142, 156, 157] [143, 158] [144, 145, 159, 160] [146, 147, 161, 162] [148, 163] [149, 150, 164, 165] [151, 152, 166, 167]
Code ID 168-8-5 · download JSON · raw on GitHub