← back to the board
[[121,1,11]] d ≤
n
121
k
1
d
11
kd²/n
1.0
w
4
X/Z
1
g
1
r
1.4142
layers
1
swaps
0

Share this result

Distance

X/Z asymmetry 1 · d_X ≤ 11, d_Z ≤ 11 · 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 11 · witness weight 11 (claimed exact)
witness operator (support, 11 qubits)
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
d_Z 11 · witness weight 11 (claimed exact)
witness operator (support, 11 qubits)
[0, 11, 22, 33, 44, 55, 66, 77, 88, 99, 110]
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 2–4 (mean 3.667) · H_Z 2–4 (mean 3.667)
qubit degrees H_X 1–2 (mean 1.818) · H_Z 1–2 (mean 1.818)
trapping sets H_X (1,1)×22 (2,0)×10 (3,1)×118 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_X
(1,1): 22 (1,2): 99 (2,0): 10 (2,1): 42 (2,2): 258 (3,1): 118 (3,2): 685 (3,3): 20 (3,4): 160
trapping sets H_Z (1,1)×22 (2,0)×10 (3,1)×118 (smallest syndrome weight at each size, connected sets of up to 3 qubits)
full (size, syndrome weight): count census for H_Z
(1,1): 22 (1,2): 99 (2,0): 10 (2,1): 42 (2,2): 258 (3,1): 118 (3,2): 685 (3,3): 20 (3,4): 160
witness diameter X 10.0 · Z 10.0 (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 (121)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

provenance submitted through the challenge
novelty novelty not audited
construction Rotated surface code, distance 11.
model beam 1.0 (claimed, not verified)
date 1997-07-09
notes Distance is exact by construction. 2D layout: qubit q at (q//11, q%11) on the 11x11 planar grid; single layer, measured interaction radius sqrt(2).
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

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

Parity checks

X-checks 60 (max weight 4) · Z-checks 60 (max weight 4)
H_X (60 checks, sparse supports)
[0, 1, 11, 12] [2, 3, 13, 14] [4, 5, 15, 16] [6, 7, 17, 18] [8, 9, 19, 20] [12, 13, 23, 24] [14, 15, 25, 26] [16, 17, 27, 28] [18, 19, 29, 30] [20, 21, 31, 32] [22, 23, 33, 34] [24, 25, 35, 36] [26, 27, 37, 38] [28, 29, 39, 40] [30, 31, 41, 42] [34, 35, 45, 46] [36, 37, 47, 48] [38, 39, 49, 50] [40, 41, 51, 52] [42, 43, 53, 54] [44, 45, 55, 56] [46, 47, 57, 58] [48, 49, 59, 60] [50, 51, 61, 62] [52, 53, 63, 64] [56, 57, 67, 68] [58, 59, 69, 70] [60, 61, 71, 72] [62, 63, 73, 74] [64, 65, 75, 76] [66, 67, 77, 78] [68, 69, 79, 80] [70, 71, 81, 82] [72, 73, 83, 84] [74, 75, 85, 86] [78, 79, 89, 90] [80, 81, 91, 92] [82, 83, 93, 94] [84, 85, 95, 96] [86, 87, 97, 98] [88, 89, 99, 100] [90, 91, 101, 102] [92, 93, 103, 104] [94, 95, 105, 106] [96, 97, 107, 108] [100, 101, 111, 112] [102, 103, 113, 114] [104, 105, 115, 116] [106, 107, 117, 118] [108, 109, 119, 120] [10, 21] [11, 22] [32, 43] [33, 44] [54, 65] [55, 66] [76, 87] [77, 88] [98, 109] [99, 110]
H_Z (60 checks, sparse supports)
[1, 2, 12, 13] [3, 4, 14, 15] [5, 6, 16, 17] [7, 8, 18, 19] [9, 10, 20, 21] [11, 12, 22, 23] [13, 14, 24, 25] [15, 16, 26, 27] [17, 18, 28, 29] [19, 20, 30, 31] [23, 24, 34, 35] [25, 26, 36, 37] [27, 28, 38, 39] [29, 30, 40, 41] [31, 32, 42, 43] [33, 34, 44, 45] [35, 36, 46, 47] [37, 38, 48, 49] [39, 40, 50, 51] [41, 42, 52, 53] [45, 46, 56, 57] [47, 48, 58, 59] [49, 50, 60, 61] [51, 52, 62, 63] [53, 54, 64, 65] [55, 56, 66, 67] [57, 58, 68, 69] [59, 60, 70, 71] [61, 62, 72, 73] [63, 64, 74, 75] [67, 68, 78, 79] [69, 70, 80, 81] [71, 72, 82, 83] [73, 74, 84, 85] [75, 76, 86, 87] [77, 78, 88, 89] [79, 80, 90, 91] [81, 82, 92, 93] [83, 84, 94, 95] [85, 86, 96, 97] [89, 90, 100, 101] [91, 92, 102, 103] [93, 94, 104, 105] [95, 96, 106, 107] [97, 98, 108, 109] [99, 100, 110, 111] [101, 102, 112, 113] [103, 104, 114, 115] [105, 106, 116, 117] [107, 108, 118, 119] [0, 1] [2, 3] [4, 5] [6, 7] [8, 9] [111, 112] [113, 114] [115, 116] [117, 118] [119, 120]
Code ID 121-1-11-b · download JSON · raw on GitHub