Advanced search
1 file | 546.11 KB Add to list

Quantum synchronizable codes from finite geometries

Author
Organization
Abstract
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that, in principle, such a code can be constructed through a combination of a classical linear code and its subcode if the two are both cyclic and dual-containing. However, finding such classical codes that lead to promising quantum synchronizable error-correcting codes is not a trivial task. In fact, although there are two families of classical codes that are proved to produce quantum synchronizable codes with good minimum distances and highest possible tolerance against misalignment, their code lengths have been restricted to primes and Mersenne numbers. In this paper, examining the incidence vectors of projective spaces over the finite fields of characteristic 2, we give quantum synchronizable codes from cyclic codes whose lengths are not primes or Mersenne numbers. These projective geometric codes achieve good performance in quantum error correction and possess the best possible ability to recover synchronization, thereby enriching the variety of good quantum synchronizable codes. We also extend the current knowledge of cyclic codes in classical coding theory by explicitly giving generator polynomials of the finite geometric codes and completely characterizing the minimum weight nonzero codewords. In addition to the codes based on projective spaces, we carry out a similar analysis on the well-known cyclic codes from Euclidean spaces that are known to be majority logic decodable and determine their exact minimum distances.
Keywords
Quantum error correction, synchronizable code, cyclic code, finite geometry, ERROR-CORRECTING CODES, ENTANGLEMENT, PERFORMANCE, WEIGHT

Downloads

  • (...).pdf
    • full text (Published version)
    • |
    • UGent only
    • |
    • PDF
    • |
    • 546.11 KB

Citation

Please use this url to cite or link to this publication:

MLA
Fujiwara, Yuichiro, and Peter Vandendriessche. “Quantum Synchronizable Codes from Finite Geometries.” IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 60, no. 11, 2014, pp. 7345–54, doi:10.1109/tit.2014.2357029.
APA
Fujiwara, Y., & Vandendriessche, P. (2014). Quantum synchronizable codes from finite geometries. IEEE TRANSACTIONS ON INFORMATION THEORY, 60(11), 7345–7354. https://doi.org/10.1109/tit.2014.2357029
Chicago author-date
Fujiwara, Yuichiro, and Peter Vandendriessche. 2014. “Quantum Synchronizable Codes from Finite Geometries.” IEEE TRANSACTIONS ON INFORMATION THEORY 60 (11): 7345–54. https://doi.org/10.1109/tit.2014.2357029.
Chicago author-date (all authors)
Fujiwara, Yuichiro, and Peter Vandendriessche. 2014. “Quantum Synchronizable Codes from Finite Geometries.” IEEE TRANSACTIONS ON INFORMATION THEORY 60 (11): 7345–7354. doi:10.1109/tit.2014.2357029.
Vancouver
1.
Fujiwara Y, Vandendriessche P. Quantum synchronizable codes from finite geometries. IEEE TRANSACTIONS ON INFORMATION THEORY. 2014;60(11):7345–54.
IEEE
[1]
Y. Fujiwara and P. Vandendriessche, “Quantum synchronizable codes from finite geometries,” IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 60, no. 11, pp. 7345–7354, 2014.
@article{8531962,
  abstract     = {{Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that, in principle, such a code can be constructed through a combination of a classical linear code and its subcode if the two are both cyclic and dual-containing. However, finding such classical codes that lead to promising quantum synchronizable error-correcting codes is not a trivial task. In fact, although there are two families of classical codes that are proved to produce quantum synchronizable codes with good minimum distances and highest possible tolerance against misalignment, their code lengths have been restricted to primes and Mersenne numbers. In this paper, examining the incidence vectors of projective spaces over the finite fields of characteristic 2, we give quantum synchronizable codes from cyclic codes whose lengths are not primes or Mersenne numbers. These projective geometric codes achieve good performance in quantum error correction and possess the best possible ability to recover synchronization, thereby enriching the variety of good quantum synchronizable codes. We also extend the current knowledge of cyclic codes in classical coding theory by explicitly giving generator polynomials of the finite geometric codes and completely characterizing the minimum weight nonzero codewords. In addition to the codes based on projective spaces, we carry out a similar analysis on the well-known cyclic codes from Euclidean spaces that are known to be majority logic decodable and determine their exact minimum distances.}},
  author       = {{Fujiwara, Yuichiro and Vandendriessche, Peter}},
  issn         = {{0018-9448}},
  journal      = {{IEEE TRANSACTIONS ON INFORMATION THEORY}},
  keywords     = {{Quantum error correction,synchronizable code,cyclic code,finite geometry,ERROR-CORRECTING CODES,ENTANGLEMENT,PERFORMANCE,WEIGHT}},
  language     = {{eng}},
  number       = {{11}},
  pages        = {{7345--7354}},
  title        = {{Quantum synchronizable codes from finite geometries}},
  url          = {{http://doi.org/10.1109/tit.2014.2357029}},
  volume       = {{60}},
  year         = {{2014}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: