Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2501.01549 · Discrete Mathematics Algorithms and Applications

Quantum error correction with Goppa codes from maximal curves: Design, simulation, and performance

Vahid Nourozi

Published Dec 13, 2024• 0 citations
arXivHTMLPDF

Abstract

This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form [Formula: see text]. We investigate algebraic geometric and quantum stabilizer codes associated with these maximal curves and propose modifications to improve their parameters. The theoretical analysis is complemented by extensive simulation results, which validate the performance of these codes under various error rates. We provide concrete examples of the constructed codes, comparing them with known results to highlight their strengths and trade-offs. The simulation data, presented through detailed graphs and tables, offers insights into the practical behavior of these codes in noisy environments. Our findings demonstrate that while the constructed codes may not always achieve optimal minimum distances, they offer systematic construction methods and interesting parameter trade-offs that could be valuable in specific applications or for further theoretical study.

DOI
10.1142/s1793830925500090

Related papers

Constructions of asymmetric quantum stabilizer codes based on classical Goppa codes

Ji Fan

Since Calderbank et al.established CRSS construction,which constructs quantum error-correcting codes(QECC) from classical error-correcting codes,many QECC demonstrating good performance have been constructed from classical error-correcting codes;these codes are referred to as quantum stabilizer codes.Recent physical experiments indicate that the probabilities of occurrence of qubit-flip errors are much less than those of phase-flip errors in most quantum mechanical systems.Error-correcting codes thus constructed are referred to as asymmetric quantum codes.In this paper,series of asymmetric quantum stabilizer codes are constructed using nested Goppa codes and dual contained Goppa codes.In the construction of asymmetric quantum codes based on nested Goppa codes,the choice of Goppa codes is limited to construct codes with analysis methods.In normal circumstances,the construction is executed with the help of mathematical software Matlab,which is used to compute the minimum distance of Goppa codes.In the construction of asymmetric quantum codes based on dual contained Goppa codes,the error correction ability of the codes constructed in this paper is reflected in the correction of Z-type errors.

Scientia Sinica Informationis•Jan 1, 2013•0 citations

基于经典Goppa 码的非对称量子稳定子码构造

Yue RAN, Juan XU, Hanwu Chen +2 more

Since Calderbank et al. established CRSS construction, which constructs quantum error-correcting codes (QECC) from classical error-correcting codes, many QECC demonstrating good performance have been constructed from classical error-correcting codes; these codes are referred to as quantum stabilizer codes. Recent physical experiments indicate that the probabilities of occurrence of qubit- ip errors are much less than those of phase- ip errors in most quantum mechanical systems. Error-correcting codes thus constructed are referred to as asymmetric quantum codes. In this paper, series of asymmetric quantum stabilizer codes are constructed using nested Goppa codes and dual contained Goppa codes. In the construction of asymmetric quantum codes based on nested Goppa codes, the choice of Goppa codes is limited to construct codes with analysis methods. In normal circumstances, the construction is executed with the help of mathematical software Matlab, which is used to compute the minimum distance of Goppa codes. In the construction of asymmetric quantum codes based on dual contained Goppa codes, the error correction ability of the codes constructed in this paper is re ected in the correction of Z-type errors

Scientia Sinica Informationis•Mar 1, 2013•0 citations

A polynomial-time construction of self-orthogonal codes and applications to quantum error correction

Mitsuru Hamada

A polynomial-time construction of a sequence of self-orthogonal geometric Goppa codes attaining the Tsfasman-Vladut-Zink (TVZ) bound is presented. The issue of constructing such a code sequence was addressed in a context of constructing quantum error-correcting codes (Ashikhmin et al., 2001). Naturally, the obtained construction has implications on quantum error-correcting codes. In particular, the best known asymptotic lower bounds on the largest minimum distance of polynomially constructible quantum error-correcting codes are improved.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2009•0 citations

Quantum Goppa Codes over Hyperelliptic Curves

Annika Niehage

This Diplom thesis provides an explicit construction of a quantum Goppa code for any hyperelliptic curve over a non-binary field. Hyperelliptic curves have conjugate pairs of rational places. We use these pairs to construct self-orthogonal classical Goppa codes with respect to a weighted inner product. These codes are also self-orthogonal with respect to a symplectic inner product and therefore define quantum stabilizer codes. A final transformation leads to a quantum Goppa code with respect to the standard symplectic inner product. Some examples illustrate the described construction. Furthermore we present a projection of a higher dimensional code onto the base field and a special case when the projected code is again weighted self-orthogonal and symmetric.

arXiv:quant-ph/0501074•Jan 14, 2005•1 citation

Error Correcting Quantum Codes and Algebraic Curves

Artur Elezi

The goal of this paper is twofold. First, to provide a self contained, detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes and their connection to self-orthogonal linear codes. This has been done without venturing that much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs, some of which are new, that we present here. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed. The second goal is the construction of some stabilizer codes via self-orthogonal linear codes associated to algebraic curves.

NATO science for peace and security series. D, Information and communication security•Jan 1, 2015•0 citations

Entanglement-assisted quantum codes from algebraic geometry codes

Francisco Revson F. Pereira, Ruud Pellikaan, Giuliano G. La Guardia +1 more

Quantum error correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error correcting codes to achieve higher rates than the one obtained via traditional stabilizer formalism. Such codes are called entanglement-assisted quantum (QUENTA) codes. In this paper, we use algebraic geometry codes to construct three families of QUENTA codes, where one of them has maximal entanglement and is maximal distance separable. At the end, we show that for any asymptotically good tower of algebraic function fields there is an asymptotically good family of maximal entanglement QUENTA codes with nonzero rate, relative minimal distance, and relative amount of entanglement

•Jan 1, 2019•24 citations
This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form [Formula: see text]. We investigate algebraic geometric and quantum stabilizer codes associated with these maximal curves and propose modifications to improve their parameters. The theoretical analysis is complemented by extensive simulation results, which validate the performance of these codes under various error rates. We provide concrete examples of the constructed codes, comparing them with known results to highlight their strengths and trade-offs. The simulation data, presented through detailed graphs and tables, offers insights into the practical behavior of these codes in noisy environments. Our findings demonstrate that while the constructed codes may not always achieve optimal minimum distances, they offer systematic construction methods and interesting parameter trade-offs that could be valuable in specific applications or for further theoretical study.
Since Calderbank et al.established CRSS construction,which constructs quantum error-correcting codes(QECC) from classical error-correcting codes,many QECC demonstrating good performance have been constructed from classical error-correcting codes;these codes are referred to as quantum stabilizer codes.Recent physical experiments indicate that the probabilities of occurrence of qubit-flip errors are much less than those of phase-flip errors in most quantum mechanical systems.Error-correcting codes thus constructed are referred to as asymmetric quantum codes.In this paper,series of asymmetric quantum stabilizer codes are constructed using nested Goppa codes and dual contained Goppa codes.In the construction of asymmetric quantum codes based on nested Goppa codes,the choice of Goppa codes is limited to construct codes with analysis methods.In normal circumstances,the construction is executed with the help of mathematical software Matlab,which is used to compute the minimum distance of Goppa codes.In the construction of asymmetric quantum codes based on dual contained Goppa codes,the error correction ability of the codes constructed in this paper is reflected in the correction of Z-type errors.
Since Calderbank et al. established CRSS construction, which constructs quantum error-correcting codes (QECC) from classical error-correcting codes, many QECC demonstrating good performance have been constructed from classical error-correcting codes; these codes are referred to as quantum stabilizer codes. Recent physical experiments indicate that the probabilities of occurrence of qubit- ip errors are much less than those of phase- ip errors in most quantum mechanical systems. Error-correcting codes thus constructed are referred to as asymmetric quantum codes. In this paper, series of asymmetric quantum stabilizer codes are constructed using nested Goppa codes and dual contained Goppa codes. In the construction of asymmetric quantum codes based on nested Goppa codes, the choice of Goppa codes is limited to construct codes with analysis methods. In normal circumstances, the construction is executed with the help of mathematical software Matlab, which is used to compute the minimum distance of Goppa codes. In the construction of asymmetric quantum codes based on dual contained Goppa codes, the error correction ability of the codes constructed in this paper is re ected in the correction of Z-type errors
A polynomial-time construction of a sequence of self-orthogonal geometric Goppa codes attaining the Tsfasman-Vladut-Zink (TVZ) bound is presented. The issue of constructing such a code sequence was addressed in a context of constructing quantum error-correcting codes (Ashikhmin et al., 2001). Naturally, the obtained construction has implications on quantum error-correcting codes. In particular, the best known asymptotic lower bounds on the largest minimum distance of polynomially constructible quantum error-correcting codes are improved.
This Diplom thesis provides an explicit construction of a quantum Goppa code for any hyperelliptic curve over a non-binary field. Hyperelliptic curves have conjugate pairs of rational places. We use these pairs to construct self-orthogonal classical Goppa codes with respect to a weighted inner product. These codes are also self-orthogonal with respect to a symplectic inner product and therefore define quantum stabilizer codes. A final transformation leads to a quantum Goppa code with respect to the standard symplectic inner product. Some examples illustrate the described construction. Furthermore we present a projection of a higher dimensional code onto the base field and a special case when the projected code is again weighted self-orthogonal and symmetric.
The goal of this paper is twofold. First, to provide a self contained, detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes and their connection to self-orthogonal linear codes. This has been done without venturing that much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs, some of which are new, that we present here. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed. The second goal is the construction of some stabilizer codes via self-orthogonal linear codes associated to algebraic curves.
Quantum error correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error correcting codes to achieve higher rates than the one obtained via traditional stabilizer formalism. Such codes are called entanglement-assisted quantum (QUENTA) codes. In this paper, we use algebraic geometry codes to construct three families of QUENTA codes, where one of them has maximal entanglement and is maximal distance separable. At the end, we show that for any asymptotically good tower of algebraic function fields there is an asymptotically good family of maximal entanglement QUENTA codes with nonzero rate, relative minimal distance, and relative amount of entanglement