GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes

Abstract

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.