A pure qubit state is a point on the Bloch sphere, r = (x, y, z). An X (bit-flip) error maps (x, y, z) -> (x, -y, -z), a 180-degree rotation about the x axis. If each qubit is flipped independently with probability p per step, the ensemble-averaged state obeys the bit-flip channel rho -> (1-p) rho + p X rho X, so the y and z components shrink by (1 - 2p) per step: r_yz(n) = (1-2p)^n r_yz(0), while x is unchanged.
The mixedness of the average state is its von Neumann entropy S = -sum lambda log2 lambda with lambda = (1 +- |r|)/2, and the fidelity with the initial state is F = (1 + r . r0)/2. A bit that flips with probability p is a binary symmetric channel with capacity C = 1 - h(p) bits per use, where h is the binary entropy.
The 3-qubit repetition code stores one logical qubit in three physical ones and, each round, corrects by majority vote. The logical state is wrongly flipped only if at least two of the three physical qubits flipped: p_L = 3p^2 - 2p^3, which is smaller than p whenever p < 1/2. The code protects only against X errors (the lab has no phase errors); a full quantum code also needs phase-flip protection (Shor 1995).
Checks: a 200,000-trajectory Monte Carlo is compared with (1-2p)^n and with 3p^2 - 2p^3 (within 4 standard errors), and the capacity formula is compared with a brute-force maximisation of the mutual information over the input distribution.
With only 300 qubits the measured shrink fluctuates by about 1/sqrt(300), roughly 0.06, around the prediction. Simplifications: errors are discrete, independent and only of X type; perfect syndrome measurement and correction; no gate noise or decoherence time scales. Each dot is the Bloch vector of one qubit in an ensemble of identically prepared pure states.