On Error Thresholds for Pauli Channels: Some answers with many more questions
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910041150324736 |
|---|---|
| author | Agarwal, Avantika Bu, Alan Kalra, Amolak Ratan Leung, Debbie Schaeffer, Luke Smith, Graeme |
| author_facet | Agarwal, Avantika Bu, Alan Kalra, Amolak Ratan Leung, Debbie Schaeffer, Luke Smith, Graeme |
| contents | This paper focuses on error thresholds for Pauli channels. We numerically compute lower bounds for the thresholds using the analytic framework of coset weight enumerators pioneered by DiVincenzo, Shor and Smolin in 1998. In particular, we study potential non-additivity of a variety of small stabilizer codes and their concatenations, and report several new concatenated stabilizer codes of small length that show significant non-additivity. We also give a closed form expression of coset weight enumerators of concatenated phase and bit flip repetition codes. Using insights from this formalism, we estimate the threshold for concatenated repetition codes of large lengths. Finally, for several concatenations of small stabilizer codes we optimize for channels which lead to maximal non-additivity at the hashing point of the corresponding channel. We supplement these results with a discussion on the performance of various stabilizer codes from the perspective of the non-additivity and threshold problem. We report both positive and negative results, and highlight some counterintuitive observations, to support subsequent work on lower bounds for error thresholds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_04357 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Error Thresholds for Pauli Channels: Some answers with many more questions Agarwal, Avantika Bu, Alan Kalra, Amolak Ratan Leung, Debbie Schaeffer, Luke Smith, Graeme Quantum Physics Information Theory This paper focuses on error thresholds for Pauli channels. We numerically compute lower bounds for the thresholds using the analytic framework of coset weight enumerators pioneered by DiVincenzo, Shor and Smolin in 1998. In particular, we study potential non-additivity of a variety of small stabilizer codes and their concatenations, and report several new concatenated stabilizer codes of small length that show significant non-additivity. We also give a closed form expression of coset weight enumerators of concatenated phase and bit flip repetition codes. Using insights from this formalism, we estimate the threshold for concatenated repetition codes of large lengths. Finally, for several concatenations of small stabilizer codes we optimize for channels which lead to maximal non-additivity at the hashing point of the corresponding channel. We supplement these results with a discussion on the performance of various stabilizer codes from the perspective of the non-additivity and threshold problem. We report both positive and negative results, and highlight some counterintuitive observations, to support subsequent work on lower bounds for error thresholds. |
| title | On Error Thresholds for Pauli Channels: Some answers with many more questions |
| topic | Quantum Physics Information Theory |
| url | https://arxiv.org/abs/2603.04357 |