We apply the single-equation duality criterion to the square-octagonal random-bond Ising model recently obtained from an exact error-edge map for a surface code with nearest-neighbor correlated errors. The calculation is performed for the minimal cell after the error-edge reduction. For the symmetric case \(p_1=p_2=p_3=p\), this gives \(p_c=0.0288427147\), in close agreement with the reported numerical threshold of about \(3\%\).
We apply the single-equation duality criterion to the square-octagonal random-bond Ising model recently obtained from an exact error-edge map for a surface code with nearest-neighbor correlated errors. The calculation is performed for the minimal cell after the error-edge reduction. For the symmetric case (p_1=p_2=p_3=p), this gives (p_c=0.0288427147), in close agreement with the reported numerical threshold of about (3%).
The surface code represents a promising candidate for fault-tolerant quantum computation due to its high error threshold and experimental accessibility with nearest-neighbor interactions. However, current exact surface code threshold analyses are based on the assumption of independent and identically distributed (i.i.d.) errors. Though there are numerical studies for the threshold with correlated error, they are only the lower bound rather than the exact value, which offers potential for higher error thresholds. Here, we establish an error-edge map, which allows for the mapping of quantum error correction to a square-octagonal random bond Ising model. We then present the maximum-likelihood threshold under a realistic noise model that combines independent single-qubit errors with correlated errors between nearest-neighbor data qubits. Our method is applicable for any ratio of nearest-neighbor correlated errors to i.i.d. errors. We present analytical constraints for the error correction threshold of surface codes, and by applying these constraints, we numerically obtain the error threshold higher than the existing values. Our error threshold is both an upper bound and achievable.
We investigate how the lattice geometry influences the error thresholds of two-dimensional toric codes. In the presence of bit- or phase-flip errors, the toric code maps onto the two-dimensional random-bond Ising model (RBIM). We determine the critical behaviour of the RBIM using replica-exchange Monte Carlo simulations. While previous studies have explored thresholds for general lattice geometries under suboptimal decoders such as minimum-weight perfect matching, the rapid development of near-optimal decoders makes resolving the ultimate, maximum-likelihood code capacity relevant. We compute these optimal error thresholds on the Nishimori line for the square, honeycomb, triangular, dice, and kagome lattices. Owing to lattice duality, the phase-flip threshold on a given lattice is equivalent to the bit-flip threshold on its dual. We find that the optimal thresholds of dual-lattice pairs display a characteristic duality-driven splitting around the self-dual square-lattice, mirroring the qualitative behaviour observed for suboptimal decoders. While the average coordination number has the strongest impact on the error threshold, our results demonstrate that the detailed arrangement of vertices and plaquettes also plays a significant role in determining its precise value.
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, px=py=pz/(2η) , with η≥1/2 , and total error rate p=px+py+pz . By appropriately formulating the boundary conditions, in the rotated code geometry, we find exact solutions at a special disordered point, p=1+η−12+η−1≳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 Pf=34−14e−2dZartanh(1/2η) , where dZ=d2 and d for the two codes respectively, is the effective code distance for pure phase-flip noise. As a consequence, for code distances d≪η , 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 dZ<η 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 d≈100 , we find that the thresholds converge to a single value at moderate bias ( η=30,100 ), at an error rate above the hashing bound.
Nishimori Threshold Estimation for Bayesian Inference and Zq Surface Code Decoding
In quantum error correction, the error threshold provides essential quantitative guidance for the ability to bring about fault-tolerance through decoding the effects of incoherent noise, weak measurement or inference. However, the numerical value of an error threshold is typically only accessible through large-scale numerical simulations of the underlying noise model. Here we introduce an analytical estimate of error thresholds falling into the Nishimori universality class via a Fourier--Walsh projection scheme that maps the critical point of the underlying disorder-free statistical-mechanics model to the Born-disordered Nishimori critical point. Using a minimal replica theory approach, this closed-form estimate is obtained from a projection of the exact replicated single-bond weight which we find to reproduce (within a percentage point) the known numerical thresholds of random-bond and random-plaquette Ising models / Z2 stabilizer codes in spatial dimensions d=2−5, and extends to Potts variables with q≤4. The main application of our projection scheme is to Zq surface codes, whose decoding problem maps to the disordered q-state clock model. For q≥5 the clean clock model has \textit{two} Berezinskii--Kosterlitz--Thouless transitions, which the projection maps to two Nishimori temperatures that bound an intermediate information-critical phase. The resulting threshold values not only accurately agree with recent decohered-Zq-toric-code numerics, but are found to satisfy the Gilbert--Varshamov self-dual entropy relation lnq≃Hq(T1∗)+Hq(T2∗), although no duality condition is imposed in the construction. Our approach thereby points to a deeper connection between the clean and Born-disordered models, while allowing for instant analytical estimates of error thresholds for a variety of stabilizer codes.
Surface codes are promising for practical quantum error correction due to their high threshold and experimental feasibility. However, their performance under realistic noise conditions, particularly those involving correlated errors, requires further investigation. In this study, we systematically investigate the effect of several distinct types of correlated errors that could potentially arise from next-nearest-neighbor coupling in quantum systems. Our analytical results reveal that these correlated errors exhibit lower logical error rates due to their inherent structural symmetries. We further perform circuit-level simulations that incorporate realistic circuit level errors alongside correlated noise components, demonstrating that surface code performance is intimately related to the structural characteristics of the correlation patterns. This deepens our insights into the threshold of surface code and hence facilitates a more robust design of quantum circuits with a higher noise threshold.
FINDING: Surface code error thresholds are governed by the topological order of a 2D lattice, with the XZZX variant achieving optimal thresholds under biased noise via a mapping to a classical disordered magnet (random-bond Ising model). | MATH: Surface code threshold ≈ 10.3% (depolarizing) for standard toric code; XZZX code threshold → 50% under pure Z-biased noise (theoretical limit). The decoding problem maps exactly to the random-bond Ising model (RBIM) on a square lattice with Nishimori condition: βJ=21ln(1−pp), where p is the error rate. The threshold is the Nishimori critical point: pc≈0.1093(2) for the standard case, and pc→0.5 for pure Z-bias. The stabilizer group is Z2×Z2 per plaquette/vertex, with anyonic excitations (e, m, ε) obeying fusion rules e×m=ε. | CONNECTION: The surface code lives on a square lattice — a **crystallographic group p4m** Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com