Strong Converse to the Quantum Channel Coding Theorem
Quantum Physics
2016-11-17 v2
Abstract
A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept for the difficulty due to non-commutativity.
Cite
@article{arxiv.quant-ph/9808063,
title = {Strong Converse to the Quantum Channel Coding Theorem},
author = {Tomohiro Ogawa and Hiroshi Nagaoka},
journal= {arXiv preprint arXiv:quant-ph/9808063},
year = {2016}
}
Comments
LaTeX, 11 pages, submitted to IEEE Trans. Inform. Theory