arXiv:2609.39980
Logical information localisation in stabiliser codes via single-qubit measurements
Jelena Mackeprang, Hemant Sharma, Jonas Helsen
Abstract
Stabiliser path finding (SPF) has previously been introduced as a method to localise logical information in a stabiliser code undergoing loss onto a single pre-specified target qubit, using only one round of single-qubit measurements. When working with limited resources and flying qubits, this fast read-out of logical information is a helpful tool for fault-tolerant communication. In this work, we provide a broad analytical and computational study of localisation via SPF. We introduce $g$-SPF, where the task is to localise the logical information onto a set of at most $g$ unspecified target qubits. Through analytical arguments based on percolation theory and the disjointness of stabiliser codes, we prove that for i.i.d. qubit loss with probability $p<1/2$ and sufficiently large planar surface codes, localisation via $g$-SPF for constant $g$ succeeds with a probability converging to one, which establishes a localisation threshold. Furthermore, we propose and implement two algorithms to solve SPF. The first is exact and formulates SPF as an integer linear program, whereas the second is heuristic and formulates SPF as a decoding problem. We validate both algorithms by numerically reproducing the localisation threshold for the surface code and demonstrate that the heuristic algorithm is considerably faster. Our work significantly reduces the time required to solve SPF compared to current state-of-the-art algorithms, allowing us to study localisation in substantially larger stabiliser codes than previously considered in the literature. Together, these theoretical and computational results open the door to various applications, such as fault-tolerant teleportation and efficient logical fusion.
AI Summary
The paper studies whether logical information in a stabiliser code undergoing qubit loss can be localised using one round of single-qubit Pauli measurements. It generalises stabiliser path finding (SPF), originally targeting a prescribed surviving qubit, to $g$-SPF: finding logical $X$ and $Z$ representatives that avoid lost qubits and anticommute qubit-wise on at most $g$ unspecified qubits. For planar surface codes under independent loss with probability $p<1/2$, it proves that some constant $g=g(p)$ permits localisation with probability approaching one as code size grows. For $p>1/2$, success approaches zero. The proof combines percolation bounds giving $\Omega(\sqrt n)$ disjoint surviving representatives of each logical operator with the intersection bound $\min_{X,Z}|\operatorname{supp}(X)\cap\operatorname{supp}(Z)|\leq n/(\Delta_X\Delta_Z)$. The resulting failure bound is exponentially small in lattice width. Two computational methods are introduced: D-LoFi, an exact integer-programming formulation minimising measurement support, and H-LoFi, a heuristic using weighted decoding. Simulations reach rotated surface-code distance 9 (81 qubits) and graph codes with 51 qubits, versus 18 in the previous benchmark. Numerics suggest a threshold near $1/2$ even for $g=1$, with H-LoFi generally faster and approximately reproducing exact success rates. The theorem does not establish $g=1$ or extend to general codes. H-LoFi has no completeness guarantee and performs less reliably in some small-code regimes. Complexity classification, multiple logical qubits, and measurement policies for unheralded loss remain open.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.