SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation
Abstract
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.
Related
- Demand-Driven Routing Space for Lattice-Surgery Compilation
- The HALO Engine: 𝒪(1)-Step Compilation and Localized String Rupture for Lattice Gauge Theories on Quantum Hardware
- A variational framework for variance reduction in lattice field theory
- Operator-Guided Model Reduction for Generative Sampling in Lattice Field Theory
- Hybrid Lattice Surgery between Smooth Boundaries
BibTeX
@misc{kim2026spiderls,
title = {{SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation}},
author = {Hyungseok Kim and Changheon Lee and Seungjik Kim and Enhyeok Jang and Youngmin Kim and Seungwoo Choi and Hanbit Lee and Sungho Pyun and Won Woo Ro},
howpublished = {arXiv},
year = {2026},
month = aug,
doi = {10.48550/arxiv.2608.30228},
eprint = {2608.30228},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.30228},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation
AU - Hyungseok Kim
AU - Changheon Lee
AU - Seungjik Kim
AU - Enhyeok Jang
AU - Youngmin Kim
AU - Seungwoo Choi
AU - Hanbit Lee
AU - Sungho Pyun
AU - Won Woo Ro
PY - 2026
DA - 2026/08/31
PB - arXiv
DO - 10.48550/arxiv.2608.30228
UR - https://arxiv.org/abs/2608.30228
AB - 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.
ER -