GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913151140757504 |
|---|---|
| author | Zhou, Junyu Javadi-Abhari, Ali Li, Gushu |
| author_facet | Zhou, Junyu Javadi-Abhari, Ali Li, Gushu |
| contents | Efficiently realizing logical operations on general stabilizer codes remains a long-standing challenge in fault tolerant quantum computing. While code surgery provides a general framework with provable guarantees by joint logical measurements, existing constructions are largely theoretical and incur substantial ancilla overhead in practice. In this work, we propose GeneCS, a resource-efficient compiler for synthesizing code surgery protocols for arbitrary stabilizer codes. Our approach leverages structure-aware optimizations to eliminate redundancy in graph construction, dynamically balance expansion and congestion, and incorporate code degree constraints. Experimental results show that GeneCS achieves an average reduction of over $85\%$ in ancillary qubits and checks for both single-code and cross-code logical operations, while preserving logical error rates. Moreover, our compiler scales to codes with more than $10^4$ qubits with an amortized compilation time of about one second per instance. These results enable practical logical operations and efficient cross-code communication, thereby supporting the deployment of modern QLDPC codes and heterogeneous quantum architectures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_21746 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes Zhou, Junyu Javadi-Abhari, Ali Li, Gushu Quantum Physics Efficiently realizing logical operations on general stabilizer codes remains a long-standing challenge in fault tolerant quantum computing. While code surgery provides a general framework with provable guarantees by joint logical measurements, existing constructions are largely theoretical and incur substantial ancilla overhead in practice. In this work, we propose GeneCS, a resource-efficient compiler for synthesizing code surgery protocols for arbitrary stabilizer codes. Our approach leverages structure-aware optimizations to eliminate redundancy in graph construction, dynamically balance expansion and congestion, and incorporate code degree constraints. Experimental results show that GeneCS achieves an average reduction of over $85\%$ in ancillary qubits and checks for both single-code and cross-code logical operations, while preserving logical error rates. Moreover, our compiler scales to codes with more than $10^4$ qubits with an amortized compilation time of about one second per instance. These results enable practical logical operations and efficient cross-code communication, thereby supporting the deployment of modern QLDPC codes and heterogeneous quantum architectures. |
| title | GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2605.21746 |