Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.05402 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915837963665408 |
|---|---|
| author | Tan, Shi Jie Samuel Gill, Ian Huang, Eric Liu, Pengyu Zhao, Chen Dehghani, Hossein Kubica, Aleksander Zhou, Hengyun Dua, Arpit |
| author_facet | Tan, Shi Jie Samuel Gill, Ian Huang, Eric Liu, Pengyu Zhao, Chen Dehghani, Hossein Kubica, Aleksander Zhou, Hengyun Dua, Arpit |
| contents | Two-dimensional topological translationally-invariant (TTI) quantum codes, such as the toric code (TC) and bivariate bicycle (BB) codes, are promising candidates for fault-tolerant quantum computation. For such codes to be practically relevant, their decoders must successfully correct the most likely errors while remaining computationally efficient. For the TC, graph-matching decoders satisfy both requirements and, additionally, admit provable performance guarantees. Given the equivalence between TTI codes and (multiple copies of) the TC, one may then ask whether TTI codes also admit analogous graph-matching decoders. In this work, we develop a graph-matching approach to decoding general TTI codes. Intuitively, our approach coarse-grains the TTI code to obtain an effective description of the syndrome in terms of TC excitations, which can then be removed using graph-matching techniques. We prove that our decoders correct errors of weight up to a constant fraction of the code distance and achieve non-zero code-capacity thresholds. We further numerically study a variant optimized for practically relevant BB codes and observe performance comparable to that of the belief propagation with ordered statistics decoder. Our results indicate that graph-matching decoders are a viable approach to decoding BB codes and other TTI codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_05402 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Generalized matching decoders for 2D topological translationally-invariant codes Tan, Shi Jie Samuel Gill, Ian Huang, Eric Liu, Pengyu Zhao, Chen Dehghani, Hossein Kubica, Aleksander Zhou, Hengyun Dua, Arpit Quantum Physics Data Structures and Algorithms Two-dimensional topological translationally-invariant (TTI) quantum codes, such as the toric code (TC) and bivariate bicycle (BB) codes, are promising candidates for fault-tolerant quantum computation. For such codes to be practically relevant, their decoders must successfully correct the most likely errors while remaining computationally efficient. For the TC, graph-matching decoders satisfy both requirements and, additionally, admit provable performance guarantees. Given the equivalence between TTI codes and (multiple copies of) the TC, one may then ask whether TTI codes also admit analogous graph-matching decoders. In this work, we develop a graph-matching approach to decoding general TTI codes. Intuitively, our approach coarse-grains the TTI code to obtain an effective description of the syndrome in terms of TC excitations, which can then be removed using graph-matching techniques. We prove that our decoders correct errors of weight up to a constant fraction of the code distance and achieve non-zero code-capacity thresholds. We further numerically study a variant optimized for practically relevant BB codes and observe performance comparable to that of the belief propagation with ordered statistics decoder. Our results indicate that graph-matching decoders are a viable approach to decoding BB codes and other TTI codes. |
| title | Generalized matching decoders for 2D topological translationally-invariant codes |
| topic | Quantum Physics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2603.05402 |