Reliability function of general classical-quantum channel
arXiv:quant-ph/9907087 · doi:10.1109/18.868501
Abstract
In information theory the reliability function and its bounds, describing the exponential behavior of the error probability, are the most important quantitative characteristics of the channel performance. From a general point of view, these bounds provide certain measures of distinguishability of a given set of states. In an earlier paper we introduced quantum analogs of the random coding and the expurgation lower bounds for the case of pure signal states. Here we discuss the general case, in particular, we prove the previously conjectured expurgation bound and find the quantum cutoff rate in the case of arbitrary mixed signal states.
15 pages, partially reported at the Workshop on Complexity, Computation and Physics of Information, Cambridge, July 5-23, 1999; to appear in IEEE Trans. on Information Theory. Several corrections suggested by the referees are included
Cited by in corpus (23)
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Polar codes for classical-quantum channels
- Lower bounds on the Probability of Error for Classical and Classical-Quantum Channels
- Moderate deviation analysis for classical communication over quantum channels
- Quantum Sphere-Packing Bounds with Polynomial Prefactors
- Applications of position-based coding to classical communication over quantum channels
- Rényi generalizations of quantum information measures
- Non-Asymptotic Classical Data Compression with Quantum Side Information
- Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
- Lower Bounds on the Quantum Capacity and Highest Error Exponent of General Memoryless Channels
- Properties of Noncommutative Renyi and Augustin Information
- On the Concavity of Auxiliary Function in Classical-Quantum Channels
- Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs
- Bounds on Information Combining With Quantum Side Information
- Reliability Function of Classical-Quantum Channels
- Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
- Reliable Simulation of Quantum Channels: the Error Exponent
- Reliability Function of Quantum Information Decoupling via the Sandwiched Rényi Divergence
- Tight lower bound on the error exponent of classical-quantum channels
- Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels
- Strong Converse Exponent for Entanglement-Assisted Communication
- Polar Codes for Quantum Reading
- Capacity of optical reading, Part 1: Reading boundless error-free bits using a single photon