SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation

• URL: http://arxiv.org/abs/2608.30228v1
• Date: Mon, 31 Aug 2026 04:28:07 GMT
• Title: SpiderLS: Leveraging Full ZX Reduction for Lattice Surgery Compilation
• Abstract summary: lattice surgery compilation plays a central role in translating fault-tolerant quantum programs into efficient surface code realizations.<n>Recent work has demonstrated the benefits of using ZX-diagrams as an intermediate representation for lattice surgery compilation.<n>We present SpiderLS, which extends prior approach by leveraging full ZX reduction.
• Score: 12.887272622279923
• License: http://creativecommons.org/licenses/by/4.0/
• 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 papers

• Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation [0.22166578153935787]
  Fault-tolerant quantum computing based on lattice surgery requires place-and-route compilation with low spacetime overhead.<n>We introduce double-slice routing, a constant-depth spacetime-routing method that uses two consecutive time slices.<n>We numerically benchmark the resulting compiler on Hamiltonian-simulation workloads to show that double-slice routing reduces compilation cost by up to a factor of 2.4 over a single-slice baseline.
  arXiv  Detail & Related papers  (2026-06-19T08:03:26Z)
• CODA: Rewriting Transformer Blocks as GEMM-Epilogue Programs [48.961770224590204]
  CODA is a GPU kernel abstraction that expresses these computations as GEMM-plus-epilogue programs.<n>We show that CODA offers a practical path toward combining framework-level productivity with hardware-level efficiency.
  arXiv  Detail & Related papers  (2026-05-19T02:30:43Z)
• C-Phase-Aware Compilation for Efficient Fault-Tolerant Quantum Execution [1.635939418192339]
  This work presents a microarchitecture-aware compilation approach that integrates algorithmic structure directly with lattice surgery execution.<n>We design a dynamic, event-driven scheduling strategy that accurately models spatial layout and routing constraints.<n>This approach substantially reduces idle resources and achieves up to a 59.7$times$ reduction in execution time compared to standard baselines.
  arXiv  Detail & Related papers  (2026-05-13T19:03:18Z)
• TopoLS: Lattice Surgery Compilation via Topological Program Transformations [6.387941081167297]
  TopoLS is a topological compiler that combines ZX-diagram optimizations with Monte Carlo tree search guided by different operation placements and topology-aware circuit partitioning.<n>Compared to the SAT-solver-based compiler, TopoLS offers an effective and scalable solution for lattice-surgery compilation.
  arXiv  Detail & Related papers  (2026-01-30T15:54:57Z)
• Re-Densification Meets Cross-Scale Propagation: Real-Time Neural Compression of LiDAR Point Clouds [83.39320394656855]
  LiDAR point clouds are fundamental to various applications, yet high-precision scans incur substantial storage and transmission overhead.<n>Existing methods typically convert unordered points into hierarchical octree or voxel structures for dense-to-sparse predictive coding.<n>Our framework comprises two lightweight modules. First, the Geometry Re-Densification Module re-densifies encoded sparse geometry, extracts features at denser scale, and then re-sparsifies the features for predictive coding.
  arXiv  Detail & Related papers  (2025-08-28T06:36:10Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• A High Performance Compiler for Very Large Scale Surface Code Computations [38.26470870650882]
  We present the first high performance compiler for very large scale quantum error correction. It translates an arbitrary quantum circuit to surface code operations based on lattice surgery. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device.
  arXiv  Detail & Related papers  (2023-02-05T19:06:49Z)
• New magic state distillation factories optimized by temporally encoded lattice surgery [0.0]
  Timelike failures during lattice surgery protocols can result in logical failures during the execution of an algorithm. We introduce an improved TELS protocol and subsequently augment it with the ability to correct low-weight classical errors. We also explore large families of classical error correcting codes for a wide range of parallelizable Pauli set sizes.
  arXiv  Detail & Related papers  (2022-10-28T00:34:37Z)
• NumS: Scalable Array Programming for the Cloud [82.827921577004]
  We present NumS, an array programming library which optimize NumPy-like expressions on task-based distributed systems. This is achieved through a novel scheduler called Load Simulated Hierarchical Scheduling (LSHS) We show that LSHS enhances performance on Ray by decreasing network load by a factor of 2x, requiring 4x less memory, and reducing execution time by 10x on the logistic regression problem.
  arXiv  Detail & Related papers  (2022-06-28T20:13:40Z)
• Universal quantum computing with twist-free and temporally encoded lattice surgery [3.222802562733787]
  We introduce a decoder capable of correcting spacelike and timelike errors during lattice surgery protocols. We compute logical failure rates of a lattice surgery protocol for a biased circuit-level noise model. We propose a layout for a quantum processor that is more efficient for rectangular surface codes exploiting noise bias.
  arXiv  Detail & Related papers  (2021-09-06T21:18:01Z)
• Combiner: Full Attention Transformer with Sparse Computation Cost [142.10203598824964]
  We propose Combiner, which provides full attention capability in each attention head while maintaining low computation complexity. We show that most sparse attention patterns used in existing sparse transformers are able to inspire the design of such factorization for full attention. An experimental evaluation on both autoregressive and bidirectional sequence tasks demonstrates the effectiveness of this approach.
  arXiv  Detail & Related papers  (2021-07-12T22:43:11Z)
• Trans-SVNet: Accurate Phase Recognition from Surgical Videos via Hybrid Embedding Aggregation Transformer [57.18185972461453]
  We introduce for the first time in surgical workflow analysis Transformer to reconsider the ignored complementary effects of spatial and temporal features for accurate phase recognition. Our framework is lightweight and processes the hybrid embeddings in parallel to achieve a high inference speed.
  arXiv  Detail & Related papers  (2021-03-17T15:12:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.