@article{e57aef7a38e54d6d9b289d6c51c07efc,
title = "Quantum coding theorem from privacy and distinguishability",
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 of indistinguishability of codewords by environment (privacy). For a large class of codes, only privacy has to be checked.",
author = "Micha Horodecki and Seth Lloyd and Andreas Winter",
note = "Funding Information: MH is supported by Polish Ministry of Scientific Research and Information Technology under the (solicited) grant no. PBZ-MIN-008/P03/2003 and EC IP SCALA. SL acknowledges the support by NEC and W. M. Keck foundation. AW is supported by the U.K. EPSRC (project “QIP IRC” and the Advanced Research Fellowship), by a Royal Society Wolfson Merit Award, and the EC, IP “QAP”.",
year = "2008",
month = mar,
doi = "10.1142/S1230161208000067",
language = "English",
volume = "15",
pages = "47--69",
journal = "Open Systems and Information Dynamics",
issn = "1230-1612",
publisher = "World Scientific",
number = "1",
}