2009/02/28 by T. C. Dorlas, Tony Dorlas, Ciara Morgan
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/physreva.79.032320
published as Phys. Rev. A 79, 032320 (2009) · 6 double-column pages. Short note added on quantum memory channels
openalex publication_date 2009/03/17 · arxiv created 2009/06/26 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We investigate the classical capacity of two quantum channels with memory: a periodic channel with depolarizing channel branches and a convex combination of depolarizing channels. We prove that the capacity is additive in both cases. As a result, the channel capacity is achieved without the use of entangled input states. In the case of a convex combination of depolarizing channels the proof provided can be extended to other quantum channels whose classical capacity has been proven to be additive in the memoryless case.