[[70,8,10]] · QEC Challenge

[[70,8,10]] d =

kd²/n

11.429

X/Z

Share this result

Distance

X/Z asymmetry 1 · d_X = 10, d_Z = 10 · w_X = 8, w_Z = 8 (max(d_X,d_Z)/min(d_X,d_Z); each side carries its own earned tier: = certified exact, ≤ witness upper bound)

d_X 10 · witness weight 10 (claimed upper_bound)

witness operator (support, 10 qubits)

[7, 19, 25, 33, 40, 56, 57, 59, 61, 65]

d_Z 10 · witness weight 10 (claimed upper_bound)

witness operator (support, 10 qubits)

[7, 8, 22, 25, 32, 35, 37, 40, 56, 62]

certificate exact, d = 10 · CryptoMiniSat 5.14.7 SAT

X: no logical < 10 exists; Z: no logical < 10 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 4 · H_Z 4 (shortest cycle of each side’s Tanner graph; longer is friendlier to belief propagation)

check weights H_X 8 · H_Z 8

qubit degrees H_X 4 · H_Z 4

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

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

(1,4): 70 (2,4): 70 (2,6): 840 (3,4): 175 (3,6): 2905 (3,8): 11515 (3,10): 1155

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

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

(1,4): 70 (2,4): 70 (2,6): 840 (3,4): 175 (3,6): 2905 (3,8): 11515 (3,10): 1155

Construction & provenance

authors @MathysRennela

provenance submitted through the challenge

novelty novelty not audited

construction Published 2BGA database row from arXiv:2306.16400v1: SmallGroup(35,1), a=1+g3+g9+g27, b=1+g5+g26+g32.

builds on arXiv:2306.16400

date 2026-08-17

notes Published Lin–Pryadko baseline reconstructed from the authors public database at commit 403d194c3f98f0cadc236aecbc4a8b6139ccf23c. Paper reports exact d=10; repository records a witness-backed upper bound. Literature novelty is not claimed.

family generalized bicycle (a tag, not a ranking)

locality unrestricted (computed from the layout)

weight class weight ≤ 8 (computed)

How this code was found

the research note submitted with this code · raw markdown · all notes

[[70,8,10]] — published 2BGA code on SmallGroup(35,1)

Direction & hypothesis

This is a literature reconstruction for the weight-8 × unrestricted cell. The source is Lin--Pryadko, arXiv:2306.16400v1, whose public exhaustive database contains connected binary 2BGA rows not yet seeded on the challenge board.

What was searched

The authors' public database was audited at github.com/QEC-pages/2BGA-codes @ 403d194c3f98f0cadc236aecbc4a8b6139ccf23c. This row is SmallGroup(35,1) with database supports a=[3,9,27] and b=[5,26,32], using 1-based GAP positions excluding the identity. The identity was added and the group was rebuilt with GAP regular representations.

Evidence trail

The reconstructed matrices have n=70, k=8, maximum check weight 8, and CSS commutation. The repository submission builder generated persisted X/Z logical witnesses of weight 10. verify/validate_candidate.py returned passed: true, no lighter logical in 5,300 RIS trials, no exact duplicate, no WL-equivalent duplicate, and board_advancing: true for weight-8 × unrestricted.

The paper reports d=10; this submission records only the witness-backed upper bound d <= 10 with upper_bound confidence. Literature novelty is not claimed: this is a published baseline reconstruction.

Dead ends

No search beyond reconstruction was performed. The public database row was selected because its parameter set was absent from the board comparison and it passed the computed Pareto check.

Tools

GAP for SmallGroup enumeration and the repository's research/kit/group_algebra.py, submit.py, and trusted validator. The source database and GAP implementation are pinned above; no changes to verify/ were made.

Reproduction

Use GAP SmallGroup(35,1) and add the identity to the database supports: a=1+g3+g9+g27, b=1+g5+g26+g32, with the database's 1-based element positions. Construct H_X=[L(a)|R(b)] and H_Z=[R(b)^T|L(a)^T] over GF(2), then run the repository validator.

Parity checks

X-checks 35 (max weight 8) · Z-checks 35 (max weight 8)

H_X (35 checks, sparse supports)

[0, 17, 24, 32, 35, 46, 53, 69] [1, 19, 21, 28, 36, 50, 57, 59] [0, 2, 22, 34, 37, 45, 51, 58] [3, 23, 25, 31, 37, 38, 61, 63] [1, 4, 24, 26, 35, 39, 55, 62] [2, 5, 10, 27, 40, 50, 56, 63] [6, 9, 27, 33, 39, 41, 64, 66] [3, 7, 28, 29, 36, 40, 42, 65] [0, 4, 8, 30, 37, 43, 60, 66] [5, 9, 15, 31, 36, 44, 55, 61] [10, 13, 30, 34, 42, 45, 49, 68] [6, 11, 14, 31, 38, 43, 46, 67] [1, 7, 12, 32, 39, 44, 47, 68] [2, 8, 13, 33, 38, 40, 48, 64] [3, 9, 14, 20, 39, 49, 60, 65] [10, 15, 18, 33, 41, 47, 50, 54] [3, 11, 16, 19, 42, 48, 51, 69] [4, 12, 17, 34, 41, 43, 49, 52] [5, 6, 13, 18, 42, 44, 53, 67] [7, 14, 19, 25, 43, 54, 64, 68] [6, 15, 20, 23, 46, 52, 55, 59] [7, 16, 21, 24, 45, 47, 53, 56] [8, 10, 17, 22, 46, 48, 54, 57] [9, 11, 18, 23, 47, 49, 58, 69] [12, 19, 24, 29, 41, 48, 59, 67] [11, 20, 25, 28, 35, 51, 57, 60] [0, 12, 21, 26, 50, 52, 58, 61] [13, 15, 22, 27, 51, 53, 59, 62] [14, 16, 23, 28, 45, 52, 54, 63] [1, 16, 25, 29, 37, 56, 62, 64] [2, 17, 26, 30, 55, 57, 63, 65] [18, 20, 27, 31, 35, 56, 58, 66] [4, 21, 29, 32, 40, 61, 66, 67] [5, 22, 30, 33, 36, 60, 62, 68] [8, 26, 32, 34, 38, 44, 65, 69]

H_Z (35 checks, sparse supports)

[0, 4, 25, 31, 35, 37, 43, 61] [1, 7, 9, 33, 36, 39, 47, 64] [2, 3, 8, 29, 37, 40, 48, 65] [3, 11, 13, 34, 38, 42, 49, 51] [4, 6, 12, 14, 39, 43, 52, 67] [5, 7, 13, 32, 40, 44, 53, 68] [6, 15, 17, 24, 41, 46, 53, 55] [7, 10, 16, 18, 42, 47, 54, 56] [8, 11, 17, 19, 43, 48, 57, 69] [9, 12, 18, 34, 41, 44, 49, 58] [2, 10, 21, 28, 40, 45, 50, 57] [0, 11, 20, 22, 46, 51, 58, 60] [12, 15, 21, 23, 47, 52, 59, 61] [13, 16, 22, 24, 45, 48, 53, 62] [10, 14, 17, 23, 46, 49, 54, 63] [1, 5, 15, 26, 44, 50, 55, 62] [2, 16, 25, 27, 51, 56, 63, 64] [17, 20, 26, 28, 35, 52, 57, 65] [0, 18, 21, 27, 50, 53, 58, 66] [15, 19, 22, 28, 36, 51, 54, 59] [4, 9, 20, 30, 49, 55, 60, 66] [5, 21, 29, 31, 36, 56, 61, 67] [1, 22, 25, 30, 37, 57, 62, 68] [2, 23, 26, 31, 38, 55, 58, 63] [1, 20, 24, 27, 35, 39, 56, 59] [8, 14, 25, 33, 38, 54, 60, 64] [3, 9, 26, 32, 39, 61, 65, 69] [4, 27, 29, 33, 40, 41, 62, 66] [3, 5, 28, 30, 36, 42, 60, 63] [6, 13, 19, 29, 42, 59, 64, 67] [7, 14, 30, 34, 43, 45, 65, 68] [6, 8, 31, 32, 38, 44, 46, 66] [11, 18, 24, 32, 35, 47, 67, 69] [10, 12, 19, 33, 41, 48, 50, 68] [0, 16, 23, 34, 37, 45, 52, 69]

Code ID 70-8-10 · download JSON · raw on GitHub