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

Computational and Applied Mathematics

Quantum synchronizable codes from repeated-root quasi-cyclic codes

Chao Du, Zhi Ma, Yiting Liu

Published Apr 22, 2023• 3 citations
Publisher
DOI
10.1007/s40314-023-02298-7

Related papers

Quantum Synchronizable Codes From Augmentation of Cyclic Codes.

Yixuan Xie, Jinhong Yuan

•Mar 24, 2014•6 citations

Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length $$3p^s$$

Hai Quang Dinh, Bac Trong Nguyen, M. Paravee +2 more

Quantum Information Processing•Jun 24, 2023•4 citations

Quantum Codes Derived from Cyclic Codes

Giuliano G. La Guardia

arXiv:1705.00239•International Journal of Theoretical Physics•Apr 29, 2017•33 citations

Non-Binary Quantum Synchronizable Codes From Repeated-Root Cyclic Codes

Lan Luo, Zhi Ma

In this paper, we construct a new family of quantum synchronizable codes from repeated-root cyclic codes of lengths psand lpsover Fq, where s 1 andl ≥ 2 are integers, and p ≥ 3 is the odd characteristic. Within some loose limitations, these synchronizable codes can possess the best possible capability in synchronization recovery, and therefore, enriches the variety of good quantum synchronizable codes. Furthermore, by using known techniques in classical coding theory which convert the computation of the minimum distance of a repeated-root cyclic code to that of a shorter simple-root cyclic code, we prove that the repeated-root cyclic codes of lengths ps and l ps are in general better than narrow-sense BCH codes of close lengths in terms of minimum distances, and thereby enable the obtained synchronizable codes to correct more Pauli errors.

IEEE Transactions on Information Theory•Jan 19, 2018•38 citations

Quantum synchronizable codes, polynomial and quasi-polynomial shifts

Edgar Martínez-Moro, Miguel de los Ríos de Antonio

Quantum synchronizable codes protect quantum information against Pauli errors and against misalignments of the block boundaries. Almost all known constructions use cyclic codes, because the channel shifts the transmitted block cyclically. We study what happens when the algebraic shift of the code differs from the physical one. When one uses a twisted padding, constacyclic codes synchronize at no cost, and they are the only polycyclic codes with this property for a linear padding. For the other polycyclic codes, we measure the cost of each misaligned position, and we show that the phase damage it causes can be corrected as erasures. Using annihilator duality, we extend the construction to quasi-polycyclic codes, in which the cost is confined to a single block. We prove that the usual quasi-cyclic families have a distance bound that does not grow with the length, and show that quasi-polycyclic codes over repeated-root trinomials overcome it, giving synchronizable codes with larger dimension and distance than the known synchronizable codes of the same length.

arXiv:2611.10903•Nov 7, 2026•0 citations

Quantum synchronizable codes from finite rings

Hualu Liu, Xiusheng Liu

Quantum Information Processing•Mar 1, 2021•9 citations
Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length 3ps3p^s3ps
In this paper, we construct a new family of quantum synchronizable codes from repeated-root cyclic codes of lengths psand lpsover Fq, where s 1 andl ≥ 2 are integers, and p ≥ 3 is the odd characteristic. Within some loose limitations, these synchronizable codes can possess the best possible capability in synchronization recovery, and therefore, enriches the variety of good quantum synchronizable codes. Furthermore, by using known techniques in classical coding theory which convert the computation of the minimum distance of a repeated-root cyclic code to that of a shorter simple-root cyclic code, we prove that the repeated-root cyclic codes of lengths ps and l ps are in general better than narrow-sense BCH codes of close lengths in terms of minimum distances, and thereby enable the obtained synchronizable codes to correct more Pauli errors.
Quantum synchronizable codes protect quantum information against Pauli errors and against misalignments of the block boundaries. Almost all known constructions use cyclic codes, because the channel shifts the transmitted block cyclically. We study what happens when the algebraic shift of the code differs from the physical one. When one uses a twisted padding, constacyclic codes synchronize at no cost, and they are the only polycyclic codes with this property for a linear padding. For the other polycyclic codes, we measure the cost of each misaligned position, and we show that the phase damage it causes can be corrected as erasures. Using annihilator duality, we extend the construction to quasi-polycyclic codes, in which the cost is confined to a single block. We prove that the usual quasi-cyclic families have a distance bound that does not grow with the length, and show that quasi-polycyclic codes over repeated-root trinomials overcome it, giving synchronizable codes with larger dimension and distance than the known synchronizable codes of the same length.