CSS-T Codes from Reed Muller Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912498501812224 |
|---|---|
| author | Andrade, Emma Bolkema, Jessalyn Dexter, Thomas Eggers, Harrison Luongo, Victoria Manganiello, Felice Szramowski, Luke |
| author_facet | Andrade, Emma Bolkema, Jessalyn Dexter, Thomas Eggers, Harrison Luongo, Victoria Manganiello, Felice Szramowski, Luke |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_06423 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | CSS-T Codes from Reed Muller Codes Andrade, Emma Bolkema, Jessalyn Dexter, Thomas Eggers, Harrison Luongo, Victoria Manganiello, Felice Szramowski, Luke Information Theory 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. |
| title | CSS-T Codes from Reed Muller Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2305.06423 |