Strong converse to the quantum channel coding theorem
From MaRDI portal
Publication:4503437
DOI10.1109/18.796386zbMATH Open0960.94014arXivquant-ph/9808063OpenAlexW2115328106MaRDI QIDQ4503437
Author name not available (Why is that?)
Publication date: 7 September 2000
Published in: (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/quant-ph/9808063
No records found.
No records found.
This page was built for publication: Strong converse to the quantum channel coding theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503437)
