Three new weight-6 BB codes: two and one
OpenBBCode.new_codesThe three bivariate-bicycle codes of Table 9 have the stated parameters, with :
- over , , : ;
- over , , : ;
- over , , : .
Here , ,
and each distance is the minimum weight of a nontrivial logical in that sector. These codes encode 25% and 50% more logical qubits than the best distance-12 weight-6 code previously reported.
Formalization Note IsCode is defined in BBCode_Setting.
import Mathlib import Definitions.Def_BBCode_Setting
namespace BBCode
theorem new_codes :
IsCode (l := 2) (m := 84) {(0, 0), (0, 1), (1, 5)} {(0, 0), (0, 4), (0, 62)} 336 20 12 ∧
IsCode (l := 2) (m := 84) {(0, 0), (0, 1), (1, 5)} {(0, 0), (0, 20), (0, 46)} 336 20 12 ∧
IsCode (l := 6) (m := 30) {(0, 0), (0, 1), (1, 2)} {(0, 0), (0, 8), (2, 16)} 360 24 12 := by
sorry
end BBCodeRead-back
What the Lean code literally says, in plain math · claude-opus-5-5
This is the conjunction of three code-parameter claims, identical to the three separate statements for the codes below. In each case and stands for .
- , , , : parameters .
- , , the same , : parameters .
- , , , : parameters .
Unfolded definitions used below. For write ; an element stands for the monomial , and a "polynomial" is a finite subset (its support, coefficients in ). The circulant is the matrix over with iff and otherwise. The qubit set is (a left block and a right block , ). The check matrices (rows indexed by , columns by ) are
with the first block on and the second on . A vector is a nontrivial Z-logical if and (the -span of the rows of ); it is a nontrivial X-logical if and . The weight is the number of nonzero coordinates of .
For each code, "parameters " means all of: (a) (arithmetic: , ); (b) ; (c) some nontrivial X-logical has weight exactly and every nontrivial X-logical has weight ; (d) the same for Z-logicals. Thus each claims exact distance in both sectors. In codes 1 and 2, involves only powers of . No connectivity of the Tanner graph is asserted for any of the three codes.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.