Bubble Clustering Decoder for Quantum Topological Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908296541110272 |
|---|---|
| author | Forlivesi, Diego Valentini, Lorenzo Chiani, Marco |
| author_facet | Forlivesi, Diego Valentini, Lorenzo Chiani, Marco |
| contents | Quantum computers are highly vulnerable to noise, necessitating the use of error-correcting codes to protect stored data. Errors must be continuously corrected over time to counteract decoherence using appropriate decoders. Therefore, fast decoding strategies capable of handling real-time syndrome extraction are crucial for achieving fault-tolerant quantum computing. In this paper, we introduce the bubble clustering (BC) decoder for quantum surface codes, which serves as a low-latency replacement for MWPM, achieving significantly faster execution at the cost of a slight performance degradation. This speed boost is obtained leveraging an efficient cluster generation based on bubbles centered on defects, and avoiding the computational overhead associated with cluster growth and merging phases, commonly adopted in traditional decoders. Our complexity analysis reveals that the proposed decoder operates with a complexity on the order of the square of the number of defects. For moderate physical error rates, this is equivalent to linear complexity in the number of data qubits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_01654 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Bubble Clustering Decoder for Quantum Topological Codes Forlivesi, Diego Valentini, Lorenzo Chiani, Marco Quantum Physics Quantum computers are highly vulnerable to noise, necessitating the use of error-correcting codes to protect stored data. Errors must be continuously corrected over time to counteract decoherence using appropriate decoders. Therefore, fast decoding strategies capable of handling real-time syndrome extraction are crucial for achieving fault-tolerant quantum computing. In this paper, we introduce the bubble clustering (BC) decoder for quantum surface codes, which serves as a low-latency replacement for MWPM, achieving significantly faster execution at the cost of a slight performance degradation. This speed boost is obtained leveraging an efficient cluster generation based on bubbles centered on defects, and avoiding the computational overhead associated with cluster growth and merging phases, commonly adopted in traditional decoders. Our complexity analysis reveals that the proposed decoder operates with a complexity on the order of the square of the number of defects. For moderate physical error rates, this is equivalent to linear complexity in the number of data qubits. |
| title | Bubble Clustering Decoder for Quantum Topological Codes |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2504.01654 |