AI 中文总结
CircLS是一款将格点手术的泡利乘积测量序列编译为Stim电路的开源编译器，通过动态分配数据块，可减少时空体积并降低逻辑错误率。
AI 中文摘要
在容错量子计算中，格点手术（Lattice Surgery, LS）是实现逻辑操作的主流方式之一，而泡利乘积测量（Pauli Product Measurement, PPM）是基于LS的计算的基本指令。然而，针对PPM序列的编译器仍停留在逻辑层面，而非物理电路层面，这是因为该降级过程十分复杂：PPM之间差异极大，且每个PPM必须在不破坏容错性的前提下在物理电路上实现。CircLS通过线性时间的稳定子构造规则将PPM序列降级为Stim电路，完成了从量子程序经PPM序列到Stim电路的全流程，编译后的程序可在电路层面进行验证并测量其逻辑错误率（Logical Error Rate, LER）。基于该降级过程，我们开发了一款动态分配数据块的编译器：每个数据块在首次使用时分配，在最后一次使用时释放，释放后的单元可作为辅助量子比特路径重复使用。与生成可运行电路的现有工具链相比，CircLS将分配的时空体积减少了5.5倍，逻辑错误率降低了14倍。CircLS为开源项目，详见此https URL。
英文摘要
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
