Pith. sign in

REVIEW

Fast erasure decoder for hypergraph product codes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2208.01002 v3 pith:45LNJVXU submitted 2022-08-01 quant-ph cs.ITmath.IT

Nicholas Connolly , Vivien Londe , Anthony Leverrier , Nicolas Delfosse This is my paper · ORCID
classification quant-phcs.ITmath.IT
keywords decodercodeshypergraphimplementedoperationsproductquantumapproximation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We propose a decoder for the correction of erasures with hypergraph product codes, which form one of the most popular families of quantum LDPC codes. Our numerical simulations show that this decoder provides a close approximation of the maximum likelihood decoder that can be implemented in O(N^2) bit operations where N is the length of the quantum code. A probabilistic version of this decoder can be implemented in O(N^1.5) bit operations.

Discussion (0). Continue with ORCID to comment.

Pith tools