1997/01/31 by Charles H. Bennett, David P. DiVincenzo, John A. Smolin · 5 citations
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.78.3217
published as Phys.Rev.Lett.78:3217-3220,1997 · 4 pages, RevTeX, epsf macros to include 2 eps figures. See also http://vesta.physics.ucla.edu/~smolin/ Version 2, submitted to Phys. Rev. Lett., includes several small changes and corrections
arxiv created 1997/03/12 · openalex publication_date 1997/04/21 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04
The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the assistance of a two-way classical side channel, can be computed exactly. We derive the quantum and classical capacities for the quantum erasure channel and related channels, and compare them to the depolarizing channel, for which only upper and lower bounds on the capacities are known.