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

Journal of the Physical Society of Japan

Quantum Event-Error Detection Codes

Ying Guo, Guihua Zeng

Published Nov 15, 2005• 8 citations
Publisher

Abstract

To simultaneously detect random and burst quantum errors which may be generalized as quantum event errors, a quantum error detection code, called the quantum event-error detection code, is first investigated in analogy to the classical event-error detection code. The proposed code can be used to detect the length, number and location of errors occurring in every error event. Two special quantum event-error detection codes are constructed by exploiting different approaches according to the derived syndrome, and their number-bound of generators of the stabilizer is also derived. Finally, the proposed theory on the quantum event-error detection code for quantum single-event error is extended to a more general case, i.e., the quantum composite-event error, so that the general quantum event-error detection code can be constructed.

DOI
10.1143/jpsj.74.2949

Related papers

Existence of quantum event-error detecting code

Ying Guo, Guihua Zeng, Fucheng Zhu

A novel quantum detection code is first proposed, analogous to the classic event-error detection code, which can detect simultaneously random and burst quantum errors. The proposed code, called quantum event-error detection code, can detect the length, number and location of the quantum errors in every listed quantum error event. Especially, two kinds of quantum event-error detection codes are constructed. To construct the optimal quantum event-error detection code, the number-bound of the stabilizer generators is investigated.

International Conference on Communications, Circuits and Systems•Aug 16, 2005•0 citations

How to Correct Random and Burst Quantum Errors Simultaneously

Ying Guo

A special quantum error correction scheme is proposed to protect the flow of transmitted quantum information in complex channels. Based on the derived syndrome, an algorithm is devised for the construction of the called quantum event-error correction code, which can correct simultaneously random and burst quantum errors. Moreover, the constructed code can detect the length, the number and even the exact location of the occurring errors in the listed error event.

Journal of Software•Jan 1, 2006•1 citation

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

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

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

Quantum error detection .I. Statement of the problem

Alexei Ashikhmin, Alexander Barg, Emanuel H. Knill +1 more

This paper is devoted to the problem of error detection with quantum codes. We show that it is possible to give a consistent definition of the undetected error event. To prove this, we examine possible problem settings for quantum error detection. Our goal is to derive a functional that describes the probability of undetected error under natural physical assumptions concerning transmission with error detection with quantum codes. We discuss possible transmission protocols with stabilizer and unrestricted quantum codes. The set of results proved in the paper shows that in all the cases considered the average probability of undetected error for a given code is essentially given by one and the same function of its weight enumerators. We examine polynomial invariants of quantum codes and show that coefficients of Rains's (see ibid., vol44, p.1388-94, 1998) "unitary weight enumerators" are known for classical codes under the name of binomial moments of the distance distribution. As in the classical situation, these enumerators provide an alternative expression for the probability of undetected error.

arXiv:quant-ph/9906126•IEEE Transactions on Information Theory•May 1, 2000•49 citations
To simultaneously detect random and burst quantum errors which may be generalized as quantum event errors, a quantum error detection code, called the quantum event-error detection code, is first investigated in analogy to the classical event-error detection code. The proposed code can be used to detect the length, number and location of errors occurring in every error event. Two special quantum event-error detection codes are constructed by exploiting different approaches according to the derived syndrome, and their number-bound of generators of the stabilizer is also derived. Finally, the proposed theory on the quantum event-error detection code for quantum single-event error is extended to a more general case, i.e., the quantum composite-event error, so that the general quantum event-error detection code can be constructed.
A novel quantum detection code is first proposed, analogous to the classic event-error detection code, which can detect simultaneously random and burst quantum errors. The proposed code, called quantum event-error detection code, can detect the length, number and location of the quantum errors in every listed quantum error event. Especially, two kinds of quantum event-error detection codes are constructed. To construct the optimal quantum event-error detection code, the number-bound of the stabilizer generators is investigated.
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.
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 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.
This paper is devoted to the problem of error detection with quantum codes. We show that it is possible to give a consistent definition of the undetected error event. To prove this, we examine possible problem settings for quantum error detection. Our goal is to derive a functional that describes the probability of undetected error under natural physical assumptions concerning transmission with error detection with quantum codes. We discuss possible transmission protocols with stabilizer and unrestricted quantum codes. The set of results proved in the paper shows that in all the cases considered the average probability of undetected error for a given code is essentially given by one and the same function of its weight enumerators. We examine polynomial invariants of quantum codes and show that coefficients of Rains's (see ibid., vol44, p.1388-94, 1998) "unitary weight enumerators" are known for classical codes under the name of binomial moments of the distance distribution. As in the classical situation, these enumerators provide an alternative expression for the probability of undetected error.