Pith. sign in

REVIEW 2 cited by

Decoding Quantum LDPC Codes Using Graph Neural Networks

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 2408.05170 v1 pith:B3WZMJ3V submitted 2024-08-09 quant-ph cs.ITcs.LGmath.IT

classification quant-phcs.ITcs.LGmath.IT
keywords qldpcdecodingcodesgnn-basedgraphalgorithmdecodersnetworks
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In this paper, we propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs). Similar to the Belief Propagation (BP)-based QLDPC decoders, the proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm. We compare the proposed GNN-based decoding algorithm against selected classes of both conventional and neural-enhanced QLDPC decoding algorithms across several QLDPC code designs. The simulation results demonstrate excellent performance of GNN-based decoders along with their low complexity compared to competing methods.

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. Fast correlated decoding of transversal logical algorithms

    quant-ph 2025-05 conditional novelty 6.0 of 10

    Decoding only back-propagated reliable logical Pauli products turns transversal-circuit decoding into a matchable graph, so fast minimum-weight perfect matching works with memory-like thresholds.

  2. Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes

    quant-ph 2025-04 conditional novelty 6.0 of 10

    A recurrent transformer decoder trained on circuit-level noise beats BP-OSD on the [[72,12,6]] bivariate bicycle code in logical error rate and runtime consistency, but falls behind on the [[144,12,12]] code.

Pith tools