On certain self-orthogonal AG codes with applications to quantum error-correcting codes (Q2034988)

Quantum error-correcting codes play a central role in the suppression of noise and decoherence in a quantum system. One of the most celebrated constructions of quantum codes is the so-called CSS construction, which allows constructing quantum stabilizer codes from classical linear block codes, provided that certain orthogonality properties are satisfied. A particularly fruitful class of linear codes employed in constructing good quantum codes consists of algebraic geometry (AG) codes. Such codes, which also play a central role in coding theory (e.g.they are one of the few families of asymptotically good codes), are constructed from algebraic curves over finite fields. Many quantum codes have been constructed by AG codes from particular curves, and among these we some of the most famous arise from Castle curves, weak Castle curves, and maximal curves. In this paper, the authors generalize the construction of quantum codes from particular curves due to \textit{F. Hernando} et al. [``Quantum codes from a new construction of self-orthogonal algebraic geometry codes'', Quantum Inf. Process. 19, Paper No. 117 (2020; \url{doi:10.1007/s11128-020-2616-8})] by defining the so-called Swiss curves. These curves, that include many other famous ones such as GK curve, GGS curve, and Abdón-Bezerra-Quoos curve, are shown to be particularly good for the construction of performing quantum codes. The authors also provide a generalization through the definition of \(r\)-Swiss curves in Section 5.