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:1808.06487

Toric Varieties and Codes, Error-correcting Codes, Quantum Codes, Secret Sharing and Decoding

Johan P. Hansen

Published Aug 20, 2018• 2 citations
arXivHTMLPDF

Abstract

Toric varieties and their associated toric codes, as well as determination of their parameters with intersection theory, are presented in the two dimensional case. Linear Secret Sharing Schemes with strong multiplication are constructed from toric varieties and codes by the J. L. Massey construction. Asymmetric Quantum Codes are obtained from toric codes by the A.R. Calderbank, P.W. Shor and A.M. Steane construction of stabilizer codes from linear codes containing their dual codes. Decoding of a class of toric codes is presented.

DOI
10.48550/arxiv.1808.06487

Related papers

Quantum Codes From Toric Surfaces

Johan P. Hansen

A theory for constructing quantum error correcting codes from Toric surfaces by the Calderbank-Shor-Steane method is presented. In particular, we study the method on toric Hirzebruch surfaces. The results are obtained by constructing a dualizing differential form for the toric surface and by using the cohomology and the intersection theory of toric varieties.

arXiv:1203.4544•IEEE Transactions on Information Theory•Oct 19, 2012•6 citations

Asymmetric Quantum Codes on Toric Surfaces

Johan P. Hansen

Asymmetric quantum error-correcting codes are quantum codes defined over biased quantum channels: qubit-flip and phase-shift errors may have equal or different probabilities. The code construction is the Calderbank-Shor-Steane construction based on two linear codes. We present families of toric surfaces, toric codes and associated asymmetric quantum error-correcting codes.

arXiv:1708.02921•Aug 9, 2017•1 citation

Linear Codes Over Finite Fields From Lattice Polytopes: Structure, Duality, and Quantum Constructions

Sihem Mesnager, Rameez Raja

Linear codes constructed from combinatorial and geometric structures have played a central role in both classical and quantum coding theory. In this paper, we discuss a class of linear codes over finite fields, calledpolytope codes, obtained via defining sets derived from lattice polytopes. Unlike evaluation-based constructions, our approach exploits the intersection structure of polytope faces to directly control the algebraic and metric properties of the resulting codes. We develop a general defining-set framework for polytope codes and explicitly determine their lengths, dimensions, minimum distances, and Hamming weight distributions. This leads to infinite families of projective, few-weight, distance-optimal, and almost distance-optimal codes. Sufficient conditions for minimality are derived, resulting in new minimal codes that are well suited for applications to secret-sharing schemes. We further study the duals and hulls of polytope codes and provide explicit characterizations of self-orthogonal and linear complementary dual (LCD) families. One of the central results of the paper is a complete classification of quantum codes arising from polytope codes via the Calderbank-Shor-Steane (CSS) construction. We show that the geometry of face intersections fully determines whether the resulting quantum code is a standard CSS code, an LCD-based code, or an entanglement-assisted quantum error-correcting code, and we explicitly compute the required entanglement in the latter case. As a consequence, new families of binary, ternary, and prime-power quantum codes with previously unattained parameters are obtained. The proposed polytope-based framework unifies classical and quantum code constructions under a common geometric principle and opens new avenues for applications in cryptography, distributed storage, and quantum information processing.Mathematics Subject Classification. 94B05, 52B20, 11T71, 94A62, 94A45.

IEEE Transactions on Information Theory•Sep 7, 2026•0 citations

Quantum Error Correction: Decoders for the Toric Code

Nando Leijenhorst

Quantum error correction is needed for future quantum computers. Classical error correcting codes are not suitable for this due to the nature of quantum mechanics. Therefore, new codes need to be developed. A promising candidate is the toric code, a surface code, because of its locality and its high error correcting capability and thresholds (the error probability below which increasing the size of the code decreases the failure rate). This thesis provides an introduction to quantum error correction and the stabilizer formalism, which is used to introduce the toric code. Several decoders are looked at, including the Minimum Weight Perfect Matching (MWPM) decoder and a recently developed decoder, the Union-Find (UF) decoder. The UF decoder is useful because of its almost-linear time complexity, while only reducing the threshold by a marginal amount compared to the MWPM decoder. In this thesis, the time complexity of the weighted growth version of the UF decoder is analysed. The toric code and the decoders have been implemented and simulated, and the thresholds have been determined. For the MWPM decoder, the threshold was determined to be 11.5±0.2%, which is not in agreement with the threshold in literature of 10.3%, and should not be possible according to the optimal threshold of about 11%. This probably is a result of the low grid sizes (up to a gridsize of 11) of the code used due to the time needed to simulate the MWPM decoder. For the UF decoder, the threshold found was 9.7 ± 0.9%, which is in agreement with the threshold of 9.9% found by N. Delfosse and N. Nickerson. The time complexity of the UF decoder has also been determined, and is indeed almost-linear as expected by the analysis.

•Jan 1, 2019•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

On pure MDS asymmetric entanglement-assisted quantum error-correcting codes

Ziteng Huang, Weijun Fang, Fang‐Wei Fu

Recently, Galindo et al. introduced the concept of asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) from Calderbank-Shor-Steane (CSS) construction. In general, it's difficult to determine the required number of maximally entangled states of an AEAQECC, which is associated with the dimension of the intersection of the two corresponding linear codes. Two linear codes are said to be a linear l-intersection pair if their intersection has dimension l. In this paper, all possible linear l-intersection pairs of MDS codes are given. As an application, we give a complete characterization of pure MDS AEAQECCs for all possible parameters.

arXiv:2107.04166•Jul 9, 2021•2 citations
Toric varieties and their associated toric codes, as well as determination of their parameters with intersection theory, are presented in the two dimensional case. Linear Secret Sharing Schemes with strong multiplication are constructed from toric varieties and codes by the J. L. Massey construction. Asymmetric Quantum Codes are obtained from toric codes by the A.R. Calderbank, P.W. Shor and A.M. Steane construction of stabilizer codes from linear codes containing their dual codes. Decoding of a class of toric codes is presented.
Linear codes constructed from combinatorial and geometric structures have played a central role in both classical and quantum coding theory. In this paper, we discuss a class of linear codes over finite fields, calledpolytope codes, obtained via defining sets derived from lattice polytopes. Unlike evaluation-based constructions, our approach exploits the intersection structure of polytope faces to directly control the algebraic and metric properties of the resulting codes. We develop a general defining-set framework for polytope codes and explicitly determine their lengths, dimensions, minimum distances, and Hamming weight distributions. This leads to infinite families of projective, few-weight, distance-optimal, and almost distance-optimal codes. Sufficient conditions for minimality are derived, resulting in new minimal codes that are well suited for applications to secret-sharing schemes. We further study the duals and hulls of polytope codes and provide explicit characterizations of self-orthogonal and linear complementary dual (LCD) families. One of the central results of the paper is a complete classification of quantum codes arising from polytope codes via the Calderbank-Shor-Steane (CSS) construction. We show that the geometry of face intersections fully determines whether the resulting quantum code is a standard CSS code, an LCD-based code, or an entanglement-assisted quantum error-correcting code, and we explicitly compute the required entanglement in the latter case. As a consequence, new families of binary, ternary, and prime-power quantum codes with previously unattained parameters are obtained. The proposed polytope-based framework unifies classical and quantum code constructions under a common geometric principle and opens new avenues for applications in cryptography, distributed storage, and quantum information processing.Mathematics Subject Classification. 94B05, 52B20, 11T71, 94A62, 94A45.
Quantum error correction is needed for future quantum computers. Classical error correcting codes are not suitable for this due to the nature of quantum mechanics. Therefore, new codes need to be developed. A promising candidate is the toric code, a surface code, because of its locality and its high error correcting capability and thresholds (the error probability below which increasing the size of the code decreases the failure rate). This thesis provides an introduction to quantum error correction and the stabilizer formalism, which is used to introduce the toric code. Several decoders are looked at, including the Minimum Weight Perfect Matching (MWPM) decoder and a recently developed decoder, the Union-Find (UF) decoder. The UF decoder is useful because of its almost-linear time complexity, while only reducing the threshold by a marginal amount compared to the MWPM decoder. In this thesis, the time complexity of the weighted growth version of the UF decoder is analysed. The toric code and the decoders have been implemented and simulated, and the thresholds have been determined. For the MWPM decoder, the threshold was determined to be 11.5±0.2%, which is not in agreement with the threshold in literature of 10.3%, and should not be possible according to the optimal threshold of about 11%. This probably is a result of the low grid sizes (up to a gridsize of 11) of the code used due to the time needed to simulate the MWPM decoder. For the UF decoder, the threshold found was 9.7 ± 0.9%, which is in agreement with the threshold of 9.9% found by N. Delfosse and N. Nickerson. The time complexity of the UF decoder has also been determined, and is indeed almost-linear as expected by the analysis.
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.
Recently, Galindo et al. introduced the concept of asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) from Calderbank-Shor-Steane (CSS) construction. In general, it's difficult to determine the required number of maximally entangled states of an AEAQECC, which is associated with the dimension of the intersection of the two corresponding linear codes. Two linear codes are said to be a linear l-intersection pair if their intersection has dimension l. In this paper, all possible linear l-intersection pairs of MDS codes are given. As an application, we give a complete characterization of pure MDS AEAQECCs for all possible parameters.