Universal coding for classical-quantum channel
From MaRDI portal
Publication:2391144
DOI10.1007/S00220-009-0825-1zbMATH Open1167.81009arXiv0805.4092OpenAlexW3102523625MaRDI QIDQ2391144FDOQ2391144
Publication date: 24 July 2009
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0805.4092
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Mathematical Theory of Communication
- The capacity of the quantum channel with general signal states
- Asymptotic redundancies for universal quantum coding
- Information-theoretic asymptotics of Bayes methods
- Asymptotics of quantum relative entropy from a representation theoretical viewpoint.
- General formulas for capacity of classical-quantum channels
- A quantum version of Sanov's theorem
- Quantum redundancies and local realism
- A general formula for channel capacity
- Quantum coding theorems
- Optimal sequence of quantum measurements in the sense of Stein s lemma in quantum hypothesis testing
- The rate of optimal purification procedures.
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- Filtering of Time Series with Unknown Mean Value
- Ergodic Classical-Quantum Channels: Structure and Coding Theorems
Cited In (19)
- Encoding Classical Information Into Quantum Resources
- Reliability function of quantum information decoupling via the sandwiched Rényi divergence
- Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks
- Universal approximation of multi-copy states and universal quantum lossless data compression
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages
- Universal coding for transmission of private information
- Operational interpretation of the sandwiched Rényi divergence of order 1/2 to 1 as strong converse exponents
- Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
- Applications of position-based coding to classical communication over quantum channels
- Correlation detection and an operational interpretation of the Rényi mutual information
- Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
- Achieving the Holevo bound via a bisection decoding protocol
- Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities
- Title not available (Why is that?)
- On composite quantum hypothesis testing
- Optimum quantum receiver for detecting weak signals in PAM communication systems
- Strong converse exponent for classical-quantum channel coding
- Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels
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)
