A low-rate bound on the reliability of a quantum discrete memoryless channel

We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) 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.

• Type: Journal
• Year: 2002
• Where: TIT
• Authors: Alexander Barg
• Keywords: Classical Discrete Memoryless, Error Exponents, Low-rate Improvement, TIT 2002