Polar codes for private and quantum communication over arbitrary channels

TL;DR

This paper introduces new polar coding schemes for quantum and private classical communication over arbitrary channels, achieving key information rates and demonstrating superactivation, with a focus on theoretical construction and potential practical implications.

Contribution

The paper develops novel polar coding schemes for quantum and private communication over arbitrary channels, extending classical polar codes to quantum settings and demonstrating superactivation.

Findings

Achieves symmetric coherent information for quantum communication.

Achieves symmetric private information for private classical communication.

Shows superactivation effect with the proposed schemes.

Abstract

We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information and in the latter the symmetric private information. Both schemes are built from a polar coding construction capable of transmitting classical information over a quantum channel [Wilde and Guha, IEEE Transactions on Information Theory, in press]. Appropriately merging two such classical-quantum schemes, one for transmitting "amplitude" information and the other for transmitting "phase," leads to the new private and quantum coding schemes, similar to the construction for Pauli and erasure channels in [Renes, Dupuis, and Renner, Physical Review Letters 109, 050504 (2012)]. The encoding is entirely similar to the classical case, and thus efficient. The decoding can also be performed by successive cancellation, as in the classical case, but no efficient successive cancellation scheme is yet known for arbitrary quantum channels. An efficient code construction is unfortunately still unknown. Generally, our two coding schemes require entanglement or secret-key assistance, respectively, but we extend two known conditions under which the needed assistance rate vanishes. Finally, although our results are formulated for qubit channels, we show how the scheme can be extended to multiple qubits. This then demonstrates a near-explicit coding method for realizing one of the most striking phenomena in quantum information theory: the superactivation effect, whereby two quantum channels which individually have zero quantum capacity can have a non-zero quantum capacity when used together.