Real-time decoding of the gross code memory with FPGAs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912669079961600 |
|---|---|
| author | Maurer, Thilo Bühler, Markus Kröner, Michael Haverkamp, Frank Müller, Tristan Vandeth, Drew Johnson, Blake R. |
| author_facet | Maurer, Thilo Bühler, Markus Kröner, Michael Haverkamp, Frank Müller, Tristan Vandeth, Drew Johnson, Blake R. |
| contents | We introduce a prototype FPGA decoder implementing the recently discovered Relay-BP algorithm and targeting memory experiments on the $[[144,12,12]]$ bivariate bicycle quantum low-density parity check code. The decoder is both fast and accurate, achieving a belief propagation iteration time of 24ns. It matches the logical error performance of a floating-point implementation despite using reduced precision arithmetic. This speed is sufficient for an average per cycle decoding time under $1\,\mathrm{μs}$ assuming circuit model error probabilities are less than $3 \times 10^{-3}$. This prototype decoder offers useful insights on the path toward decoding solutions for scalable fault-tolerant quantum computers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_21600 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Real-time decoding of the gross code memory with FPGAs Maurer, Thilo Bühler, Markus Kröner, Michael Haverkamp, Frank Müller, Tristan Vandeth, Drew Johnson, Blake R. Quantum Physics We introduce a prototype FPGA decoder implementing the recently discovered Relay-BP algorithm and targeting memory experiments on the $[[144,12,12]]$ bivariate bicycle quantum low-density parity check code. The decoder is both fast and accurate, achieving a belief propagation iteration time of 24ns. It matches the logical error performance of a floating-point implementation despite using reduced precision arithmetic. This speed is sufficient for an average per cycle decoding time under $1\,\mathrm{μs}$ assuming circuit model error probabilities are less than $3 \times 10^{-3}$. This prototype decoder offers useful insights on the path toward decoding solutions for scalable fault-tolerant quantum computers. |
| title | Real-time decoding of the gross code memory with FPGAs |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2510.21600 |