In this paper, we establish the necessary and sufficient conditions for quasi-cyclic (QC) codes with index even to be symplectic self-orthogonal. Subsequently, we present the lower and upper bounds on the minimum symplectic distances of a class of 1-generator QC codes and their symplectic dual codes by decomposing code spaces. As an application, we construct many new binary symplectic self-orthogonal QC codes with excellent parameters, leading to 117 record-breaking quantum error-correction codes.

The error coefficient of a linear code is defined as the number of minimum-weight codewords. In an additive white Gaussian noise channel, optimal linear codes with the smallest error coefficients achieve the best possible asymptotic frame error rate (AFER) among all optimal linear codes under maximum likelihood decoding. Such codes are referred to as AFER-optimal linear codes. The Griesmer bound is essential for determining the optimality of linear codes. However, establishing tight lower bounds on the error coefficients of Griesmer optimal linear codes is challenging, and the linear programming bound often performs inadequately. In this paper, we propose several iterative lower bounds for the error coefficients of Griesmer optimal linear codes. Specifically, for binary linear codes, our bounds are tight in most cases when the dimension does not exceed 5. To evaluate the performance of our bounds when they are not tight, we also determine the parameters of the remaining 5-dimensional AFER-optimal linear codes. Our final comparison demonstrates that even when our bounds are not tight, they remain very close to the actual values, with a gap of less than or equal to 2.

In this work, we present a low-depth flagged syndrome extraction strategy for Calderbank-Shor-Steane (CSS) codes of distance 3. We demonstrate that if one stabilizer generator of a distance-3 CSS code measured using the flagged circuit has and only has two distinct qubit supports with certain stabilizers of opposite types, then the number of stabilizers required for the second round of measurements can be reduced. The number of these stabilizers depends on the weight of the measured generator. This novel strategy utilizes past syndrome information and elements from the stabilizer group, enabling the implementation of a flag-FTEC protocol for distance-3 CSS codes with lower-depth syndrome extraction circuits compared to previously flag fault-tolerant protocol if the total weight of these stabilizers is less than that of stabilizer generators. Based on our strategy, we also improve the flag-FTEC protocol for cyclic CSS codes of distance 3, which requires fewer stabilizer measurements. We utilize the$[[{14,2,3}]]$CSS code,$[[{15,1,3}]]$quantum Reed-Muller code and$[[{15,7,3}]]$cyclic CSS code to demonstrate how the strategy operates. Furthermore, we also provide a low-depth flagged syndrome extraction strategy for a$[[{19,1,5}]]$CSS-type code.

This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction. Subsequently, we propose generalized Construction X, which facilitates the construction of non-integer dimensional optimal additive codes from linear codes. Then, we construct ten classes of optimal quaternary non-integer dimensional additive codes through these two methods. As an application, we also determine the optimal additive$[n,3.5,n-t]_{4}$codes for all t with variable n, except for$t=6,7,12$.

The revelations about massive surveillance have created significant interest in algorithm substitution attack (ASA), where an honest implementation of a cryptographic primitive is replaced by a subverted one which can help “big brother" to break cryptographic security while generating output indistinguishable from the honest output. The current known ASAs on public-key cryptography are either dedicated for a type of concrete constructions with specific internal, or restrictive when applying to the real-word cryptographic standards (Ateniese et al., ACM CCS’15; Russell et al., ACM CCS’17; Chen et al., ASIACRYPT’20). In this paper, we first present a practical undetectable substitution for a general randomized algorithm with certain structure such that the randomness can be revealed to the big brother. Then, instantiating this randomized algorithm, we present a series of ASAs on core primitives in public-key cryptography including public-key encryption, key encapsulation mechanism, key exchange, and digital signature. In particular, our ASAs are universal in the sense that they do not rely on the internal description of the underlying cryptographic algorithm. Moreover, our ASAs are also practical since they can affect not only the widely deployed cryptographic standards, but also the ongoing NIST post-quantum standards.

The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of the same lengths and dimensions. This paper focuses on constructing additive codes that outperform linear codes based on quasi-cyclic codes and combinatorial methods. Firstly, we propose a lower bound on the symplectic distance of 1-generator quasi-cyclic codes of index even. Secondly, we get many binary quasi-cyclic codes with large symplectic distances utilizing computer-supported combination and search methods, all of which correspond to good quaternary additive codes. Notably, some additive codes have greater distances than best-known quaternary linear codes in Grassl’s code table (bounds on the minimum distance of quaternary linear codeshttps://www.codetables.de) for the same lengths and dimensions. Moreover, employing a combinatorial approach, we partially determine the parameters of optimal quaternary additive 3.5-dimensional codes with lengths from 28 to 254. Finally, as an extension, we also construct some good additive complementary dual codes with larger distances than the best-known quaternary linear complementary dual codes in the literature.

In this paper, we construct a new family of quantum synchronizable codes from repeated-root cyclic codes of lengths psand lpsover Fq, where s 1 andl ≥ 2 are integers, and p ≥ 3 is the odd characteristic. Within some loose limitations, these synchronizable codes can possess the best possible capability in synchronization recovery, and therefore, enriches the variety of good quantum synchronizable codes. Furthermore, by using known techniques in classical coding theory which convert the computation of the minimum distance of a repeated-root cyclic code to that of a shorter simple-root cyclic code, we prove that the repeated-root cyclic codes of lengths ps and l ps are in general better than narrow-sense BCH codes of close lengths in terms of minimum distances, and thereby enable the obtained synchronizable codes to correct more Pauli errors.