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

Constructions and decoding procedures for quantum CSS codes

Yannick Saouter, Massinissa Zenia, Gilles Burel

Published Feb 5, 2025• 1 citation
arXivHTMLPDF

Abstract

This article presents new constructions of quantum error correcting Calderbank-Shor-Steane (CSS for short) codes. These codes are mainly obtained by Sloane's classical combinations of linear codes applied here to the case of self-orthogonal linear codes. A new algebraic decoding technique is also introduced. This technique is exemplified on CSS codes obtained from BCH, Reed-Muller and projective geometry codes.

DOI
10.48550/arxiv.2502.03242

Related papers

Algebraic decoding for classes of quantum codes

Yannick Saouter, Gilles Burel

This paper describes a technique to perform the decoding of quantum Calderbank-Steane-Shor codes built from self-orthogonal classical binary codes possessing algebraic decoding procedures. This technique gives a viable alternative to syndrome decoding for codes with large minimum distance. The cases of Reed-Muller and BCH codes are examined. The new method is compared with syndrome decoding on illustrative examples. The asymptotic cost of both methods is also given. Index Terms-quantum code, algebraic decoding, CSS quantum codes.

IEEE International Mediterranean Conference on Communications and Networking (MeditCom)•Jul 8, 2024•0 citations

Permutationally decodable CSS quantum codes

Massinissa Zenia, Yannick Saouter, Gilles Burel +1 more

Quantum error-correcting codes are essential for protecting quantum information against decoherence. This work investigates the construction of quantum CSS codes from classical self-orthogonal binary linear codes derived from extended quadratic residue codes. By exploiting the large automorphism groups of these codes, the minimum-weight codewords are partitioned according to the action of maximal subgroups of the automorphism group. Codes generated from these partitions are shown to be self-orthogonal and to retain large automorphism groups, allowing the construction of associated quantum CSS codes with good parameters. The resulting codes include new quantum codes with lengths ranging from 16 to 48 and minimum distances up to 11. Their automorphism groups and permutation-decoding properties are also analyzed, including the number of permutations required for complete decoding. The results provide new families of quantum CSS codes combining good error-correcting parameters, large automorphism groups, and efficient permutation decoding.

•Nov 12, 2025•0 citations

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Mitsuru Hamada

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.

arXiv:quant-ph/0610195•IEEE Transactions on Information Theory•Dec 1, 2008•54 citations

Self-Orthogonal Codes Constructed from Posets and Their Applications in Quantum Communication

Yansheng Wu, Yoonjin Lee

It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum error correction, CSS codes are a special type of stabilizer codes constructed from classical codes with some special properties, and the CSS construction of quantum codes is a well-known construction. First, we employ hierarchical posets with two levels for construction of binary linear codes. Second, we find some necessary and sufficient conditions for these linear codes constructed using posets to be self-orthogonal, and we use these self-orthogonal codes for obtaining binary quantum codes. Finally, we obtain four infinite families of binary quantum codes for which the minimum distances are three or four by CSS construction, which include binary quantum Hamming codes with length n≥7. We also find some (almost) “optimal” quantum codes according to the current database of Grassl. Furthermore, we explicitly determine the weight distributions of these linear codes constructed using posets, and we present two infinite families of some optimal binary linear codes with respect to the Griesmer bound and a class of binary Hamming codes.

Mathematics•Sep 3, 2020•8 citations

Quantum error correcting codes based on privacy amplification

Zhicheng Luo

Calderbank-Shor-Steane (CSS) quantum error-correcting codes are based on pairs of classical codes which are mutually dual containing. Explicit constructions of such codes for large blocklengths and with good error correcting properties are not easy to find. In this paper we propose a construction of CSS codes which combines a classical code with a two-universal hash function. We show, using the results of Renner and Koenig, that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. While the bit-flip errors can be decoded as efficiently as the classical code used, the problem of efficiently decoding the phase-flip errors remains open.

arXiv:0808.1392•Aug 10, 2008•2 citations

Classical product code constructions for quantum Calderbank-Shor-Steane codes

Dimiter Ostrev, Davide Orsucci, Francisco Lázaro +1 more

Several notions of code products are known in quantum error correction, such as hypergraph products, homological products, lifted products, balanced products, to name a few. In this paper we introduce a new product code construction which is a natural generalization of classical product codes to quantum codes: starting from a set of component Calderbank-Shor-Steane (CSS) codes, a larger CSS code is obtained where both X parity checks and Z parity checks are associated to classical product codes. We deduce several properties of product CSS codes from the properties of the component codes, including bounds to the code distance, and show that built-in redundancies in the parity checks result in so-called meta-checks which can be exploited to correct syndrome read-out errors. We then specialize to the case of single-parity-check (SPC) product codes which in the classical domain are a common choice for constructing product codes. Logical error rate simulations of a SPC 3 -fold product CSS code having parameters [[512,174,8]] are shown under both a maximum likelihood decoder for the erasure channel and belief propagation decoding for depolarizing noise. We compare the results with other codes of comparable length and dimension, including a code from the family of asymptotically good Tanner codes. We observe that our reference product CSS code outperforms all the other examined codes.

arXiv:2209.13474•Quantum•Jul 22, 2024•13 citations
This article presents new constructions of quantum error correcting Calderbank-Shor-Steane (CSS for short) codes. These codes are mainly obtained by Sloane's classical combinations of linear codes applied here to the case of self-orthogonal linear codes. A new algebraic decoding technique is also introduced. This technique is exemplified on CSS codes obtained from BCH, Reed-Muller and projective geometry codes.
This paper describes a technique to perform the decoding of quantum Calderbank-Steane-Shor codes built from self-orthogonal classical binary codes possessing algebraic decoding procedures. This technique gives a viable alternative to syndrome decoding for codes with large minimum distance. The cases of Reed-Muller and BCH codes are examined. The new method is compared with syndrome decoding on illustrative examples. The asymptotic cost of both methods is also given. Index Terms-quantum code, algebraic decoding, CSS quantum codes.
Quantum error-correcting codes are essential for protecting quantum information against decoherence. This work investigates the construction of quantum CSS codes from classical self-orthogonal binary linear codes derived from extended quadratic residue codes. By exploiting the large automorphism groups of these codes, the minimum-weight codewords are partitioned according to the action of maximal subgroups of the automorphism group. Codes generated from these partitions are shown to be self-orthogonal and to retain large automorphism groups, allowing the construction of associated quantum CSS codes with good parameters. The resulting codes include new quantum codes with lengths ranging from 16 to 48 and minimum distances up to 11. Their automorphism groups and permutation-decoding properties are also analyzed, including the number of permutations required for complete decoding. The results provide new families of quantum CSS codes combining good error-correcting parameters, large automorphism groups, and efficient permutation decoding.
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.
It is an important issue to search for self-orthogonal codes for construction of quantum codes by CSS construction (Calderbank-Sho-Steane codes); in quantum error correction, CSS codes are a special type of stabilizer codes constructed from classical codes with some special properties, and the CSS construction of quantum codes is a well-known construction. First, we employ hierarchical posets with two levels for construction of binary linear codes. Second, we find some necessary and sufficient conditions for these linear codes constructed using posets to be self-orthogonal, and we use these self-orthogonal codes for obtaining binary quantum codes. Finally, we obtain four infinite families of binary quantum codes for which the minimum distances are three or four by CSS construction, which include binary quantum Hamming codes with length n≥7. We also find some (almost) “optimal” quantum codes according to the current database of Grassl. Furthermore, we explicitly determine the weight distributions of these linear codes constructed using posets, and we present two infinite families of some optimal binary linear codes with respect to the Griesmer bound and a class of binary Hamming codes.
Calderbank-Shor-Steane (CSS) quantum error-correcting codes are based on pairs of classical codes which are mutually dual containing. Explicit constructions of such codes for large blocklengths and with good error correcting properties are not easy to find. In this paper we propose a construction of CSS codes which combines a classical code with a two-universal hash function. We show, using the results of Renner and Koenig, that the communication rates of such codes approach the hashing bound on tensor powers of Pauli channels in the limit of large block-length. While the bit-flip errors can be decoded as efficiently as the classical code used, the problem of efficiently decoding the phase-flip errors remains open.
Several notions of code products are known in quantum error correction, such as hypergraph products, homological products, lifted products, balanced products, to name a few. In this paper we introduce a new product code construction which is a natural generalization of classical product codes to quantum codes: starting from a set of component Calderbank-Shor-Steane (CSS) codes, a larger CSS code is obtained where both X parity checks and Z parity checks are associated to classical product codes. We deduce several properties of product CSS codes from the properties of the component codes, including bounds to the code distance, and show that built-in redundancies in the parity checks result in so-called meta-checks which can be exploited to correct syndrome read-out errors. We then specialize to the case of single-parity-check (SPC) product codes which in the classical domain are a common choice for constructing product codes. Logical error rate simulations of a SPC 3 -fold product CSS code having parameters [[512,174,8]] are shown under both a maximum likelihood decoder for the erasure channel and belief propagation decoding for depolarizing noise. We compare the results with other codes of comparable length and dimension, including a code from the family of asymptotically good Tanner codes. We observe that our reference product CSS code outperforms all the other examined codes.