1998/01/08 by Masahide Sasaki, Kentaro Kato, Masayuki Izutsu +1 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Amplitude damping channel #Channel (broadcasting) #Channel capacity #Classical capacity #Coding (social sciences) #Computer science #Decoding methods #Mathematical economics #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum capacity #Quantum channel #Quantum information #Quantum mechanics #Quantum network #Quantum-Dot Cellular Automata #Shannon–Fano coding #Statistics #Superadditivity #Telecommunications #Theoretical computer science #Variable-length code #quant-ph
paper · pdf · doi:10.1103/physreva.58.146
16 pages, RevTeX, 8 figures(EPS)
arxiv created 1998/01/08 · openalex publication_date 1998/07/01 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We consider a channel coding for sending classical information through a quantum channel with a given ensemble of quantum states (letter states). As is well known, it is generically possible in a quantum channel that the transmittable information in block coding of length n can exceed n times the maximum amount that can be sent without any coding scheme. This so-called superadditivity in classical capacity of a quantum channel is a distinct feature that cannot be found in a classical memoryless channel. In this paper, a practical model of channel coding that shows this property is presented. It consists of a simple code-word selection and the optimum decoding of the code words minimizing the average error probability. At first, optimization of decoding strategy is discussed. Then the channel coding that shows the superadditivity in classical capacity is demonstrated.