Exact results on finite size corrections for surface codes tailored to biased noise

Quantum 8, 1468 (2024).

https://doi.org/10.22331/q-2024-09-11-1468

The code-capacity threshold of a scalable quantum error correcting stabilizer code can be expressed as a thermodynamic phase transition of a corresponding random-bond Ising model. Here we study the XY and XZZX surface codes under phase-biased noise, $p_x=p_y=p_z/(2eta)$, with $etageq 1/2$, and total error rate $p=p_x+p_y+p_z$. By appropriately formulating the boundary conditions, in the rotated code geometry, we find exact solutions at a special disordered point, $p=frac{1+eta^{-1}}{2+eta^{-1}}gtrsim 0.5$, for arbitrary odd code distance $d$, where the codes reduce to one-dimensional Ising models. The total logical failure rate is given by $P_{f}=frac{3}{4}-frac{1}{4}e^{-2d_Z,text{artanh}(1/2eta)}$, where $d_{Z}=d^2$ and $d$ for the two codes respectively, is the effective code distance for pure phase-flip noise. As a consequence, for code distances $dll eta$, and error rates near the threshold, the XZZX code is effectively equivalent to the phase-flip correcting repetition code over $d$ qubits. The large finite size corrections for $d_Z lt eta$ also make threshold extractions, from numerical calculations at moderate code distances, unreliable. We show that calculating thresholds based not only on the total logical failure rate, but also independently on the phase- and bit-flip logical failure rates, gives a more confident estimate. Using this method for the XZZX code with a tensor-network based decoder and code distances up to $dapprox 100$, we find that the thresholds converge to a single value at moderate bias ($eta=30, 100$), at an error rate above the hashing bound.