CircLS: Compiling Lattice Surgery to Physical Circuits with Dynamic Allocation
Abstract
In fault-tolerant quantum computing, lattice surgery (LS) is one of the leading ways to realize logical operations, and the Pauli product measurement (PPM) is the basic instruction of LS-based computing. Compilers that work on the PPM sequence, however, stay at the logical level rather than the physical circuit level. This is because lowering PPMs from the logical level to physical circuits is complicated. CircLS is a full-stack lattice surgery compiler: it compiles a quantum program through its PPM sequence to a Stim circuit, lowering every PPM through linear-time stabilizer construction rules. On this basis, we develop a compiler that allocates data patches dynamically: each patch is allocated at its first use and freed at its last use, and the freed tiles can be reused as ancilla paths. Against the two baselines, CircLS reduces the allocated spacetime volume by 34% and 27% and the logical error rate (LER) by 40% and 48%, and it compiles programs that they cannot. CircLS is open source at https://github.com/John-YuehanZhang/CircLS
Related
- COΦ - COmpiling PHotonics into dIgital quantum circuits
- Computational Complexity of Clifford Template Compilation: Are Quantum Computers Useful for Compiling Quantum Circuits?
- Shot Allocation Strategies in Debugging Quantum Circuits
- Symmetry-Preserving and Scalable Variational Circuits for the Lattice Gross-Neveu Model
- Exact quantum circuits for a lattice Boltzmann realization of the Dirac equation
BibTeX
@misc{zhang2026circls,
title = {{CircLS: Compiling Lattice Surgery to Physical Circuits with Dynamic Allocation}},
author = {John Yuehan Zhang},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2608.23819},
eprint = {2608.23819},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.23819},
}
RIS
TY - UNPB
TI - CircLS: Compiling Lattice Surgery to Physical Circuits with Dynamic Allocation
AU - John Yuehan Zhang
PY - 2026
DA - 2026/09/21
PB - arXiv
DO - 10.48550/arxiv.2608.23819
UR - https://arxiv.org/abs/2608.23819
AB - In fault-tolerant quantum computing, lattice surgery (LS) is one of the leading ways to realize logical operations, and the Pauli product measurement (PPM) is the basic instruction of LS-based computing. Compilers that work on the PPM sequence, however, stay at the logical level rather than the physical circuit level. This is because lowering PPMs from the logical level to physical circuits is complicated. CircLS is a full-stack lattice surgery compiler: it compiles a quantum program through its PPM sequence to a Stim circuit, lowering every PPM through linear-time stabilizer construction rules. On this basis, we develop a compiler that allocates data patches dynamically: each patch is allocated at its first use and freed at its last use, and the freed tiles can be reused as ancilla paths. Against the two baselines, CircLS reduces the allocated spacetime volume by 34% and 27% and the logical error rate (LER) by 40% and 48%, and it compiles programs that they cannot. CircLS is open source at https://github.com/John-YuehanZhang/CircLS
ER -