Pith. sign in

REVIEW

On Quantum-Enhanced LDPC Decoding for Rayleigh Fading Channels

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 2209.11994 v1 pith:2YMPXGMY submitted 2022-09-24 quant-ph

On Quantum-Enhanced LDPC Decoding for Rayleigh Fading Channels

classification quant-ph
keywords decodingquantumannealerchannelsclassicaldiversityfadingfully
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum and Classical computers continue to work together in tight cooperation to solve difficult problems. The combination is thus suggested in recent times for decoding the Low Density Parity Check (LDPC) codes, for the next generation Wireless Communication systems. In this paper we have worked out the Quadratic Unconstrained Binary Optimization (QUBO) formulation for Rayleigh Fading channels for two different scenarios: channel state fully known and not known. The resultant QUBO are solved using D-Wave 2000Q Quantum Annealer and the outputs from the Annealer are classically postprocessed, invoking the notion of diversity. Simple minimum distance decoding of the available copies of the outputs led to improved performance, compared to picking the minimum-energy solution in terms of Bit Error Rate (BER). Apart from providing these results and the comparisons to fully classical Simulated Annealing (SA) and the traditional Belief Propagation (BP) based strategies, some remarks about diversity due to quantum processing are also spelt out.

discussion (0)

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