Quantum Reed-Muller Codes

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

Lin Zhang , Ian Fuss (Defence Science , Technology Organisation , Australia) This is my paper · ORCID

classification quant-ph

keywords codesquantumreed-mullereffectiveexistingpresentstimestypically

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

This paper presents a set of quantum Reed-Muller codes which are typically 100 times more effective than existing quantum Reed-Muller codes.

Forward citations

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

Reed-Muller Codes for Quantum Pauli and Multiple Access Channels
cs.IT 2025-06 conditional novelty 6.0 of 10

Reed-Muller codes achieve the full achievable rate region on two-user additive-noise channels, and the resulting quantum CSS codes meet the hashing bound across a continuous range of Pauli noise parameters.