A low-rate bound on the reliability of a quantum discrete memoryless channel
Quantum Physics
2007-05-23 v2
Abstract
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel to its quantum counterpart. The key observation that we make is that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the problem of deriving error exponents for a certain symmetric classical channel.
Cite
@article{arxiv.quant-ph/0203077,
title = {A low-rate bound on the reliability of a quantum discrete memoryless channel},
author = {Alexander Barg},
journal= {arXiv preprint arXiv:quant-ph/0203077},
year = {2007}
}
Comments
9 pages, 1 figure. Changes in version 2: argument on the random coding bound expanded, minor errors corrected