arXiv:2610.22112
Patchwork: automated lattice surgery and space-time partitioning for real-time decoding
Christopher Chamberland, Muyuan Li, Scott Thornton, Justin Gage Lietz, Melody Ren, Antonio deMarti iOlius
Abstract
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.
AI Summary
The paper addresses how to compile multi-qubit Pauli measurements into surface-code lattice-surgery circuits while partitioning the resulting decoding problem. It presents `patchwork`, a compiler for a prescribed two-dimensional narrow-corridor layout, with rules for routing, stabilizer placement, logical-observable tracking, and spatially varying gate schedules. Twist-based logical $Y$ measurements use dedicated measurement circuits and protruding patch lobes that fit within existing routing corridors. For tested untrimmed constructions at $d\leq11$, reported exhaustive numerical searches find no logical failures from at most $(d-1)/2$ circuit faults. A wavefront algorithm partitions merged patches into commit regions, contextual buffers, and cleanup regions. Commit decoding runs independently before corrections update the syndrome for cleanup decoding. Circuit-level depolarizing-noise simulations test three sequential Pauli measurements involving ten logical qubits. Paired comparisons at $d=5,7,9,11,13$ and $p=0.001,0.002$ give staged-to-monolithic total-failure ratios of $1.003$–$1.015$, using correlated minimum-weight perfect matching. For random measurement weights increasing from 2 to 64 at $d=11$, mean full-patch area grows $24.8$-fold, versus $5.5$-fold for the largest buffered commit region. Distance preservation is numerically supported rather than generally proved; trimming lobes can reduce distance, and overlapping extensions require checking complete circuits. Cleanup likelihoods approximate residual noise, and separate workers do not fully retain cross-region correlations. The demonstrated sequence requires $d$ idle rounds between measurements. Region-area reductions are not decoding-latency measurements: real-time implementation and direct latency evaluation remain future work.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 66 pages, 33 figures, comments welcome!