Exponent for classical-quantum multiple access channel

2017/01/11 by Masahito Hayashi, Hayashi, Masahito, Ning Cai +1
Computer Science · #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata

paper · pdf · doi:10.48550/arxiv.1701.02939

openalex publication_date 2017/01/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we obtain a lower bound of exponent of average probability of error for classical quantum multiple access channel, which implies that for all rate pairs in the capacity region is achievable by a code with exponential probability of error. Thus we re-obtain the direct coding theorem.

Related

• Error exponent of activated non-signaling assisted classical-quantum channel coding
• On the Error Exponent Distribution of Code Ensembles over Classical-Quantum Channels
• A low-rate bound on the reliability of a quantum discrete memoryless channel
• Lower Bounds on Error Exponents via a New Quantum Decoder
• Performances of Block Codes Attaining the Expurgated and Cutoff Rate Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels