• DocumentCode
    55157
  • Title

    Concatenated Quantum Codes Can Attain the Quantum Gilbert–Varshamov Bound

  • Author

    Yingkai Ouyang

  • Author_Institution
    Univ. of Waterloo, Waterloo, ON, Canada
  • Volume
    60
  • Issue
    6
  • fYear
    2014
  • fDate
    Jun-14
  • Firstpage
    3117
  • Lastpage
    3122
  • Abstract
    A family of quantum codes of increasing block length with positive rate is asymptotically good if the ratio of its distance to its block length approaches a positive constant. The asymptotic quantum Gilbert-Varshamov (GV) bound states that there exist q -ary quantum codes of sufficiently long block length N having fixed rate R with distance at least NH-1((1-R)/2), where Hq2 is the q2 -ary entropy function. For q<;7 , only random quantum codes are known to asymptotically attain the quantum GV bound. However, random codes have little structure. In this paper, we generalize the classical result of Thommesen to the quantum case, thereby demonstrating the existence of concatenated quantum codes that can asymptotically attain the quantum GV bound. The outer codes are quantum generalized Reed-Solomon codes, and the inner codes are random independently chosen stabilizer codes, where the rates of the inner and outer codes lie in a specified feasible region.
  • Keywords
    concatenated codes; entropy codes; random codes; concatenated quantum codes; q-ary quantum codes; q2 -ary entropy function; quantum GV bound; quantum Gilbert-Varshamov bound; quantum case; quantum generalized Reed-Solomon codes; random codes; random quantum codes; stabilizer codes; Concatenated codes; Educational institutions; Entropy; Generators; Quantum mechanics; Reed-Solomon codes; Vectors; Error correction codes; Reed??Solomon codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2313577
  • Filename
    6780574