• DocumentCode
    28234
  • Title

    Fidelity Lower Bounds for Stabilizer and CSS Quantum Codes

  • Author

    Ashikhmin, Alexei

  • Author_Institution
    Bell Labs., Alcatel-Lucent Inc., Murray Hill, NJ, USA
  • Volume
    60
  • Issue
    6
  • fYear
    2014
  • fDate
    Jun-14
  • Firstpage
    3104
  • Lastpage
    3116
  • Abstract
    In this paper, we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite length stabilizer and CSS codes. We use the average quantum enumerators for obtaining lower bounds on the average fidelity of these ensembles. We further improve the fidelity bounds by estimating the quantum enumerators of expurgated ensembles of stabilizer and CSS codes. Finally, we derive fidelity bounds in the asymptotic regime when the code length tends to infinity. These results tell us which code rate we can afford for achieving a target fidelity with codes of a given length. The results also show that in symmetric depolarizing channel a typical stabilizer code has better performance, in terms of fidelity and code rate, compared with a typical CSS codes, and that balanced CSS codes significantly outperform other CSS codes. Asymptotic results demonstrate that CSS codes have a fundamental performance loss compared with stabilizer codes.
  • Keywords
    binary codes; quantum communication; CSS quantum codes; fidelity bounds; finite length stabilizer; quantum enumerators; stabilizer codes; symmetric depolarizing channel; Arrays; Cascading style sheets; Linear codes; Quantum computing; Quantum mechanics; Standards; Vectors; CSS codes; fidelity bounds; quantum codes; stabilizer codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2014.2303801
  • Filename
    6763069