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

IEEE Communications Letters

q-Ary Chain-Containing Quantum Synchronizable Codes

Yixuan Xie, Lei Yang, Jinhong Yuan

Published Dec 24, 2015• 30 citations
Publisher

Abstract

We propose a general design of quantum synchronizable codes from classical q-ary cyclic codes. With the aid of classical super/subcodes, the proposed method exploits the idea of chain-containing q-ary cyclic codes when designing quantum synchronizable codes. The distance bound of the resulting quantum synchronizable codes of Calderbank-Shor-Steane (CSS) structure is derived using the representation of Mattson-Solomon polynomial.

DOI
10.1109/lcomm.2015.2512261

Related papers

Synchronizable Hybrid Subsystem Codes

Theerapat Tansuwannont, Andrew Nemec

Quantum synchronizable codes are quantum error correcting codes that can correct not only Pauli errors but also errors in block synchronization. The code can be constructed from two classical cyclic codes$\mathcal {C}$,$\mathcal {D}$satisfying$\mathcal {C}^{\perp } \subset \mathcal {C} \subset \mathcal {D}$through the Calderbank-Shor-Steane (CSS) code construction. In this work, we establish connections between quantum synchronizable codes, subsystem codes, and hybrid quantum-classical codes constructed from the same pair of classical cyclic codes. We also propose a method to construct a synchronizable hybrid subsystem code which can correct both Pauli and synchronization errors, is resilient to gauge errors by virtue of the subsystem structure, and can transmit both classical and quantum information, all at the same time. The trade-offs between the number of synchronization errors that the code can correct, the number of gauge qubits, and the number of logical classical bits of the code are also established. In addition, we propose general methods to construct hybrid and hybrid subsystem codes of CSS type from classical codes, which cover relevant codes from our main construction.

arXiv:2409.11312•IEEE Transactions on Quantum Engineering•Jan 1, 2026•4 citations

A New Class of Quantum Synchronizable Codes Derived From Coset Codes

Fan Ju

Quantum synchronizable codes (QSCs) are designed to correct both Pauli errors and synchronization misalignment. In this letter, we introduce a new framework for constructing QSCs based on classical coset codes. This construction is versatile, yielding codes for both random and, notably, burst errors, thereby extending the scope of existing QSC designs. The resulting codes exhibit two notable properties: they fully preserve the phase-error-correction capability of their parent Calderbank-Shor-Steane (CSS) codes, and in the absence of misalignment, they revert to the full error-correcting power of the parent codes.

IEEE Communications Letters•Oct 27, 2025•0 citations

Quantum Synchronizable Codes From the Cyclotomy of Order Four

Lanqiang Li, Shixin Zhu, Li Liu

Quantum synchronizable codes (QSCs) are special quantum error-correcting codes (QECCs) that correct the effects of both quantum noise on qubits and misalignment in block synchronization. In this letter, we construct two classes of QSCs from the cyclic codes which are obtained by the cyclotomic classes of order four. The QSCs constructed are Calderbank-Shor-Steane QECCs which can tolerate maximum number of misalignment errors. Moreover, the QSCs usually possess good error-correcting capability towards bit error and phase error, due to many cyclic codes employed to construct QSCs are optimal or almost optimal.

IEEE Communications Letters•Oct 25, 2018•22 citations

Some Classes of New Quantum MDS and Synchronizable Codes Constructed From Repeated-Root Cyclic Codes of Length 6ps

Hai Quang Dinh, Ha T. Le, Bac Trong Nguyen +1 more

In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length 6ps over Fpm.We obtain several new classes of QEC codes in the sense that their parameters are different from all the previous constructions. Among them, we identify all quantum MDS (briefly, qMDS) codes, i.e., optimal quantum codes with respect to the quantum Singleton bound. In addition, we construct quantum synchronizable codes (briefly, QSCs) from cyclic codes of length 6ps over Fpm. Furthermore, we give many new QSCs to enrich the variety of available QSCs. A lot of them are QSCs codes with shorter lengths and much larger minimum distances than known non-primitive narrow-sense BCH codes.

IEEE Access•Jan 1, 2021•7 citations

CSS codes and QSCs from Whiteman’s Generalized Cyclotomy of order four

Varsha Tiwari, Pramod Kumar Kewat

In this paper, Calderbank-Shor-Steane (CSS) quantum codes and Quantum synchronizable codes (QSCs) are obtained from cyclic codes, which are constructed using Whiteman’s generalized cyclotomy of order four. These CSS and QSCs have good error-correcting capability against phase and bit errors because many of the cyclic codes used to design them are optimal or nearly optimal. Moreover, QSCs obtained in this article achieve maximum tolerance against misalignment.

IEEE International Symposium on Information Theory (ISIT)•Jun 25, 2023•2 citations

Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2ps Over F pm

Hai Quang Dinh, Bac Trong Nguyen, Woraphon Yamaka

Let p be an odd prime, and Fp(m)is the finite field of pmelements. In this paper, all maximum distance separable (briefly, MDS) cyclic and negacyclic codes of length 2psover Fp(m)are established. As an application, all quantum MDS (briefly, qMDS) codes are constructed from cyclic and negacyclic codes of length 2psover finite fields using the Calderbank Shor-Steane (briefly, CSS) and Hermitian constructions. These codes are new in the sense that their parameters are different from all the previous constructions. Furthermore, quantum synchronizable codes (briefly, QSCs) are obtained from cyclic codes of length 2psover Fp(m). To enrich the variety of available QSCs, many new QSCs are constructed to illustrate our results. Among them, there are QSCs codes with shorter lengths and much larger minimum distances than known primitive narrow-sense Bose-Chaudhuri-Hocquenghem (briefly, BCH) codes.

IEEE Access•Jan 1, 2020•17 citations
We propose a general design of quantum synchronizable codes from classical q-ary cyclic codes. With the aid of classical super/subcodes, the proposed method exploits the idea of chain-containing q-ary cyclic codes when designing quantum synchronizable codes. The distance bound of the resulting quantum synchronizable codes of Calderbank-Shor-Steane (CSS) structure is derived using the representation of Mattson-Solomon polynomial.
Quantum synchronizable codes are quantum error correcting codes that can correct not only Pauli errors but also errors in block synchronization. The code can be constructed from two classical cyclic codesC\mathcal {C}C,D\mathcal {D}DsatisfyingC⊥⊂C⊂D\mathcal {C}^{\perp } \subset \mathcal {C} \subset \mathcal {D}C⊥⊂C⊂Dthrough the Calderbank-Shor-Steane (CSS) code construction. In this work, we establish connections between quantum synchronizable codes, subsystem codes, and hybrid quantum-classical codes constructed from the same pair of classical cyclic codes. We also propose a method to construct a synchronizable hybrid subsystem code which can correct both Pauli and synchronization errors, is resilient to gauge errors by virtue of the subsystem structure, and can transmit both classical and quantum information, all at the same time. The trade-offs between the number of synchronization errors that the code can correct, the number of gauge qubits, and the number of logical classical bits of the code are also established. In addition, we propose general methods to construct hybrid and hybrid subsystem codes of CSS type from classical codes, which cover relevant codes from our main construction.
Quantum synchronizable codes (QSCs) are designed to correct both Pauli errors and synchronization misalignment. In this letter, we introduce a new framework for constructing QSCs based on classical coset codes. This construction is versatile, yielding codes for both random and, notably, burst errors, thereby extending the scope of existing QSC designs. The resulting codes exhibit two notable properties: they fully preserve the phase-error-correction capability of their parent Calderbank-Shor-Steane (CSS) codes, and in the absence of misalignment, they revert to the full error-correcting power of the parent codes.
Quantum synchronizable codes (QSCs) are special quantum error-correcting codes (QECCs) that correct the effects of both quantum noise on qubits and misalignment in block synchronization. In this letter, we construct two classes of QSCs from the cyclic codes which are obtained by the cyclotomic classes of order four. The QSCs constructed are Calderbank-Shor-Steane QECCs which can tolerate maximum number of misalignment errors. Moreover, the QSCs usually possess good error-correcting capability towards bit error and phase error, due to many cyclic codes employed to construct QSCs are optimal or almost optimal.
In this paper, we use the CSS and Steane’s constructions to establish quantum error-correcting codes (briefly, QEC codes) from cyclic codes of length 6ps over Fpm.We obtain several new classes of QEC codes in the sense that their parameters are different from all the previous constructions. Among them, we identify all quantum MDS (briefly, qMDS) codes, i.e., optimal quantum codes with respect to the quantum Singleton bound. In addition, we construct quantum synchronizable codes (briefly, QSCs) from cyclic codes of length 6ps over Fpm. Furthermore, we give many new QSCs to enrich the variety of available QSCs. A lot of them are QSCs codes with shorter lengths and much larger minimum distances than known non-primitive narrow-sense BCH codes.
Let p be an odd prime, and Fp(m)is the finite field of pmelements. In this paper, all maximum distance separable (briefly, MDS) cyclic and negacyclic codes of length 2psover Fp(m)are established. As an application, all quantum MDS (briefly, qMDS) codes are constructed from cyclic and negacyclic codes of length 2psover finite fields using the Calderbank Shor-Steane (briefly, CSS) and Hermitian constructions. These codes are new in the sense that their parameters are different from all the previous constructions. Furthermore, quantum synchronizable codes (briefly, QSCs) are obtained from cyclic codes of length 2psover Fp(m). To enrich the variety of available QSCs, many new QSCs are constructed to illustrate our results. Among them, there are QSCs codes with shorter lengths and much larger minimum distances than known primitive narrow-sense Bose-Chaudhuri-Hocquenghem (briefly, BCH) codes.