Polar Codes for Classical-Quantum Channels
From MaRDI portal
Publication:2989437
DOI10.1109/TIT.2012.2218792zbMATH Open1364.81071arXiv1109.2591OpenAlexW2094676669WikidataQ59832600 ScholiaQ59832600MaRDI QIDQ2989437FDOQ2989437
Authors: Mark M. Wilde, Saikat Guha 
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated the existence of such codes, their proof does not provide an explicit construction of codes for this task. The aim of the present paper is to fill this gap by constructing near-explicit "polar" codes that are capacity-achieving. The codes exploit the channel polarization phenomenon observed by Arikan for the case of classical channels. Channel polarization is an effect in which one can synthesize a set of channels, by "channel combining" and "channel splitting," in which a fraction of the synthesized channels are perfect for data transmission while the other fraction are completely useless for data transmission, with the good fraction equal to the capacity of the channel. The channel polarization effect then leads to a simple scheme for data transmission: send the information bits through the perfect channels and "frozen" bits through the useless ones. The main technical contributions of the present paper are threefold. First, we leverage several known results from the quantum information literature to demonstrate that the channel polarization effect occurs for channels with classical inputs and quantum outputs. We then construct linear polar codes based on this effect, and the encoding complexity is O(N log N), where N is the blocklength of the code. We also demonstrate that a quantum successive cancellation decoder works well, in the sense that the word error rate decays exponentially with the blocklength of the code. For this last result, we exploit Sen's recent "non-commutative union bound" that holds for a sequence of projectors applied to a quantum state.
Full work available at URL: https://arxiv.org/abs/1109.2591
Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)
Cited In (7)
- Analysis of polarization coding for subcarrier multiplexing quantum key distribution
- Steganography protocols for quantum channels
- Channel polarization of two-dimensional-input quantum symmetric channels
- The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel
- Efficient quantum key distribution protocol based on classical-quantum polarized channels
- Applications of position-based coding to classical communication over quantum channels
- Achieving the Holevo bound via a bisection decoding protocol
This page was built for publication: Polar Codes for Classical-Quantum Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989437)
