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.
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 toric code is a canonical example of a topological error-correcting code. Two logical qubits stored within the toric code are robust against local decoherence, ensuring that these qubits can be faithfully retrieved as long as the error rate remains below a certain threshold. Recent studies have explored such a threshold behavior as an intrinsic information-theoretic transition, independent of the decoding protocol. These studies have shown that information-theoretic metrics, calculated using the Renyi (replica) approximation, demonstrate sharp transitions at a specific error rate. However, an exact analytic expression that avoids using the replica trick has not been shown, and the connection between the transition in information-theoretic capacity and the random bond Ising model (RBIM) has only been indirectly established. In this Letter, we present the first analytic expression for the coherent information of a decohered toric code, thereby establishing a rigorous connection between the fundamental error threshold and the criticality of the RBIM.
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.
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
Topological stabilizer codes, such as the toric and surface codes, are leading candidates for fault-tolerant quantum computation. While their decodability under stochastic noise has been extensively studied, the effects of coherent errors, which involve quantum interference, remain less explored. In this work, we study the decodability of toric codes on honeycomb and square lattices subject to X- and Z-type coherent errors generated by the X- and Z-rotations on each qubit. We establish a duality between these decoding problems and 1+1D monitored dynamics of non-interacting Majorana fermions. This duality shows that the Altland-Zirnbauer symmetry class of the dual Majorana dynamics governs the universal structure of the decodability phase diagram. We show that the honeycomb-lattice toric code (hTC) with X-type error is dual to class-DIII dynamics, while the hTC with Z-type error and the square-lattice toric code (sTC) with both error types are dual to class-D dynamics. The key distinction arises from time-reversal symmetry. In class DIII, the generic transition out of the decodable phase is dual to a measurement-induced transition between dynamical phases with area-law and logarithmic entanglement scaling. In contrast, in class D, the generic decodability transition corresponds to a transition between two topologically distinct area-law phases. To explore these transitions in microscopic models, we consider hTC and sTC with X-type errors as representatives and introduce a minimal two-parameter coherent error model with spatially varying rotation angles. Using analytical and numerical methods, we map out the decodability phase diagrams and characterize the universal behavior of the transitions. We find that the decodability of sTC is more vulnerable to spatially varying coherent errors than uniform ones.
Error correction thresholds are often treated as the primary figure of merit for comparing quantum error-correcting code families. We show that the optimal error correction threshold for many commonly considered codes is constrained to a single universal value at leading order in a replica limit. Through a statistical mechanical mapping, we demonstrate that duality constrains all zero-rate em-symmetric CSS codes to have the same optimal code capacity threshold. Here, em symmetry means that the X- and Z-type parity-check matrices are equivalent up to row and column permutations. Under this statistical mechanical mapping, em-symmetric CSS codes are self-dual under a generalized Kramers-Wannier duality up to a mixing of logical sectors. For zero-rate code families, this mixing contributes only subextensive corrections, so the thermodynamic bulk free energy is self-dual in the trivial logical sector. This self-duality fixes the clean critical point and constrains the disordered phase boundary. We also show that self-duality is preserved under code concatenation, and that optimal decoding of concatenated codes can be reformulated as a renormalization group flow on a hierarchical lattice. Our results provide a common framework for analyzing topological, concatenated, and more general quantum low-density parity-check code families, including both their optimal code capacity thresholds and their sub-threshold logical error suppression.
Abstract Three-dimensional (3D) topological codes offer the advantage of supporting fault-tolerant implementations of non-Clifford gates, yet their performance against realistic noise remains largely unexplored. In this work, we focus on the paradigmatic 3D toric code and investigate its fault-tolerance thresholds in the presence of both Pauli and measurement errors. Two randomly coupled lattice gauge models that describe the code’s correctability are derived, including a random 2-form Z 2 gauge theory. By exploiting a generalized duality technique, we show that the 3D toric code exhibits optimal thresholds of p th X , M ≈ 11 % and p th Z , M ≈ 2 % against bit-flip and phase-flip errors, respectively. These threshold values show modest reductions compared to the case of perfect measurements, establishing the robustness of the 3D toric code against measurement errors. Our results constitute a substantial advance towards assessing the practical performance of 3D topological codes. This contribution is timely and in high demand, as rapid hardware advancements are bringing complex codes into experimental reach. Moreover, our work highlights the interdisciplinary nature of fault-tolerant quantum computation and holds significant interest for quantum information science, high-energy physics, and condensed matter physics.