Towards efficient decoding of classical-quantum polar codes

DOI10.4230/LIPICS.TQC.2013.157MaRDI QIDQ2958419zbMATH OpenFDO

Authors Mark M. Wilde, Olivier Landon-Cardinal, Patrick Hayden

Publication date 1 February 2017

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

zbMATH Keywords

classical-quantum channelclassical-quantum polar codesquantum likelihood ratioquantum successive cancellation decoder

Mathematics Subject Classification ID

Quantum coding (general) (81P70)

Abstract: Known strategies for sending bits at the capacity rate over a general channel with classical input and quantum output (a cq channel) require the decoder to implement impractically complicated collective measurements. Here, we show that a fully collective strategy is not necessary in order to recover all of the information bits. In fact, when coding for a large number N uses of a cq channel W, N I(W_acc) of the bits can be recovered by a non-collective strategy which amounts to coherent quantum processing of the results of product measurements, where I(W_acc) is the accessible information of the channel W. In order to decode the other N (I(W) - I(W_acc)) bits, where I(W) is the Holevo rate, our conclusion is that the receiver should employ collective measurements. We also present two other results: 1) collective Fuchs-Caves measurements (quantum likelihood ratio measurements) can be used at the receiver to achieve the Holevo rate and 2) we give an explicit form of the Helstrom measurements used in small-size polar codes. The main approach used to demonstrate these results is a quantum extension of Arikan's polar codes.

Recommendations

• Sequential decoding of a general classical-quantum channel
• Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
• Achieving the Holevo bound via a bisection decoding protocol
• Polar quantum channel coding with optical multi-qubit entangling gates for capacity-achieving channels
• Quantum coding theorems

Cited in

(7)

• Channel polarization of two-dimensional-input quantum symmetric channels
• Polar quantum channel coding with optical multi-qubit entangling gates for capacity-achieving channels
• Fast decoders for qudit topological codes
• Belief propagation decoding of quantum channels by passing quantum messages
• Moderate deviation analysis for classical communication over quantum channels
• Achieving the Holevo bound via a bisection decoding protocol
• Sequential decoding of a general classical-quantum channel

This page was built for publication: Towards efficient decoding of classical-quantum polar codes

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