Noise redistribution by stabilizer codes: an organizing view of concatenated three-qubit codes

The gist The syndrome projection of any stabilizer code maps the physical noise channel to a block-diagonal logical channel whose diagonal Pauli weights are determined by the code geometry.

Noise Redistribution by Syndrome Projection

One level of QEC on n physical qubits is described by Eeff(ρL) = Xs UsΠsN ⊗n (ρL ⊗ 0⟩⟨0anc) ΠsU †s, where Us is the recovery unitary associated with syndrome s, and the trace over the ancilla is implicit<ref:2610.31007#pg2> Lemma II.1 (Syndrome-projection noise redistribution). Let C be a stabilizer code and let N be a singlequbit noise channel. After one round of QEC consisting of syndrome projection and recovery, the effective logical channel has the following properties: (i) It is block diagonal with respect to the syndrome partition: coherences between different syndrome classes are zero; (ii) the diagonal Pauli weights of the effective channel depend only on the code geometry and on the probabilities of the physical error classes; (iii) for each logical Pauli P¯, Pr(P¯) = X E∈CP¯ Pr(E), where CP¯ is the error class assigned to P¯; (iv) no physical Pauli twirl is required to obtain the block-diagonal form<ref:2610.31007#pg3> Proof. The projection onto syndrome subspaces factors the effective channel according to the measurement outcome. Coherence between two different syndrome sectors is not part of any post-selected branch and therefore does not contribute to the unconditional logical channel<ref:2610.31007#pg3>.

Deterministic Concatenation Rules

Concatenation can then be viewed as the iteration of the same redistribution step: the dominant logical error after one level selects the code used at the next<ref:2610.31007#pg5> Rule III.3 (Logical level). At concatenation level l, let dl ∈ O, be the dominant error direction of the effective channel. The next code is selected as follows: dl = Z: apply C2 and correct σz; dl = X: apply C1 and correct σx; dl = Y: apply C1 if pz l ≥ px l, else C2, and correct σy in either case<ref:2610.31007#pg6> The protocol is therefore a deterministic feedback process: the dominant logical error at level l becomes the error corrected at level l + 1<ref:2610.31007#pg6>.

Application to Amplitude Damping

The amplitude-damping channel is a physically important noise model and provides a nontrivial test of the concatenation rules of Sec. III The Pauli-diagonal part of the amplitude-damping channel satisfies px = py > pz for all γ > 0, (1) where γ is the damping parameter Rule III.2 therefore forces the first level to correct Y; since pz < px, the appropriate code is C2(ˆσy). After one level, Lemma II.1 and Corollary II.2 imply that the effective channel polarizes toward X. The concatenation protocol is therefore C2(ˆσy) C1(ˆσx), (2).

Threshold and Comparison

Solving fl > fl−1 at r = 1 numerically for γ gives γc ≈ 0.30. Expressed in terms of the initial channel fidelity, this corresponds to fc ≈ 0.845, or f = 1 − 1.72755γ squared. The five-qubit code in Ref. [6] protects arbitrary single-qubit errors with one level of encoding, while the concatenated three-qubit protocol requires two levels to achieve comparable protection. The overall gate accuracy rate therefore decays much more slowly for the concatenated three-qubit protocol.

Boundaries of the Mechanism

The mechanism of noise redistribution is universal: it follows from the syndrome projection and applies to arbitrary single-qubit noise, and to correlated noise at the level of class assignment. The limits of the present quantitative analysis are equally clear: the closed-form recursions and numerical thresholds are derived under the independent-Pauli assumption. The conceptual message, however, remains robust: stabilizer codes reshape noise through code structure, without requiring an explicit physical twirl.

How it works

The paper presents an organizing framework for concatenated quantum error correction based on the observation that the syndrome projection of a stabilizer code reshapes the noise channel in a codedetermined manner For any stabilizer code, one level of QEC maps the physical noise to a blockdiagonal logical channel whose diagonal Pauli weights are fixed by the code geometry. Concatenation can then be viewed as the iteration of the same redistribution step: the dominant logical error after one level selects the code used at the next The contribution here is to elevate it to a general lemma: syndrome projection blockdiagonalizes the effective channel in a code-determined way, without a physical Pauli twirl.

Key Findings

The main results are as follows. 1. A general lemma stating that one level of QEC for any stabilizer code induces a block-diagonal logical channel, with diagonal Pauli weights fixed by the code structure and with no physical Pauli twirl required for block diagonalization. 2. Deterministic concatenation rules for the two three-qubit codes, obtained as direct consequences of the lemma. 3. An application to amplitude damping, giving the concatenation order C2(ˆσy)C1(ˆσx) and the closed-form ideal-recovery threshold f = 1 − 1.72755γ squared. 4. A gate-count comparison with the five-qubit code [6] under the ideal-recovery assumption. 5. A precise statement of the scope of the framework for coherent and correlated noise.

Minimal Realization

The two three-qubit codes are the smallest non-trivial stabilizer codes and therefore provide the simplest explicit realization of the noise-redistribution lemma Their syndrome partitions have only four classes, and the resulting logical channel can be written in closed form for arbitrary Pauli noise<ref:2610.31007#pg5>. The recursion for C1 correcting X errors is f1 = f 3 0 + 3f 2 0 px + 3f 0 pz + 6f 0 pypz + 3pxp 2 z<ref:2610.31007#pg5>. The recursion for C2 correcting Z errors is f1 = f 3 0 + 3f 2 0 pz + 3f 0 pz py + 6pzpxpy + 3f 0 pz 2 x<ref:2610.31007#pg5>.

Conclusion

In this work we have formulated the action of a stabilizer code as a noise redistributor. The syndrome projection of any stabilizer code maps the physical noise channel to a block-diagonal logical channel whose diagonal Pauli weights are determined by the code geometry. This redistribution does not require a physical Pauli twirl. The two three-qubit codes provide a minimal explicit example<ref:2610.31007#pg5>. Their four-class syndrome partitions admit closed-form recursions, and the redistribution rules determine the protocol C2(ˆσy)C1(ˆσx) for amplitude damping. In the ideal-recovery setting, it gives a closed-form ideal-recovery fidelity scaling fl = 1 − O(γ 2), with the crossover condition Fl > Fl−1 solved at r → 1 to give f = 1 − 1.72755γ squared. The same protocol admits a favorable gate-count comparison with the five-qubit code.

1. Adaptive Concatenation Protocol for Amplitude Damping: An AI system can dynamically select qubit correction codes based on real-time measurements of physical error probabilities to implement a protocol like C2(sigma y)C1(sigma x). This allows the system to maintain an effective channel fidelity above a critical threshold f = 1 - 1.72755 gamma squared, specifically targeting noise characterized by px = py > pz for any damping parameter gamma.

2. Optimized Gate Budget Allocation: The AI can utilize the comparison between concatenated three-qubit protocols and five-qubit codes to optimize hardware resource utilization. This system would prioritize the concatenated protocol when achieving comparable logical fidelity improvement requires a significantly lower total gate count, as demonstrated by the advantage in gate budget for the three-qubit construction.

3. Noise Model Adaptation for Correlated Errors: By incorporating joint error distributions, the AI can compute logical Pauli probabilities using equation (16) rather than assuming independent noise. This enables the system to correctly determine which code to apply when dealing with correlated or coherent noise, extending the framework's applicability beyond independent-Pauli assumptions.

4. Coherent Error Mitigation Strategy: The AI can systematically identify and remove residual intra-class coherences that survive syndrome projection by applying an optional logical Pauli twirl after recovery. This ensures that the resulting effective channel is purely Pauli based for subsequent code selection decisions, as guaranteed by Lemma II.1(iv).