A note on random coding bounds for classical-quantum channels

DOI10.1134/S0032946017030036zbMATH Open1388.81078MaRDI QIDQ1752307FDOQ1752307

Marco Dalai

Publication date: 24 May 2018

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• A Random Coding Based Proof for the Quantum Coding Theorem
• A low-rate bound on the reliability of a quantum discrete memoryless channel
• Coding theorem and strong converse for quantum channels
• On the reliability function for a quantum communication channel.

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Title not available (Why is that?)
• A Mathematical Theory of Communication
• The capacity of the quantum channel with general signal states
• Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels
• Quantum information theory
• On the reliability function for a quantum communication channel.
• General formulas for capacity of classical-quantum channels
• A simple derivation of the coding theorem and some applications
• Title not available (Why is that?)
• Quantum coding theorems
• Certain results in coding theory for noisy channels
• Reliability function of general classical-quantum channel
• Variations on the Gallager bounds, connections, and applications

Cited In (14)

• Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
• The classical-quantum channel with random state parameters known to the sender
• One-Shot Capacity Bounds on the Simultaneous Transmission of Classical and Quantum Information
• Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
• The randomness in \(2 \rightarrow 1\) quantum random access code without a shared reference frame
• Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
• A note on quantum entropy inequalities and channel capacities
• Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
• Applications of position-based coding to classical communication over quantum channels
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
• A Random Coding Based Proof for the Quantum Coding Theorem
• Strong converse exponent for classical-quantum channel coding
• Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities
• Ergodic Classical-Quantum Channels: Structure and Coding Theorems

This page was built for publication: A note on random coding bounds for classical-quantum channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752307)