Fast surgery for quantum LDPC codes
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911192877891584 |
|---|---|
| author | Baspin, Nouédyn Berent, Lucas Cohen, Lawrence Z. |
| author_facet | Baspin, Nouédyn Berent, Lucas Cohen, Lawrence Z. |
| contents | Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations come with distance-dependent temporal overheads. We introduce a scheme for performing generalized surgery on quantum LDPC codes using a constant number of rounds of syndrome measurement. The merged code in our scheme is constructed by taking the total complex of the base code and a suitably chosen homomorphic chain complex. We demonstrate the applicability of our scheme on an example multi-cycle code and assess the performance under a phenomenological noise model, showing that fast surgery performs comparably to standard generalized surgery with multiple rounds. Our results pave the way towards fault-tolerant quantum computing with LDPC codes with both low spatial and temporal overheads. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_04521 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Fast surgery for quantum LDPC codes Baspin, Nouédyn Berent, Lucas Cohen, Lawrence Z. Quantum Physics Quantum LDPC codes promise significant reductions in physical qubit overhead compared with topological codes. However, many existing constructions for performing logical operations come with distance-dependent temporal overheads. We introduce a scheme for performing generalized surgery on quantum LDPC codes using a constant number of rounds of syndrome measurement. The merged code in our scheme is constructed by taking the total complex of the base code and a suitably chosen homomorphic chain complex. We demonstrate the applicability of our scheme on an example multi-cycle code and assess the performance under a phenomenological noise model, showing that fast surgery performs comparably to standard generalized surgery with multiple rounds. Our results pave the way towards fault-tolerant quantum computing with LDPC codes with both low spatial and temporal overheads. |
| title | Fast surgery for quantum LDPC codes |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2510.04521 |