Polar codes for classical-quantum channels
arXiv:1109.2591 · doi:10.1109/TIT.2012.2218792
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.
12 pages, 3 figures; v2 in IEEE format with minor changes; v3 final version accepted for publication in the IEEE Transactions on Information Theory
References in corpus (8)
- Coding Theorem and Strong Converse for Quantum Channels
- The quantum Chernoff bound as a measure of distinguishability between density matrices: application to qubit and Gaussian states
- Efficient Quantum Polar Coding
- Polar coding to achieve the Holevo capacity of a pure-loss optical channel
- Achieving the Han-Kobayashi inner bound for the quantum interference channel by sequential decoding
- Quantum polar codes for arbitrary channels
- Polar codes for private classical communication
- Performance of polar codes for quantum and private classical communication
Cited by in corpus (54)
- Optical codeword demodulation with error rates below standard quantum limit using a conditional nulling receiver
- Tensor Networks and Quantum Error Correction
- Efficient Quantum Polar Coding
- Polar coding to achieve the Holevo capacity of a pure-loss optical channel
- Polar codes for private and quantum communication over arbitrary channels
- Polar Codes and Their Quantum-Domain Counterparts
- Achieving the Capacity of any DMC using only Polar Codes
- Sequential decoding of a general classical-quantum channel
- Optimal Measurements for Symmetric Quantum States with Applications to Optical Communication
- Multi-Phase Hadamard receivers for classical communication on lossy bosonic channels
- Polar codes for degradable quantum channels
- Polar codes in network quantum information theory
- Real-time calibration of coherent-state receivers: learning by trial and error
- Belief Propagation with Quantum Messages for Quantum-Enhanced Classical Communications
- Achieving the Holevo bound via a bisection decoding protocol
- Optimal quantum state discrimination via nested binary measurements
- The capacity of coherent-state adaptive decoders with interferometry and single-mode detectors
- Efficient Quantum Polar Codes Requiring No Preshared Entanglement
- Convolutional Polar Codes
- Belief propagation decoding of quantum channels by passing quantum messages
- Duality of channels and codes
- Coherent-state constellations and polar codes for thermal Gaussian channels
- Quantum Information Transmission over a Partially Degradable Channel
- Towards efficient decoding of classical-quantum polar codes
- Demonstration of quantum advantage by a joint detection receiver for optical communications using quantum belief propagation on a trapped-ion device
- Polar Codes for Arbitrary Classical-Quantum Channels and Arbitrary cq-MACs
- Polar codes for private classical communication
- On privacy amplification, lossy compression, and their duality to channel coding
- An improved rate region for the classical-quantum broadcast channel
- Bounds on Information Combining With Quantum Side Information
- Polar codes in quantum information theory
- Quantum message-passing algorithm for optimal and efficient decoding
- Alignment of Polarized Sets
- Recoverability for Holevo's just-as-good fidelity
- Superadditivity of Quantum Channel Coding Rate with Finite Blocklength Joint Measurements
- Quantum resource theory of coding for error correction
- Performance of polar codes for quantum and private classical communication
- Magic state distillation with punctured polar codes
- Transceiver designs to attain the entanglement assisted communications capacity
- Broadcast Classical-Quantum Capacity Region of Two-Phase Bidirectional Relaying Channel
- Rényi Bounds on Information Combining
- Performance of Polar Codes on wireless communications Channel
- Quantum Polarization of Qudit Channels
- Polar Codes for Quantum Reading
- Conditional Pulse Nulling Receiver for Multi-pulse PPM and Binary Quantum Coding Signals
- Capacity of optical reading, Part 1: Reading boundless error-free bits using a single photon
- Classical Coding Approaches to Quantum Applications
- Multilevel Polarization for Quantum Channels
- Channel capacity of polar coding with a given polar mismatched successive cancellation decoder
- Achievable rates for concatenated square Gottesman-Kitaev-Preskill codes
- Decoding Protocols for Classical Communication on Quantum Channels
- Polar Codes for Erasure and Unital Classical-Quantum Markovian Channels
- Quantum-Processing-Assisted Classical Communications
- Loss tolerant cross-Kerr enhancement via modulated squeezing