Quantum coding theorem from privacy and distinguishability
Quantum Physics
2008-04-03 v2
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.
Cite
@article{arxiv.quant-ph/0702006,
title = {Quantum coding theorem from privacy and distinguishability},
author = {Michal Horodecki and Seth Lloyd and Andreas Winter},
journal= {arXiv preprint arXiv:quant-ph/0702006},
year = {2008}
}
Comments
Presented at the NATO ARW "Quantum Communication and Security", 10-13 September 2006, Gdansk, Poland; final version to appear in OSID special issue