arXiv:2610.01923
Loss-tolerant distributed lattice surgery using fusion networks
Felix Burt, Richard Meister, Sheng-Ku Lin, Kuan-Cheng Chen, Michael Hanks, Roberto Bondesan, M. S. Kim, Kin K. Leung
Abstract
Networking matter-based quantum processing units (QPUs) offers a promising route to scaling fault-tolerant quantum computers. This requires distributed logical operations to be performed across photonic links, where noise is characteristically different from and stronger than in local QPUs owing to photon loss and probabilistic linear-optical operations. Measurement- and fusion-based quantum computing are designed to be robust against loss and probabilistic photonic operations, suggesting they could complement circuit-based error correction at the interface between networked QPUs. We use ZX calculus transformations to construct hybrid syndrome extraction protocols and apply them to distributed rotated surface code lattice surgery, demonstrating that several protocols attain a $50\%$ interface-erasure threshold when local noise is absent, including circuit-based lattice surgery using fused Bell pairs and hybrid protocols using linear cluster states. Relative to a straight Bell-pair interface geometry, the hybrid protocols increase the merge-observable interface distance from $d+1$ to $2d+1$ and restore the perpendicular-observable interface distance from $\lfloor(d+1)/2\rfloor$ to $d$. We calculate how the threshold decreases when using truncated resource states and map correctable regions under resource-state errors, local circuit noise, and fusion erasure. We then convert these erasure thresholds into photon-loss thresholds and probe subthreshold performance using fusion boosting. At circuit and resource-state error rates of $10^{-3}$, local errors largely mask the interface-distance advantage. As local noise is reduced to $10^{-4}$ and below, the linear-chain protocols improve more rapidly with decreasing erasure, suggesting that interface distance enhancements are effective in low local noise regimes.
AI Summary
The paper asks how distributed surface-code lattice surgery can exploit heralded photon loss and probabilistic fusion outcomes directly, rather than post-selecting successful network links. It constructs hybrid syndrome-extraction protocols using ZX-calculus transformations that preserve Pauli webs, replacing the surgery seam with fusion networks of linear cluster resources while retaining circuit-based extraction within each processor. With ideal operations away from the interface and independent erasure of elementary fusion outcomes, square-lattice percolation gives a $50\%$ threshold for both fused-Bell-pair interfaces and untruncated hybrid chains. Relative to a straight Bell-pair interface, the hybrid construction increases the merge-record interface distance from $d+1$ to $2d+1$ and the perpendicular-correlation distance from $\lfloor(d+1)/2\rfloor$ to $d$. A zig-zag Bell interface also restores the latter to $d$. Truncating hybrid resources to eight or five qubits preserves these interface distances but lowers the predicted erasure thresholds to approximately $38.2\%$ and $31.8\%$. Stim simulations with erasure-aware correlated matching test these predictions, map correctable regions with resource and circuit errors, and examine photon loss and fusion boosting. At local and resource error rates of $10^{-3}$, local faults largely mask the interface-distance advantage; at $10^{-4}$ and below, hybrid chains show stronger merge-record suppression as erasure decreases. Zig-zag Bell interfaces remain best for the perpendicular correlation. The analysis assumes deterministic resource availability, uses simplified preparation noise and noiseless idles, and does not establish total-overhead savings. Boundary-fusion faults introduce perpendicular distance-reducing mechanisms; explicit resource-generation circuits and remedies for these faults remain unmodelled.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 31 pages, 20 figures