Performance of polar codes for quantum and private classical communication

TL;DR

This paper evaluates the practical performance of quantum polar codes through rigorous bounds and simulations across various quantum channels, demonstrating their potential for high data rates with low error probabilities.

Contribution

It provides the first comprehensive bounds and simulations for quantum polar codes on multiple channels, highlighting their effectiveness and potential for private classical communication.

Findings

High quantum data rates achieved for quantum erasure channels at low error rates

Quantum polar codes perform well on depolarizing and BB84 channels with moderate block lengths

Bounds and simulations suggest potential for secure classical data transmission using quantum polar codes

Abstract

We analyze the practical performance of quantum polar codes, by computing rigorous bounds on block error probability and by numerically simulating them. We evaluate our bounds for quantum erasure channels with coding block lengths between 2^10 and 2^20, and we report the results of simulations for quantum erasure channels, quantum depolarizing channels, and "BB84" channels with coding block lengths up to N = 1024. For quantum erasure channels, we observe that high quantum data rates can be achieved for block error rates less than 10^(-4) and that somewhat lower quantum data rates can be achieved for quantum depolarizing and BB84 channels. Our results here also serve as bounds for and simulations of private classical data transmission over these channels, essentially due to Renes' duality bounds for privacy amplification and classical data transmission of complementary observables. Future work might be able to improve upon our numerical results for quantum depolarizing and BB84 channels by employing a polar coding rule other than the heuristic used here.