Abstract We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized monomial-Cartesian codes arise from polynomials inmvariables. When m=1 m=1 our codes are MDS, and when m=2 m=2 and our lower bound for the minimum distance is 3, the codes are at least Hermitian almost MDS. For an infinite family of parameters, when m=2 m=2 we prove that our codes beat the Gilbert–Varshamov bound. We also present many examples of our codes that are better than any known code in the literature.
We generalise the implementation of logical quantum gates via Dehn twists from topological codes to the hypergraph and balanced products of cyclic codes. These generalised Dehn twists implement logical entangling gates with no additional qubit overhead andO(d)time overhead. Due to having more logical degrees of freedom in the codes, there is a richer structure of attainable logical gates compared to those for topological codes. To illustrate the scheme, we focus on families of hypergraph and balanced product codes that scale as [[18q2, 8, 2q]]q∈Nand [[18q, 8,≤ 2q]]q∈Nrespectively. For distance 6 to 12 hypergraph product codes, we find that the set of twists and fold-transversal gates generate the full logical Clifford group. For the balanced product code, we show that Dehn twists apply to codes in this family with oddq. We also show that the [[90, 8, 10]] bivariate bicycle code is a member of the balanced product code family that saturates the distance bound, and find other balanced product codes that saturate the bound up toq≤ 8 through a numerical search.
Divisible codes have been studied for many years, since the divisibility theorem on binary cyclic codes was proved by R. J. McEliece in 1972 and divisible codes were introduced by H. N. Ward in 1981. It is well-known that doubly even (4-divisible) binary codes can be used to construct stabilizer quantum codes. Triorthogonal binary codes and CSS-T pairs of binary codes were introduced to construct CSS-T quantum codes. In this paper, we show that 8-divisible (triply even) binary linear codes are triorthogonal codes and CSS-T pairs of codes can be obtained from 8-divisible codes directly. Infinitely many infinite families of2r-divisible optimal binary codes are presented, for an arbitrarily large positive integerr. Seventeen doubly even (self-orthogonal) binary cyclic codes and five triply even binary cyclic codes with their minimum weights equal to the minimum weights of best-known linear codes are found. An infinite family of rate around21explicit doubly even (self-orthogonal) binary cyclic codes with the lower boundlogninion their minimum distances and the lower bound2nion their dual distances is constructed. This is much stronger than the main results in two previous papers published in IEEE Transactions on Information Theory, 2022 and 2024 by C. Ding, C. Tang, Z. Sun and C. Li. Many CSS-T quantum codes with new parameters are constructed. Many stabilizer quantum codes given in this paper have distances close to the best-known ones documented in Grassl’s database.