Universal coding for classical-quantum channel
From MaRDI portal
Publication:2391144
Abstract: We construct a universal code for stationary and memoryless classical-quantum channel as a quantum version of the universal coding by Csisz'{a}r and K"{o}rner. Our code is constructed by the combination of irreducible representation, the decoder introduced through quantum information spectrum, and the packing lemma.
Recommendations
- Universal coding for transmission of private information
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
- The coding theorem for a class of quantum channels with long-term memory
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
Cites work
- scientific article; zbMATH DE number 3908323 (Why is no real title available?)
- A Mathematical Theory of Communication
- A general formula for channel capacity
- A quantum version of Sanov's theorem
- Asymptotic redundancies for universal quantum coding
- Asymptotics of quantum relative entropy from a representation theoretical viewpoint.
- Ergodic Classical-Quantum Channels: Structure and Coding Theorems
- Filtering of Time Series with Unknown Mean Value
- General formulas for capacity of classical-quantum channels
- Information-theoretic asymptotics of Bayes methods
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Optimal sequence of quantum measurements in the sense of Stein s lemma in quantum hypothesis testing
- Quantum coding theorems
- Quantum information theory. An introduction.
- Quantum redundancies and local realism
- Simple construction of quantum universal variable-length source coding
- The capacity of the quantum channel with general signal states
- The rate of optimal purification procedures.
Cited in
(24)- Universal approximation of multi-copy states and universal quantum lossless data compression
- Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
- Correlation detection and an operational interpretation of the Rényi mutual information
- Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Strong converse exponent for classical-quantum channel coding
- Encoding Classical Information Into Quantum Resources
- Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
- Sequential decoding of a general classical-quantum channel
- Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
- Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels
- The coding theorem for a class of quantum channels with long-term memory
- On composite quantum hypothesis testing
- Classical-quantum arbitrarily varying wiretap channel: secret message transmission under jamming attacks
- Asymptotic redundancies for universal quantum coding
- Universal coding for transmission of private information
- Achieving the Holevo bound via a bisection decoding protocol
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Reliability function of quantum information decoupling via the sandwiched Rényi divergence
- Optimum quantum receiver for detecting weak signals in PAM communication systems
- Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents
- Applications of position-based coding to classical communication over quantum channels
- scientific article; zbMATH DE number 5320294 (Why is no real title available?)
- Classical coding and the Cauchy-Schwarz inequality
This page was built for publication: Universal coding for classical-quantum channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391144)
