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.04310 · IEEE Transactions on Information Theory

Characterizing the Burst Error Correction Ability of Quantum Cyclic Codes

Jihao Fan, Min-Hsiu Hsieh

Published Feb 2, 2026• 2 citations
arXivHTMLPDF

Abstract

Quantum burst error correction codes (QBECCs) are of great importance to deal with the memory effect in quantum channels. As the most important family of QBECCs, quantum cyclic codes (QCCs) play a vital role in the correction of burst errors. In this work, we characterize the burst error correction ability of QCCs constructed from the Calderbank-Shor-Steane (CSS) and the Hermitian constructions. We determine the burst error correction limit of QCCs and quantum Reed-Solomon codes with algorithms in polynomial-time complexities. As a result, lots of QBECCs saturating the quantum Reiger bound are obtained. We show that quantum Reed-Solomon codes have better burst error correction abilities than the previous results. At last, we give the quantum error-trapping decoder (QETD) of QCCs for decoding burst errors. The decoder runs in linear time and can decode both degenerate and nondegenerate burst errors. What’s more, the numerical results show that QETD can decode much more degenerate burst errors than the nondegenerate ones.

DOI
10.1109/tit.2026.3659999

Related papers

Construction and Performance of Quantum Burst Error Correction Codes for Correlated Errors

Jihao Fan, Min-Hsiu Hsieh, Hanwu Chen +2 more

In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat such error patterns in the quantum regime. Our contributions are as follows. Firstly, we derive an upper bound for the correctable burst errors of QBECCs, the quantum Reiger bound (QRB). Secondly, we propose two constructions of QBECCs: one by heuristic computer search and the other by concatenating two quantum tensor product codes (QTPCs). We obtain several new QBECCs with better parameters than existing codes with the same coding length. Moreover, some of the constructed codes can saturate the quantum Reiger bounds. Finally, we perform numerical experiments for our constructed codes over Markovian correlated depolarizing quantum memory channels, and show that QBECCs indeed outperform standard QECCs in this scenario.

arXiv:1801.03861•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•12 citations

Classical and quantum cyclic redundancy check codes

Simeon Ball, Ricard Vilar

We prove that certain classical cyclic redundancy check codes can be used for classical error correction and not just classical error detection. We extend the idea of classical cyclic redundancy check codes to quantum cyclic redundancy check codes. This allows us to construct quantum stabilizer codes which can correct burst errors where the burst length attains the quantum Reiger bound. We then consider a certain family of quantum cyclic redundancy check codes for which we present a fast linear time decoding algorithm.

arXiv:2305.14883•Advances in Mathematics of Communications•Sep 12, 2025•0 citations

QBEL: Quantum Burst Error Locating Codes

Roni Con, Ryan Gabrys, Eitan Yaakobi

Burst errors, which involve the corruption of consecutive symbols, are a more realistic and common type of error in many communication and storage systems. While classical codes for burst correction are well-established, quantum errorcorrecting codes that handle burst errors and error localization have been less explored. In this paper, we present constructions of quantum codes designed to locate and correct burst errors. We introduce a nearly optimal quantum error-locating burst code, which can identify an interval of$2 b$qubits containing a burst of quantum errors of length at most$b$, improving upon previous constructions in terms of redundancy. This code leverages a stabilizer framework that is not based on the CSS (Calderbank-Shor-Steane) construction, offering a more efficient error-locating capability. Additionally, our construction can correct a large structured set of burst errors, specifically those of length$b$that do not end with a$Y$Pauli operator. We prove that the redundancy of this code is optimal with respect to this error set.

IEEE International Symposium on Information Theory (ISIT)•Jun 22, 2025•2 citations

Quantum Reed-Solomon Codes

Markus Grassl, Willi Geiselmann, Thomas Beth +1 more

. We introduce a new class of quantum error--correcting codes derived from (classical) Reed--Solomon codes over finite fields of characteristic two. Quantum circuits for encoding and decoding based on the discrete cyclic Fourier transform over finite fields are presented. 1 Introduction During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [18]) and finding pre--images of an n--ary Boolean function ("searching") in time O( p 2 n ) (see [12]). Quantum computers are not only of theoretical nature---there are several suggestions how to physically realize them (see, e. g., [6, 7]). On the way towards building a quantum computer, one very important problem is to stabilize quantum mechanical systems since they are very vulnerable. A theory of quantum error--correcting codes has already been established (see [15]). Nevertheless, the pr...

•Jan 1, 1999•73 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.

•Jan 1, 2008•40 citations

One kind of quantum CSS code for burst errors

Jianhong Shi, Wan‐Su Bao

Quantum error correction is an important research area of quantum information. This paper proposes one kind of quantum CSS code for burst errors. Two construction methods are given of the proposed CSS code obtaining from classical cyclic code. Using these methods, a group of CSS codes of length 15 and 30 suitable for burst errors are obtained. In conclusion, the capability of correcting burst errors of the quantum CSS codes is much larger than their capability of correcting random errors.

International Conference on Educational and Information Technology•Sep 1, 2010•0 citations
Quantum burst error correction codes (QBECCs) are of great importance to deal with the memory effect in quantum channels. As the most important family of QBECCs, quantum cyclic codes (QCCs) play a vital role in the correction of burst errors. In this work, we characterize the burst error correction ability of QCCs constructed from the Calderbank-Shor-Steane (CSS) and the Hermitian constructions. We determine the burst error correction limit of QCCs and quantum Reed-Solomon codes with algorithms in polynomial-time complexities. As a result, lots of QBECCs saturating the quantum Reiger bound are obtained. We show that quantum Reed-Solomon codes have better burst error correction abilities than the previous results. At last, we give the quantum error-trapping decoder (QETD) of QCCs for decoding burst errors. The decoder runs in linear time and can decode both degenerate and nondegenerate burst errors. What’s more, the numerical results show that QETD can decode much more degenerate burst errors than the nondegenerate ones.
In practical communication and computation systems, errors occur predominantly in adjacent positions rather than in a random manner. In this paper, we develop a stabilizer formalism for quantum burst error correction codes (QBECC) to combat such error patterns in the quantum regime. Our contributions are as follows. Firstly, we derive an upper bound for the correctable burst errors of QBECCs, the quantum Reiger bound (QRB). Secondly, we propose two constructions of QBECCs: one by heuristic computer search and the other by concatenating two quantum tensor product codes (QTPCs). We obtain several new QBECCs with better parameters than existing codes with the same coding length. Moreover, some of the constructed codes can saturate the quantum Reiger bounds. Finally, we perform numerical experiments for our constructed codes over Markovian correlated depolarizing quantum memory channels, and show that QBECCs indeed outperform standard QECCs in this scenario.
We prove that certain classical cyclic redundancy check codes can be used for classical error correction and not just classical error detection. We extend the idea of classical cyclic redundancy check codes to quantum cyclic redundancy check codes. This allows us to construct quantum stabilizer codes which can correct burst errors where the burst length attains the quantum Reiger bound. We then consider a certain family of quantum cyclic redundancy check codes for which we present a fast linear time decoding algorithm.
Burst errors, which involve the corruption of consecutive symbols, are a more realistic and common type of error in many communication and storage systems. While classical codes for burst correction are well-established, quantum errorcorrecting codes that handle burst errors and error localization have been less explored. In this paper, we present constructions of quantum codes designed to locate and correct burst errors. We introduce a nearly optimal quantum error-locating burst code, which can identify an interval of2b2 b2bqubits containing a burst of quantum errors of length at mostbbb, improving upon previous constructions in terms of redundancy. This code leverages a stabilizer framework that is not based on the CSS (Calderbank-Shor-Steane) construction, offering a more efficient error-locating capability. Additionally, our construction can correct a large structured set of burst errors, specifically those of lengthbbbthat do not end with aYYYPauli operator. We prove that the redundancy of this code is optimal with respect to this error set.
. We introduce a new class of quantum error--correcting codes derived from (classical) Reed--Solomon codes over finite fields of characteristic two. Quantum circuits for encoding and decoding based on the discrete cyclic Fourier transform over finite fields are presented. 1 Introduction During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [18]) and finding pre--images of an n--ary Boolean function ("searching") in time O( p 2 n ) (see [12]). Quantum computers are not only of theoretical nature---there are several suggestions how to physically realize them (see, e. g., [6, 7]). On the way towards building a quantum computer, one very important problem is to stabilize quantum mechanical systems since they are very vulnerable. A theory of quantum error--correcting codes has already been established (see [15]). Nevertheless, the pr...
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.