Quantum coding theorem from privacy and distinguishability

Micha Horodecki, Seth Lloyd, Andreas Winter

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


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 of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.

Original languageEnglish
Pages (from-to)47-69
Number of pages23
JournalOpen Systems and Information Dynamics
Issue number1
StatePublished - Mar 2008
Externally publishedYes


Dive into the research topics of 'Quantum coding theorem from privacy and distinguishability'. Together they form a unique fingerprint.

Cite this