TY - JOUR
T1 - A decoupling approach to the quantum capacity
AU - Hayden, Patrick
AU - Horodecki, Micha
AU - Winter, Andreas
AU - Yard, Jon
N1 - Funding Information:
We would like to thank Alexander Holevo, Debbie Leung, Renato Renner for interesting discussions. PH is supported by the Canada Research Chairs program, CIFAR, FQRNT, MITACS, NSERC and QuantumWorks. He is also grateful to the DAMTP in Cambridge for their hospitality. 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. AW was supported through an Advanced Research Fellowship of the U.K. EPSRC via the QIP IRC, and the European Commission IP QAP (IST-2005-015848). JY’s research at LANL is supported by the Center for Nonlinear Studies (CNLS), the Quantum Institute and the LDRD program of the U.S. Department of Energy. He is also grateful for support from the U.S. National Science Foundation under Grant No. PHY-0456720 through Caltech and from the CIFAR when this work was initiated.
PY - 2008/3
Y1 - 2008/3
N2 - We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective measurement on a typical subspace of a tensor power state. We show that, provided the rank of each measurement operator is sufficiently small, the transmitted data will, with high probability, be decoupled from the channel environment. We also show that our construction leads to random codes whose average input is close to a product state and outline a modification yielding unitarily invariant ensembles of maximally entangled codes.
AB - We give a short proof that the coherent information is an achievable rate for the transmission of quantum information through a noisy quantum channel. Our method is to produce random codes by performing a unitarily covariant projective measurement on a typical subspace of a tensor power state. We show that, provided the rank of each measurement operator is sufficiently small, the transmitted data will, with high probability, be decoupled from the channel environment. We also show that our construction leads to random codes whose average input is close to a product state and outline a modification yielding unitarily invariant ensembles of maximally entangled codes.
UR - http://www.scopus.com/inward/record.url?scp=52349093732&partnerID=8YFLogxK
U2 - 10.1142/S1230161208000043
DO - 10.1142/S1230161208000043
M3 - Article
AN - SCOPUS:52349093732
SN - 1230-1612
VL - 15
SP - 7
EP - 19
JO - Open Systems and Information Dynamics
JF - Open Systems and Information Dynamics
IS - 1
ER -