Efficient Quantum Polar Codes Requiring No Preshared Entanglement

DOI10.1109/TIT.2015.2468084MaRDI QIDQ2977147zbMATHOpenAlexDBLPWikidataFDO

Authors J. M. Renes, David Sutter, F. Dupuis, R. Renner

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.1136

Mathematics Subject Classification ID

Quantum coherence, entanglement, quantum correlations (81P40) Quantum coding (general) (81P70) Linear codes (general theory) (94B05)

Abstract: We construct an explicit quantum coding scheme which achieves a communication rate not less than the coherent information when used to transmit quantum information over a noisy quantum channel. For Pauli and erasure channels we also present efficient encoding and decoding algorithms for this communication scheme based on polar codes (essentially linear in the blocklength), but which do not require the sender and receiver to share any entanglement before the protocol begins. Due to the existence of degeneracies in the involved error-correcting codes it is indeed possible that the rate of the scheme exceeds the coherent information. We provide a simple criterion which indicates such performance. Finally we discuss how the scheme can be used for secret key distillation as well as private channel coding.

Cited in

(4)

• Decoupling with random quantum circuits
• Stronger entropic uncertainty relations with multiple quantum memories
• Quantum‐Memory‐Assisted Entropic Uncertainty Relations
• Channel polarization of two-dimensional-input quantum symmetric channels

This page was built for publication: Efficient Quantum Polar Codes Requiring No Preshared Entanglement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977147)