Achieving the Holevo bound via a bisection decoding protocol
DOI10.1063/1.4953690zbMath1345.81023arXiv1506.04999OpenAlexW625057664WikidataQ62598253 ScholiaQ62598253MaRDI QIDQ3178312
Matteo Rosati, Vittorio Giovannetti
Publication date: 11 July 2016
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.04999
Quantum measurement theory, state operations, state preparations (81P15) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum systems, channels, information. A mathematical introduction.
- Universal coding for classical-quantum channel
- Strong converse and Stein's lemma in quantum hypothesis testing
- Polar Codes for Private and Quantum Communication Over Arbitrary Channels
- Polar Codes for Classical-Quantum Channels
- Quantum information with continuous variables
- General formulas for capacity of classical-quantum channels
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- The capacity of the quantum channel with general signal states
- A ‘Pretty Good’ Measurement for Distinguishing Quantum States
- Coding theorem and strong converse for quantum channels
- Strong converse to the quantum channel coding theorem
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Sequential decoding of a general classical-quantum channel
- Quantum Information Theory
This page was built for publication: Achieving the Holevo bound via a bisection decoding protocol
