Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing

DOI10.1109/TIT.2007.896874MaRDI QIDQ3548248zbMATH OpenFDO

Authors Tomohiro Ogawa, Hiroshi Nagaoka

Publication date 21 December 2008

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

Mathematics Subject Classification ID

Source coding (94A29) Quantum coding (general) (81P70) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Coding theorem and strong converse for quantum channels
• General formulas for capacity of classical-quantum channels
• Universal coding for classical-quantum channel
• Quantum coding theorems
• scientific article; zbMATH DE number 1944611

Cited in

(23)

• Generalized relative entropies and the capacity of classical-quantum channels
• Coding theorem and strong converse for quantum channels
• Quantum Coding Theorem from Privacy and Distinguishability
• Parallelization of entanglement-resistant multi-prover interactive proofs
• A note on random coding bounds for classical-quantum channels
• Spatial Isolation Implies Zero Knowledge Even in a Quantum World
• An achievable rate for private classical information over a quantum broadcast channel
• Resource theory of heat and work with non-commuting charges
• Classical coding and the Cauchy-Schwarz inequality
• Asymptotic reversibility of thermal operations for interacting quantum spin systems via generalized quantum Stein's lemma
• Moderate deviation analysis for classical communication over quantum channels
• Towards efficient decoding of classical-quantum polar codes
• The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel
• Universal coding for classical-quantum channel
• Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
• Classical-quantum arbitrarily varying wiretap channel: secret message transmission under jamming attacks
• Resource cost results for one-way entanglement distillation and state merging of compound and arbitrarily varying quantum sources
• Applications of position-based coding to classical communication over quantum channels
• Achieving the Holevo bound via a bisection decoding protocol
• Strong converse for the classical capacity of the pure-loss bosonic channel
• Quantum broadcast channels with cooperating decoders: an information-theoretic perspective on quantum repeaters
• 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

This page was built for publication: Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing

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