Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.22347 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914058177871872 |
|---|---|
| author | Liu, Zejun Gong, Anqi Clark, Bryan K. |
| author_facet | Liu, Zejun Gong, Anqi Clark, Bryan K. |
| contents | An efficient decoder is essential for quantum error correction, and data-driven neural decoders have emerged as promising, flexible solutions. Here, we introduce a diffusion model framework to infer logical errors from syndrome measurements in quantum low-density parity-check codes. Using the bivariate bicycle code with realistic circuit-level noise, we show that masked diffusion decoders are more accurate, often faster on average, and always faster in the worst case than other state-of-the-art decoders, including belief propagation with ordered statistics decoding (BP-OSD) and autoregressive neural decoders. We show that by using fewer diffusion steps during inference one can gain significant speed at minimal cost in accuracy. By examining the factored attention from our trained neural network we find that, despite being trained solely on paired samples of syndrome-logical errors, this diffusion decoder learns the structure of the quantum codes. We also compare both masked and continuous diffusion decoders on code-capacity noise models, finding that masked diffusion decoders scale better than continuous diffusion decoders. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_22347 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Decoding quantum low density parity check codes with diffusion Liu, Zejun Gong, Anqi Clark, Bryan K. Quantum Physics An efficient decoder is essential for quantum error correction, and data-driven neural decoders have emerged as promising, flexible solutions. Here, we introduce a diffusion model framework to infer logical errors from syndrome measurements in quantum low-density parity-check codes. Using the bivariate bicycle code with realistic circuit-level noise, we show that masked diffusion decoders are more accurate, often faster on average, and always faster in the worst case than other state-of-the-art decoders, including belief propagation with ordered statistics decoding (BP-OSD) and autoregressive neural decoders. We show that by using fewer diffusion steps during inference one can gain significant speed at minimal cost in accuracy. By examining the factored attention from our trained neural network we find that, despite being trained solely on paired samples of syndrome-logical errors, this diffusion decoder learns the structure of the quantum codes. We also compare both masked and continuous diffusion decoders on code-capacity noise models, finding that masked diffusion decoders scale better than continuous diffusion decoders. |
| title | Decoding quantum low density parity check codes with diffusion |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2509.22347 |