REVIEW 1 cited by
Belief propagation decoding of quantum channels by passing 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
read the original abstract
Belief propagation is a powerful tool in statistical physics, machine learning, and modern coding theory. As a decoding method, it is ubiquitous in classical error correction and has also been applied to stabilizer-based quantum error correction. The algorithm works by passing messages between nodes of the factor graph associated with the code and enables efficient decoding, in some cases even up to the Shannon capacity of the channel. Here we construct a belief propagation algorithm which passes quantum messages on the factor graph and is capable of decoding the classical-quantum channel with pure state outputs. This gives explicit decoding circuits whose number of gates is quadratic in the blocklength of the code. We also show that this decoder can be modified to work with polar codes for the pure state channel and as part of a polar decoder for transmitting quantum information over the amplitude damping channel. These represent the first explicit capacity-achieving decoders for non-Pauli channels.
Forward citations
Cited by 1 Pith paper
-
Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables
Reed-Muller codes achieve vanishing bit-error probability below Holevo capacity on binary-input symmetric classical-quantum channels.
Discussion (0). Continue with ORCID to comment.