2000/03/13 by Michał Horodecki, Michal Horodecki, Paweł Horodecki +2
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1103/physrevlett.85.433
4 pages, Revtex
arxiv created 2000/03/13 · openalex publication_date 2000/07/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Based on a unified approach to all kinds of quantum capacities we show that the rate of quantum information transmission is bounded by the maximal attainable rate of coherent information. Moreover, we show that if for any bipartite state the one-way distillable entanglement is no less than coherent information, then one obtains Shannon-like formulas for all the capacities. The inequality also implies that the decrease of distillable entanglement due to the mixing process does not exceed that of the corresponding loss of information about a system.