A New Proof of the Channel Coding Theorem via Hypothesis Testing in Quantum Information Theory
Abstract
A new proof of the direct part of the quantum channel coding theorem is shown based on a standpoint of quantum hypothesis testing. A packing procedure of mutually noncommutative operators is carried out to derive an upper bound on the error probability, which is similar to Feinstein's lemma in classical channel coding. The upper bound is used to show the proof of the direct part along with a variant of HiaiPetz's theorem in quantum hypothesis testing.
 Publication:

arXiv eprints
 Pub Date:
 August 2002
 arXiv:
 arXiv:quantph/0208139
 Bibcode:
 2002quant.ph..8139O
 Keywords:

 Quantum Physics
 EPrint:
 11 pages