IEEE Transactions on Information Theory · 2018 · 35 citations · 14 references
ComputingComputer ScienceFault ToleranceQuantum ComputingQuantum MechanicsCoding TheoryError-correcting CodesCyclic CodesQuantum Error-correcting CodesSynchronization
In this paper, we construct a new family of quantum synchronizable codes from repeated-root cyclic codes of lengths p <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sup> and lp <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sup> over F <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</sub> , 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.
14
<i>Quantum Computation and Quantum Information</i>
Michael A. Nielsen, Isaac L. Chuang, Lov K. Grover · American Journal of Physics · 2002 · 22.7K citations
G. Castagnoli, James L. Massey, P.A. Schoeller et al. · IEEE Transactions on Information Theory · 1991 · 222 citations
J. H. van Lint · IEEE Transactions on Information Theory · 1991 · 198 citations · Full text
Asymmetric quantum error-correcting codes
L. B. Ioffe, Marc Mézard · Physical Review A · 2007 · 179 citations · Full text