Breadth-first graph traversal union-find decoder
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914882439348224 |
|---|---|
| author | Löbl, Matthias C. Chen, Susan X. Paesani, Stefano Sørensen, Anders S. |
| author_facet | Löbl, Matthias C. Chen, Susan X. Paesani, Stefano Sørensen, Anders S. |
| contents | Fast decoding algorithms are decisive for real-time quantum error correction and for analyzing properties of error correction codes. Here, we develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages. Furthermore, we show how these methods can be adapted to decode non-topological quantum low-density-parity-check (qLDPC) codes. All the developed decoders can directly include both qubit erasures and Pauli errors in the decoding step, thus addressing the dominant noise mechanisms for photonic quantum computing. We investigate the strengths and weaknesses of the different decoder variants, benchmark their speed and threshold error rates on several codes, and provide the used source code. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_15988 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Breadth-first graph traversal union-find decoder Löbl, Matthias C. Chen, Susan X. Paesani, Stefano Sørensen, Anders S. Quantum Physics Fast decoding algorithms are decisive for real-time quantum error correction and for analyzing properties of error correction codes. Here, we develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages. Furthermore, we show how these methods can be adapted to decode non-topological quantum low-density-parity-check (qLDPC) codes. All the developed decoders can directly include both qubit erasures and Pauli errors in the decoding step, thus addressing the dominant noise mechanisms for photonic quantum computing. We investigate the strengths and weaknesses of the different decoder variants, benchmark their speed and threshold error rates on several codes, and provide the used source code. |
| title | Breadth-first graph traversal union-find decoder |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2407.15988 |