Patchwork: automated lattice surgery and space-time partitioning for real-time decoding

@misc{chamberland2026patchwork,
  title = {{Patchwork: automated lattice surgery and space-time partitioning for real-time decoding}},
  author = {Christopher Chamberland and Muyuan Li and Scott Thornton and Justin Gage Lietz and Melody Ren and Antonio deMarti iOlius},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.22112},
  eprint = {2610.22112},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.22112},
  note = {CC BY 4.0},
}

TY  - UNPB
TI  - Patchwork: automated lattice surgery and space-time partitioning for real-time decoding
AU  - Christopher Chamberland
AU  - Muyuan Li
AU  - Scott Thornton
AU  - Justin Gage Lietz
AU  - Melody Ren
AU  - Antonio deMarti iOlius
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.22112
UR  - https://arxiv.org/abs/2610.22112
AB  - We introduce patchwork, a lattice-surgery compiler for arbitrary multi-qubit Pauli measurements on a prescribed narrow-corridor two-dimensional surface-code layout. Systematic geometric rules simplify stabilizer placement and gate scheduling, including for logical Y measurements implemented using twist defects. We introduce measurement circuits and schedules that, together with protruding lobes of Y-extension patches, preserve the full effective code distance for all numerically tested code distances. To support parallel decoding, we develop a wavefront algorithm that partitions merged lattice-surgery patches into space-time commit, buffer, and cleanup regions. Simulations of three sequential multi-qubit Pauli measurements acting on ten logical qubits show that staged decoding achieves total failure probabilities close to those of monolithic decoding over the parameters tested. These methods provide an automated framework for fault-tolerant lattice surgery and a route toward scalable, real-time decoding.
ER  -