arXiv:2609.26784
Error Suppression in Distributed Quantum Computing with Heterogeneous-Distance Lattice Surgery
Daniel Dilley, Anastashia Jebraeilli, Rayat Roy, Shobhit Gupta, Alvin Gonzales, Zain Saleem
Abstract
Distributed quantum computing requires fault-tolerant operations across inter-QPU links that can be substantially noisier than local gates. Uniformly increasing code distance provides additional protection but also enlarges data patches used for local storage and computation. Here, we introduce distributed heterogeneous-distance lattice surgery using an eight-data-patch ancilla-mediated (8-DAM) architecture, which will be useful for near-term quantum devices with less qubit overhead. In this architecture, the central ancilla spanning the inter-QPU boundary is enlarged while the data patches retain distance $d$. The protocol uses traveling stabilizers to suppress hook errors during merge and split operations between these unequal-distance patches. Circuit-level simulations of rotated surface codes at fixed local depolarizing noise show that logical-readout error rates depend only weakly on link noise. The resulting advantage over conventional lattice surgery grows as link errors increase. Comparisons with uniform distance implementations demonstrate comparable logical error suppression with reduced physical-qubit overhead. We also demonstrate how 8-DAM layouts support two simultaneous distributed logical CNOT operations between four logical data qubits using a single enlarged ancilla. At higher link noise, this construction yields lower logical error rates and more stability than two independent distributed logical CNOTs. These results support selective ancilla enlargement as a resource-efficient approach to fault-tolerant distributed quantum computing.
AI Summary
The paper asks whether protection against noisy inter-QPU links can be concentrated at the interface rather than obtained by enlarging every surface-code patch. Its heterogeneous-distance lattice-surgery construction retains distance-$d$ data patches and uses a central ancilla of distance $d_A=2d+1$ spanning the processor boundary. Traveling-stabilizer syndrome schedules accommodate unequal patch sizes and avoid hook-error paths. An eight-neighbor ancilla-mediated layout also supports two simultaneous logical CNOTs through an ancilla encoding two logical qubits. Circuit-level Stim simulations with PyMatching decoding evaluate $3\! -\!7\! -\!3$ and $5\! -\!11\! -\!5$ configurations, fixing local depolarizing noise at $10^{-4}$ and sweeping link noise from $10^{-3}$ to $10^{-2}$. At link noise $10^{-2}$, the $3\! -\!7\! -\!3$ control-$X$ and target-$Z$ readout failure probabilities are $9.47\times10^{-5}$ and $4.67\times10^{-5}$, approximately 13 and 19 times below uniform distance-3 results. The $5\! -\!11\! -\!5$ results are comparable to uniform distance-9, using 373 rather than 521 physical sites—a 28.4% reduction—but require 264 rather than 153 inter-QPU CNOT applications. Dual-CNOT target-readout simulations likewise show weaker link-noise dependence than two independent distance-3 operations. The reported metrics are selected logical-observable decoding failures, not total logical-gate failure probabilities. Ancilla enlargement and scheduling contributions are not isolated. The model excludes idle errors, link-generation failures and latency, leakage, and correlated link noise; throughput and hardware-level advantages therefore remain unquantified. Nearest-neighbor routing and alternative interface orientations are discussed but not numerically validated.
Error found: The abstract describes lower logical error rates for the simultaneous dual-CNOT construction, but its comparison establishes this only for target-Z readout failures, not for total logical-gate failure or control-X failures.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.