General formulas for capacity of classical-quantum channels

DOI10.1109/TIT.2003.813556MaRDI QIDQ3547006zbMATH OpenOpenAlexFDO

Authors Masahito Hayashi, Hiroshi Nagaoka

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/0206186

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Other game-theoretic models (91A40)

Abstract: The capacity of a classical-quantum channel (or in other words the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verd'{u}-Han which are based on the so-called information-spectrum method. The general results are applied to the stationary memoryless case with or without cost constraint on inputs, whereby a deep relation between the channel coding theory and the hypothesis testing for two quantum states is elucidated. no structural assumptions such as the stationary memoryless property are made on a channel. A capacity formula as well as a characterization of the strong converse property is given just in parallel with the corresponding classical results of Verdu-Han which are based on the so-called information-spectrum method. The general results are applied to the stationary memoryless case with or without cost constraint on inputs, whereby a deep relation between the channel coding theory and the hypothesis testing for two quantum states is elucidated.

Recommendations

• The capacity of the quantum channel with general signal states
• A general formula for channel capacity
• The classical-quantum channel with random state parameters known to the sender
• Generalized relative entropies and the capacity of classical-quantum channels
• Coding theorems for hybrid channels. II

Cited in

(47)

• Entanglement assisted classical capacity of a class of quantum channels with long-term memory
• The smooth entropy formalism for von Neumann algebras
• A general formula for channel capacity
• Limit relation for quantum entropy and channel capacity per unit cost
• Optimal adaptive strategies for sequential quantum hypothesis testing
• Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution
• Classical capacity of quantum channels with general Markovian correlated noise
• On the near-optimality of one-shot classical communication over quantum channels
• Second-order coding rates for pure-loss bosonic channels
• Correlation detection and an operational interpretation of the Rényi mutual information
• The quantum dynamic capacity formula of a quantum channel
• The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel
• Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
• Common Information, Noise Stability, and Their Extensions
• Universal coding for classical-quantum channel
• The apex of the family tree of protocols: optimal rates and resource inequalities
• Strong converse exponent for classical-quantum channel coding
• Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
• Thermodynamic implementations of quantum processes
• Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
• Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
• Moderate deviation analysis for classical communication over quantum channels
• On composite quantum hypothesis testing
• Entanglement-assisted private communication over quantum broadcast channels
• On the second-order asymptotics for entanglement-assisted communication
• An achievable rate for private classical information over a quantum broadcast channel
• A note on random coding bounds for classical-quantum channels
• Second-order asymptotics for quantum hypothesis testing
• Universal coding for transmission of private information
• Achieving the Holevo bound via a bisection decoding protocol
• Properties of noncommutative Rényi and Augustin information
• Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
• Geometrical bounds on irreversibility under correlated noise channels
• Distilling entanglement from arbitrary resources
• A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation
• Second-order asymptotics for the classical capacity of image-additive quantum channels
• The capacity of the quantum channel with general signal states
• Generalized relative entropies and the capacity of classical-quantum channels
• Union bound for quantum information processing
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography
• Alexander S. Holevo's researches in quantum information theory in 20th century
• Strong converse for the classical capacity of the pure-loss bosonic channel
• Position-based coding and convex splitting for private communication over quantum channels
• Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
• Applications of position-based coding to classical communication over quantum channels

This page was built for publication: General formulas for capacity of classical-quantum channels

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