Recent progress in fault-tolerant quantum computing suggests that leveraging error-syndrome information at the logical layer can substantially improve performance, including the estimation of logical observables from noisy states. In this work, based on quantum estimation theory, we develop an information-theoretic framework to quantify the utility of error syndromes for noisy logical observable estimation. We distinguish two operational regimes of such syndrome-aware protocols: classical protocols, in which the logical measurement basis is fixed and syndrome information is used only in classical post-processing, and quantum protocols, in which the logical quantum control can be tailored to depend on the observed error syndrome. For classical syndrome-aware protocols, we prove a universal limitation: on average, syndrome information can improve the effective logical error rate by at most a factor of two, implying at most a quadratic reduction in sampling overhead. In contrast, once syndrome-conditioned quantum control is permitted, we demonstrate that the effective logical error rate decays exponentially with the number of code blocks. These findings provide fundamental guidance for designing future fault-tolerant architectures that actively exploit syndrome records rather than discarding them after decoding.
This paper investigates the behavior of the Min-Sum decoder running on noisy devices. Our aim is to evaluate the robustness of the decoder to computation noise caused by the faulty logic in the processing units. This type of noise represents a new source of errors that may occur during the decoding process. To this end, we first introduce probabilistic models for the arithmetic and logic units of the finite-precision min-sum decoder and then carry out the density evolution analysis of the noisy min-sum decoder. We show that, in some particular cases, the noise introduced by the device can help the min-sum decoder to escape from fixed points attractors and may actually result in an increased correction capacity with respect to the noiseless decoder. We also point out a specific threshold phenomenon, referred to as functional threshold, which accurately describes the convergence behavior of noisy decoders. The behavior of the noisy MS is demonstrated in the asymptotic limit of the code length through a noisy version of density evolution and is also verified in the finite-length case by Monte Carlo simulations.
We use a quantum formalism for the partition function of the classical
XY model to identify a resilience phase transition in the zero-syndrome postselected sector of a noisy toric-rotor code. To this end, we consider a logical state of toric-rotor code under phase-shift noise described by a von Mises probability distribution. We then show that the fidelity of the noisy state with respect to the initial logical state is proportional to the partition function of the
XY model, such that a Kosterlitz-Thouless phase transition at a critical temperature
Tc corresponds to a resilience phase transition at a critical width
σc. To characterize this transition, we map the spin stiffness of the
XY model to a topological order parameter
0≤λ≤1, which quantifies the intrinsic resilience of the code to decoherence within the zero-syndrome subspace. We show that the initial logical state exhibits partial resilience to noise for widths less than
σc≈0.89, where
λ satisfies
0<λ<1 and drops discontinuously to zero at
σc. We further discuss the implications of our results for postselected quantum error correction in the toric-rotor code in higher dimensions. Our work shows that the quantum formalism for partition functions provides a mathematically rigorous framework for studying noisy continuous-variable quantum codes.