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

National Conference on Communications

$\mathbb{F}_{q}$-Linear Qudit Data Syndrome Codes

Goli Nagamani, Pradeep Kiran Sarvepalli

Published Feb 26, 2026• 0 citations
Publisher

Abstract

Quantum codes which can correct both errors in the data as well as in the syndromes are called quantum data syndrome codes. An important framework for constructing quantum data syndrome codes is due to Ashikhmin et al. Their approach can be used to construct a quantum data syndrome code for any stabilizer code. While some constructions are known there are not many families of quantum data syndrome codes known. Furthermore, there has not been much work in the construction of qudit data syndrome codes. In this paper, we extend the framework of Ashikhmin et al. to the qudit setting focusing on$\mathbb{F}_{q}$-linear codes. Then we propose a systematic construction for CSS type data syndrome codes. We then construct a few families of data syndrome codes based on cyclic codes including the ReedSolomon codes, and BCH codes.

DOI
10.1109/ncc68160.2026.11478917

Related papers

Quantum Data-Syndrome Codes

Alexei Ashikhmin, Ching-Yi Lai, Todd A. Brun

Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of measured error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose syndrome measurement (SM) and quantum data-syndrome (DS) codes. SM codes protect syndrome with linearly dependent redundant stabilizer measurements. DS codes generalize this idea for simultaneous correction of both data qubits and syndrome bits errors. We study fundamental properties of quantum DS codes, including split weight enumerators, generalized MacWilliams identities, and linear programming bounds. In particular, we derive Singleton and Hamming-type upper bounds on the minimum distance of degenerate quantum DS codes. Then we study random DS codes and show that random DS codes with a relatively small additional syndrome measurements achieve the Gilbert-Varshamov bound of stabilizer codes. Finally, we propose a family of CSS-type quantum DS codes based on classical cyclic codes, which include the Steane code and the quantum Golay code.

arXiv:1907.01393•IEEE Journal on Selected Areas in Communications•Jan 30, 2020•48 citations

Robust Syndrome Extraction via BCH Encoding

Eren Guttentag, Andrew Nemec, Kenneth R. Brown

Quantum data-syndrome (QDS) codes are a class of quantum error-correcting codes that protect against errors both on the data qubits and on the syndrome itself via redundant measurement of stabilizer group elements. One way to define a QDS code is to choose a syndrome measurement code, a classical block code that encodes the syndrome of the underlying quantum code by defining additional stabilizer measurements. We propose the use of primitive narrow-sense BCH codes as syndrome measurement codes. We show that these codes asymptotically require$O(t\log \ell)$extra measurements, where$\ell$is the number of stabilizer generators of the quantum code and$t$is the number of syndrome measurement errors corrected by the BCH code. Previously, the best known general method of constructing QDS codes out of quantum codes required$O(t^{3}\log \ell)$extra measurements. As the number of additional syndrome measurements is a reasonable metric for the amount of additional time a general QDS code requires, we conclude that our construction protects against the same number of syndrome errors with significantly less time overhead.

arXiv:2311.16044•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•5 citations

$\mathbb {F}_p$-Linear and $\mathbb {F}_{p^m}$-Linear Qudit Codes From Dual-Containing Classical Codes

Priya J. Nadkarni, Shayan Srinivasa Garani

Quantum code construction from two classical codes D1[n,k1,d1] and D2[n,k2,d2] over the field Fpm(p is prime and m is an integer) satisfying the dual containing criteria D1⊥⊂ D2using the Calderbank-Shor-Steane (CSS) framework is well-studied. We show that the generalization of the CSS framework for qubits to qudits yields two different classes of codes, namely, the Fp-linear CSS codes and the well-known Fpm-linear CSS codes based on the check matrix-based definition and the coset-based definition of CSS codes over qubits. Our contribution to this article are three-folds. 1) We study the properties of the \mathbb Fp-linear and Fpm-linear CSS codes and demonstrate the tradeoff for designing codes with higher rates or better error detection and correction capability, useful for quantum systems. 2) For Fpm-linear CSS codes, we provide the explicit form of the check matrix and show that the minimum distances dxand dzare equal to d2and d1, respectively, if and only if the code is nondegenerate. 3) We propose two classes of quantum codes obtained from the codes D1and D2, where one code is an Fpl-linear code (l divides m) and the other code is obtained from a particular subgroup of the stabilizer group of the Fpm-linear CSS code. Within each class of codes, we demonstrate the tradeoff between higher rates and better error detection and correction capability.

IEEE Transactions on Quantum Engineering•Jan 1, 2021•4 citations

Quantum Cyclic Code

Sagarmoy Dutta, Piyush P. Kurur

In this paper, we define and study \emph{quantum cyclic codes}, a generalisation of cyclic codes to the quantum setting. Previously studied examples of quantum cyclic codes were all quantum codes obtained from classical cyclic codes via the CSS construction. However, the codes that we study are much more general. In particular, we construct cyclic stabiliser codes with parameters $[[5,1,3]]$, $[[17,1,7]]$ and $[[17,9,3]]$, all of which are \emph{not} CSS. The $[[5,1,3]]$ code is the well known Laflamme code and to the best of our knowledge the other two are new examples. Our definition of cyclicity applies to non-stabiliser codes as well; in fact we show that the $((5,6,2))$ nonstabiliser first constructed by Rains\etal~ cite{rains97nonadditive} and latter by Arvind \etal~\cite{arvind:2004:nonstabilizer} is cyclic. We also study stabiliser codes of length $4^m +1$ over $\mathbb{F}_2$ for which we define a notation of BCH distance. Much like the Berlekamp decoding algorithm for classical BCH codes, we give efficient quantum algorithms to correct up to $\floor{\frac{d-1}{2}}$ errors when the BCH distance is $d$.

arXiv:1007.1697•Jul 10, 2010•4 citations

Quasi-cyclic low-density parity-check stabilizer codes

Feng Shi, Zhiyuan Yan

Quantum error correction codes are needed to protect quantum systems from interference. An important family of quantum error correction codes are stabilizer codes. Many stabilizer codes in the literature belong to a subclass of stabilizer codes, referred to as CSS codes since they are based on the so-called CSS formalism. CSS codes have received significant attention because the dual-containing condition for the CSS formalism is relatively straightforward to satisfy and also because it is easy to produce CSS codes from classical error correction codes. However, some stabilizer codes in the literature show superior error correction performance than existing CSS codes, and are based on binary low-density parity-check (LDPC) codes. Since it has been shown that CSS codes based on nonbinary LDPC codes have good performance over quantum qubit channels, in this paper we investigate stabilizer codes based on nonbinary LDPC codes. In particular, we propose constructions of stabilizer codes based on nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes for qubit channels. The simulation results show that our QC-LDPC stabilizer codes decoded by a nonbinary sum-product algorithm have better performance than their binary counterparts.

IEEE Military Communications Conference (MILCOM)•Oct 1, 2012•0 citations

Quantum Matrix-Product Codes: CSS-T Characterization and Maximality

Delio Jaramillo-Velez, Alessandro Neri, Adway Patra +2 more

CSS-T codes are quantum error-correcting codes that play an important role in fault-tolerant quantum computation, as they help mitigate the proliferation of errors. They admit a transversal T-gate and are defined from a pair of nested classical binary linear codes satisfying a specific algebraic condition expressed in terms of their Schur square. We extend this algebraic characterization to the propagation rule known as the $(u \mid u+v)$-construction, that is, the matrix-product code constructed from two constituent codes. Moreover, for cyclic constituent codes, we provide an explicit characterization in terms of the defining cyclotomic sets, which extends existing results for cyclic codes. This framework allows the construction of new and longer CSS-T codes.

arXiv:2609.08520•Sep 8, 2026•3 citations
Fq\mathbb{F}_{q}Fq​-Linear Qudit Data Syndrome Codes
Quantum codes which can correct both errors in the data as well as in the syndromes are called quantum data syndrome codes. An important framework for constructing quantum data syndrome codes is due to Ashikhmin et al. Their approach can be used to construct a quantum data syndrome code for any stabilizer code. While some constructions are known there are not many families of quantum data syndrome codes known. Furthermore, there has not been much work in the construction of qudit data syndrome codes. In this paper, we extend the framework of Ashikhmin et al. to the qudit setting focusing onFq\mathbb{F}_{q}Fq​-linear codes. Then we propose a systematic construction for CSS type data syndrome codes. We then construct a few families of data syndrome codes based on cyclic codes including the ReedSolomon codes, and BCH codes.
Performing active quantum error correction to protect fragile quantum states highly depends on the correctness of measured error syndromes. To obtain reliable error syndromes using imperfect physical circuits, we propose syndrome measurement (SM) and quantum data-syndrome (DS) codes. SM codes protect syndrome with linearly dependent redundant stabilizer measurements. DS codes generalize this idea for simultaneous correction of both data qubits and syndrome bits errors. We study fundamental properties of quantum DS codes, including split weight enumerators, generalized MacWilliams identities, and linear programming bounds. In particular, we derive Singleton and Hamming-type upper bounds on the minimum distance of degenerate quantum DS codes. Then we study random DS codes and show that random DS codes with a relatively small additional syndrome measurements achieve the Gilbert-Varshamov bound of stabilizer codes. Finally, we propose a family of CSS-type quantum DS codes based on classical cyclic codes, which include the Steane code and the quantum Golay code.
Quantum data-syndrome (QDS) codes are a class of quantum error-correcting codes that protect against errors both on the data qubits and on the syndrome itself via redundant measurement of stabilizer group elements. One way to define a QDS code is to choose a syndrome measurement code, a classical block code that encodes the syndrome of the underlying quantum code by defining additional stabilizer measurements. We propose the use of primitive narrow-sense BCH codes as syndrome measurement codes. We show that these codes asymptotically requireO(tlog⁡ℓ)O(t\log \ell)O(tlogℓ)extra measurements, whereℓ\ellℓis the number of stabilizer generators of the quantum code andtttis the number of syndrome measurement errors corrected by the BCH code. Previously, the best known general method of constructing QDS codes out of quantum codes requiredO(t3log⁡ℓ)O(t^{3}\log \ell)O(t3logℓ)extra measurements. As the number of additional syndrome measurements is a reasonable metric for the amount of additional time a general QDS code requires, we conclude that our construction protects against the same number of syndrome errors with significantly less time overhead.
Fp\mathbb {F}_pFp​-Linear and Fpm\mathbb {F}_{p^m}Fpm​-Linear Qudit Codes From Dual-Containing Classical Codes
Quantum code construction from two classical codes D1[n,k1,d1] and D2[n,k2,d2] over the field Fpm(p is prime and m is an integer) satisfying the dual containing criteria D1⊥⊂ D2using the Calderbank-Shor-Steane (CSS) framework is well-studied. We show that the generalization of the CSS framework for qubits to qudits yields two different classes of codes, namely, the Fp-linear CSS codes and the well-known Fpm-linear CSS codes based on the check matrix-based definition and the coset-based definition of CSS codes over qubits. Our contribution to this article are three-folds. 1) We study the properties of the \mathbb Fp-linear and Fpm-linear CSS codes and demonstrate the tradeoff for designing codes with higher rates or better error detection and correction capability, useful for quantum systems. 2) For Fpm-linear CSS codes, we provide the explicit form of the check matrix and show that the minimum distances dxand dzare equal to d2and d1, respectively, if and only if the code is nondegenerate. 3) We propose two classes of quantum codes obtained from the codes D1and D2, where one code is an Fpl-linear code (l divides m) and the other code is obtained from a particular subgroup of the stabilizer group of the Fpm-linear CSS code. Within each class of codes, we demonstrate the tradeoff between higher rates and better error detection and correction capability.
In this paper, we define and study \emph{quantum cyclic codes}, a generalisation of cyclic codes to the quantum setting. Previously studied examples of quantum cyclic codes were all quantum codes obtained from classical cyclic codes via the CSS construction. However, the codes that we study are much more general. In particular, we construct cyclic stabiliser codes with parameters [[5,1,3]][[5,1,3]][[5,1,3]], [[17,1,7]][[17,1,7]][[17,1,7]] and [[17,9,3]][[17,9,3]][[17,9,3]], all of which are \emph{not} CSS. The [[5,1,3]][[5,1,3]][[5,1,3]] code is the well known Laflamme code and to the best of our knowledge the other two are new examples. Our definition of cyclicity applies to non-stabiliser codes as well; in fact we show that the ((5,6,2))((5,6,2))((5,6,2)) nonstabiliser first constructed by Rains\etal~ cite{rains97nonadditive} and latter by Arvind \etal~\cite{arvind:2004:nonstabilizer} is cyclic. We also study stabiliser codes of length 4m+14^m +14m+1 over F2\mathbb{F}_2F2​ for which we define a notation of BCH distance. Much like the Berlekamp decoding algorithm for classical BCH codes, we give efficient quantum algorithms to correct up to $\floor{\frac{d-1}{2}}$ errors when the BCH distance is ddd.
Quantum error correction codes are needed to protect quantum systems from interference. An important family of quantum error correction codes are stabilizer codes. Many stabilizer codes in the literature belong to a subclass of stabilizer codes, referred to as CSS codes since they are based on the so-called CSS formalism. CSS codes have received significant attention because the dual-containing condition for the CSS formalism is relatively straightforward to satisfy and also because it is easy to produce CSS codes from classical error correction codes. However, some stabilizer codes in the literature show superior error correction performance than existing CSS codes, and are based on binary low-density parity-check (LDPC) codes. Since it has been shown that CSS codes based on nonbinary LDPC codes have good performance over quantum qubit channels, in this paper we investigate stabilizer codes based on nonbinary LDPC codes. In particular, we propose constructions of stabilizer codes based on nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes for qubit channels. The simulation results show that our QC-LDPC stabilizer codes decoded by a nonbinary sum-product algorithm have better performance than their binary counterparts.
CSS-T codes are quantum error-correcting codes that play an important role in fault-tolerant quantum computation, as they help mitigate the proliferation of errors. They admit a transversal T-gate and are defined from a pair of nested classical binary linear codes satisfying a specific algebraic condition expressed in terms of their Schur square. We extend this algebraic characterization to the propagation rule known as the (u∣u+v)(u \mid u+v)(u∣u+v)-construction, that is, the matrix-product code constructed from two constituent codes. Moreover, for cyclic constituent codes, we provide an explicit characterization in terms of the defining cyclotomic sets, which extends existing results for cyclic codes. This framework allows the construction of new and longer CSS-T codes.