pith. sign in

arxiv: 1109.3195 · v2 · pith:GTI655G5new · submitted 2011-09-14 · 🪐 quant-ph · cs.IT· math.IT

Efficient Quantum Polar Coding

classification 🪐 quant-ph cs.ITmath.IT
keywords channelscodingpolarinformationratetransmissionachievesclassical
0
0 comments X
read the original abstract

Polar coding, introduced 2008 by Arikan, is the first (very) efficiently encodable and decodable coding scheme whose information transmission rate provably achieves the Shannon bound for classical discrete memoryless channels in the asymptotic limit of large block sizes. Here we study the use of polar codes for the transmission of quantum information. Focusing on the case of qubit Pauli channels and qubit erasure channels, we use classical polar codes to construct a coding scheme which, using some pre-shared entanglement, asymptotically achieves a net transmission rate equal to the coherent information using efficient encoding and decoding operations and code construction. Furthermore, for channels with sufficiently low noise level, we demonstrate that the rate of preshared entanglement required is zero.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Improved Logical Error Rate via List Decoding of Quantum Polar Codes

    quant-ph 2023-04 unverdicted novelty 6.0

    List decoding of entanglement-free quantum polar codes yields logical error rates competitive with surface codes and LDPC codes of similar size, with class-probability approximation providing further improvement.