Metraipolis › archive › dc_2c1be25aeff8

SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation — arXiv:2608.30228

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.30228
License (as archived)
CC0-1.0
Archived
2026-10-17T10:14:51.294Z
SHA-256 of the archived text
8df797ff97a2a6c699ffc5af3f56ca7b2e7359906c91696fea722ca4b5541fb7
Stable URL of this page
https://metraipolis.com/documento/dc_2c1be25aeff8

How to cite

SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation — arXiv:2608.30228 — arXiv (en), https://arxiv.org/abs/2608.30228 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2c1be25aeff8 (Metraipolis archive dc_2c1be25aeff8, sha256 8df797ff97a2a6c699ffc5af3f56ca7b2e7359906c91696fea722ca4b5541fb7)
BibTeX
@misc{dc2c1be25aeff8,
  title = {SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation — arXiv:2608.30228},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.30228},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2c1be25aeff8; sha256 8df797ff97a2a6c699ffc5af3f56ca7b2e7359906c91696fea722ca4b5541fb7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30228. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.30228 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:03:37.605Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).