Quantum Coding Theorem from Privacy and Distinguishability

From MaRDI portal



Abstract: We prove direct quantum coding theorem for random quantum codes. The problem is separated into two parts: proof of distinguishability of codewords by receiver, and that of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.











This page was built for publication: Quantum Coding Theorem from Privacy and Distinguishability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3521588)