TY - GEN
T1 - Performance of polar codes for quantum and private classical communication
AU - Dutton, Zachary
AU - Guha, Saikat
AU - Wilde, Mark M.
PY - 2012
Y1 - 2012
N2 - 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 210 and 220, 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 Pe ≤ 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 by employing a polar coding rule other than the heuristic used here.
AB - 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 210 and 220, 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 Pe ≤ 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 by employing a polar coding rule other than the heuristic used here.
UR - http://www.scopus.com/inward/record.url?scp=84875692440&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875692440&partnerID=8YFLogxK
U2 - 10.1109/Allerton.2012.6483269
DO - 10.1109/Allerton.2012.6483269
M3 - Conference contribution
AN - SCOPUS:84875692440
SN - 9781467345385
T3 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
SP - 572
EP - 579
BT - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
T2 - 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012
Y2 - 1 October 2012 through 5 October 2012
ER -