arXiv:2610.22357
Stability of Quantum LDPC States under Local Pauli Noise
Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay, Jong Yeon Lee
Abstract
Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Recent progress on mixed-state phases of matter has identified the spatial decay of conditional mutual information (CMI) $I(A:C|B)$ as a key diagnostic of such stability, analogous to the role of the spectral gap for quantum ground states. We prove that, for the normalized code-projector state of a $\mathbb{Z}_d$ qLDPC stabilizer code under local Pauli noise, the CMI across a buffer $B$ separating $A$ from $C$ decays exponentially with the width of $B$ in two complementary noise regimes independent of system size. At weak noise, this holds for full-system tripartitions, where correlations between the two sides require an error cluster to cross the buffer, an exponentially unlikely event. At strong noise, exponential decay holds whenever the buffer supports no logical operator, since correlations can persist only along rare chains of buffer qudits that remain informative. Under an additional space-uniformity assumption, we establish the robustness of Levin--Wen topological entropy. On finite-dimensional lattices of size $n$, the weak-noise bound further implies a constant-layer quasi-local Petz recovery channel of range $O(\poly(\log n)/\varepsilon)$ that recovers the noiseless state within trace-distance error $\varepsilon$. Both CMI bounds apply to general qLDPC interaction graphs, including geometries where such constant-depth quasi-local recovery need not exist. Thus, the exponential decay of the noise-induced CMI provides a general criterion for mixed-state phase stability.
AI Summary
The paper asks whether the information-theoretic structure of the normalized qLDPC stabilizer-code projector remains stable under local Pauli noise, using spatial decay of conditional mutual information (CMI) as the diagnostic. For $\mathbb Z_d$ qLDPC codes on bounded-degree interaction graphs, sufficiently weak independent onsite Pauli noise gives $I(A:C|B)\leq K(|\partial B_A|+|\partial B_C|)^2e^{-c\,\mathrm{dist}(A,C)_B}$ for full-system separating tripartitions. The constants are system-size independent and depend on check weight, qudit degree, dimension and noise strength. The proof expresses entropy changes as classical syndrome entropies, then couples conditional error distributions: dependence between interfaces requires a crossing disagreement cluster, whose probability is exponentially suppressed. An extension covers geometrically bounded-range Pauli noise. A complementary strong-noise bound uses an exact classical normalizer-label representation and information percolation, with opening probabilities given by onsite strong-data-processing coefficients. It requires zero reference CMI and a bounded-locality normalizer subgroup capturing all degrees of freedom visible in the buffer. For toric-code $X$ dephasing, the sufficient regimes are $p<0.029$ and $p>0.146$; the latter requires a buffer without noncontractible loops. Neither bound reaches the decoding transition near $p=0.109$. On finite-dimensional lattices, weak-noise decay implies recovery of the mixed projector state by constantly many layers of Petz block channels of range $O(\log(n/\varepsilon))$. Such recovery need not remain quasi-local on general interaction graphs. A counterexample shows that LDPC assumptions alone do not ensure subsystem-CMI stability; an additional space-uniformity assumption yields subsystem bounds and Levin–Wen entropy robustness. Non-Pauli noise and non-Abelian models remain extensions.
Error found: The abstract's strong-noise statement omits the additional assumption I(A:C|B)_{rho_0}=0 required by Theorem 2, which is not guaranteed merely by the buffer supporting no logical operator for subsystem tripartitions.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 29 pages, 5 figures, including appendices