Pith. sign in

REVIEW 1 cited by

CSS-T Codes from 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 2305.06423 v2 pith:4KEKCDZF submitted 2023-05-10 cs.IT math.IT

Emma Andrade , Jessalyn Bolkema , Thomas Dexter , Harrison Eggers , Victoria Luongo , Felice Manganiello , Luke Szramowski This is my paper · ORCID
classification cs.ITmath.IT
keywords codescss-tnon-degenerateallowasymptoticbuiltclassclassical
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

CSS-T codes are a class of stabilizer codes introduced by Rengaswamy \emph{et al} with desired properties for quantum fault-tolerance. In this work, we comprehensively study non-degenerate CSS-T codes built from Reed-Muller codes. These classical codes allow for constructing CSS-T code families with nonvanishing asymptotic rates up to $\frac{1}2$ and possibly diverging minimum distance when non-degenerate.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. CSS-$T$ codes over Binary Extension Fields and their Physical Foundations

    quant-ph 2025-07 reject novelty 6.0 of 10

    A new trace-based definition of CSS-T codes over F_{2^s} is claimed to yield asymptotically good LDPC CSS-T code families over every binary extension field.

Pith tools