General formulas for capacity of classical-quantum channels
From MaRDI portal
Publication:3547006
DOI10.1109/TIT.2003.813556zbMATH Open1301.94053arXivquant-ph/0206186OpenAlexW2167830490MaRDI QIDQ3547006FDOQ3547006
Authors: Masahito Hayashi, Hiroshi Nagaoka 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/quant-ph/0206186
Recommendations
Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Other game-theoretic models (91A40)
Cited In (47)
- Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
- Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation
- The quantum dynamic capacity formula of a quantum channel
- Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
- A note on random coding bounds for classical-quantum channels
- Distilling entanglement from arbitrary resources
- An achievable rate for private classical information over a quantum broadcast channel
- A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Union bound for quantum information processing
- Second-order coding rates for pure-loss bosonic channels
- On the second-order asymptotics for entanglement-assisted communication
- A general formula for channel capacity
- Entanglement assisted classical capacity of a class of quantum channels with long-term memory
- Optimal adaptive strategies for sequential quantum hypothesis testing
- Classical capacity of quantum channels with general Markovian correlated noise
- Universal coding for transmission of private information
- Moderate deviation analysis for classical communication over quantum channels
- The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel
- Universal coding for classical-quantum channel
- Alexander S. Holevo's researches in quantum information theory in 20th century
- Limit relation for quantum entropy and channel capacity per unit cost
- Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
- Second-order asymptotics for quantum hypothesis testing
- Geometrical bounds on irreversibility under correlated noise channels
- Entanglement-assisted private communication over quantum broadcast channels
- Applications of position-based coding to classical communication over quantum channels
- Correlation detection and an operational interpretation of the Rényi mutual information
- Common Information, Noise Stability, and Their Extensions
- Achieving the Holevo bound via a bisection decoding protocol
- Strong converse for the classical capacity of the pure-loss bosonic channel
- The smooth entropy formalism for von Neumann algebras
- On composite quantum hypothesis testing
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography
- Position-based coding and convex splitting for private communication over quantum channels
- Strong converse exponent for classical-quantum channel coding
- A dynamical point of view of quantum information: entropy and pressure
- On the near-optimality of one-shot classical communication over quantum channels
- The apex of the family tree of protocols: optimal rates and resource inequalities
- Thermodynamic implementations of quantum processes
- Properties of noncommutative Rényi and Augustin information
- Generalized relative entropies and the capacity of classical-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)
