发表机构
Yonsei University（延世大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
SpiderLS利用完整ZX归约扩展格手术编译方法，经编译器 passes 处理后，在算法和随机工作负载上，较现有ZX基编译器实现时空体积降49.2%、编译时间降99.8%。
AI 中文摘要
格手术编译在将容错量子程序转换为高效表面代码实现中处于核心地位，其中空间和时间资源直接决定执行成本。近期研究表明，将ZX图作为格手术编译的中间表示具有优势，可实现保留语义的变换以降低时空成本。但现有编译方法限制ZX归约以保留可直接嵌入格手术结的图结构。本文提出SpiderLS，通过利用完整ZX归约扩展了现有方法。为将所得图转换为可执行格手术操作，SpiderLS应用一系列编译器 passes，推导执行顺序、通过将兼容交互分组为多目标操作生成目标代码，并将目标代码降至泡利乘积测量。所得显式补丁和泡利边界需求指导逻辑调度和结构感知时空路由。在代表性算法和随机工作负载上，与现有基于ZX的编译器相比，SpiderLS实现时空体积平均降低49.2%，编译时间平均降低99.8%。
英文摘要
Lattice surgery compilation plays a central role in translating fault-tolerant quantum programs into efficient surface code realizations, where both spatial and temporal resources directly determine the cost of execution. Recent work has demonstrated the benefits of using ZX-diagrams as an intermediate representation for lattice surgery compilation, enabling semantics-preserving transformations that reduce spacetime cost. However, existing compilation restricts ZX reduction to preserve diagram structures that can be directly embedded as lattice surgery junctions. We present SpiderLS, which extends prior approach by leveraging full ZX reduction. To translate the resulting diagram into executable lattice surgery operations, SpiderLS applies a sequence of compiler passes that derives an execution order, generates target code by grouping compatible interactions into multi-target operations, and lowers the target code to Pauli-product measurements. The resulting explicit patch and Pauli-boundary requirements guide logical scheduling and structure-aware spacetime routing. Across representative algorithmic and random workloads, SpiderLS achieves average reductions of 49.2% in spacetime volume and 99.8% in compilation time compared with the prior ZX-based compiler.
Comments14 pages, 17 figures
