Advancing Finite-Length Quantum Error Correction Using Generalized Bicycle Codes
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909606074122240 |
|---|---|
| author | Mostad, Olai Å. Lin, Hsuan-Yin Rosnes, Eirik Lee, De-Shih Lai, Ching-Yi |
| author_facet | Mostad, Olai Å. Lin, Hsuan-Yin Rosnes, Eirik Lee, De-Shih Lai, Ching-Yi |
| contents | Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code constructions have been proposed, their finite block-length performance often remains unquantified. In this work, we demonstrate that GB codes exhibit comparable or superior error correction performance in finite-length settings, particularly when designed with higher or unrestricted row weights. Leveraging their flexible construction, GB codes can be tailored to achieve high rates while maintaining efficient decoding. We evaluate GB codes against other leading quantum code families, such as quantum Tanner codes and single-parity-check product codes, highlighting their versatility in practical finite-length applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_06157 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Advancing Finite-Length Quantum Error Correction Using Generalized Bicycle Codes Mostad, Olai Å. Lin, Hsuan-Yin Rosnes, Eirik Lee, De-Shih Lai, Ching-Yi Quantum Physics Information Theory Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code constructions have been proposed, their finite block-length performance often remains unquantified. In this work, we demonstrate that GB codes exhibit comparable or superior error correction performance in finite-length settings, particularly when designed with higher or unrestricted row weights. Leveraging their flexible construction, GB codes can be tailored to achieve high rates while maintaining efficient decoding. We evaluate GB codes against other leading quantum code families, such as quantum Tanner codes and single-parity-check product codes, highlighting their versatility in practical finite-length applications. |
| title | Advancing Finite-Length Quantum Error Correction Using Generalized Bicycle Codes |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2505.06157 |