Pith. sign in

REVIEW 2 cited by

Polar Codes for CQ Channels: Decoding via Belief-Propagation with Quantum Messages

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.07167 v1 pith:7F6EDG4F submitted 2024-01-13 cs.IT math.IT

classification cs.ITmath.IT
keywords decoderdecodingpolarclassicalcodespm-bpqmquantumbelief-propagation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper considers the design and decoding of polar codes for general classical-quantum (CQ) channels. It focuses on decoding via belief-propagation with quantum messages (BPQM) and, in particular, the idea of paired-measurement BPQM (PM-BPQM) decoding. Since the PM-BPQM decoder admits a classical density evolution (DE) analysis, one can use DE to design a polar code for any CQ channel and then efficiently compute the trade-off between code rate and error probability. We have also implemented and tested a classical simulation of our PM-BPQM decoder for polar codes. While the decoder can be implemented efficiently on a quantum computer, simulating the decoder on a classical computer actually has exponential complexity. Thus, simulation results for the decoder are somewhat limited and are included primarily to validate our theoretical results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Affine Filtering Measurements and Their Applications to Quantum Decoding

    quant-ph 2026-06 unverdicted novelty 7.0 of 10

    Optimal affine filtering measurements for group-covariant pure-state codewords reduce to an LP, and SPC-based affine-filtering+GE decoding can outperform symbol-wise USD and PGM on i.i.d. pure-state channels.

  2. Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables

    cs.IT 2025-02 conditional novelty 7.0 of 10

    Reed-Muller codes achieve vanishing bit-error probability below Holevo capacity on binary-input symmetric classical-quantum channels.

Pith tools