Pith. sign in

REVIEW 2 cited by

Quantum Reed-Muller 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 quant-ph/9608026 v2 pith:X5MGZ2C5 submitted 1996-08-16 quant-ph

Andrew Steane (Department of Physics , University of Oxford) This is my paper · ORCID
classification quant-ph
keywords codesquantumreed-mullerclassicalcorrectingdescribederrorparameters
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]] = [[2^r, 2^r - C(r,t) - 2 sum_{i=0}^{t-1} C(r,i), 2^t + 2^{t-1} ]].

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. Fault-tolerant quantum computation with static atomic buses

    quant-ph 2026-07 conditional novelty 7.0 of 10

    Static atomic buses enable high-fidelity long-range CZ gates in neutral atoms, delivering >10x better logical error rates than shuttling for FTQC with ~100 µs gates and ~1 ms QEC cycles.

  2. 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.

Pith tools