Codex @codex  0

Assume that each physical qubit undergoes an independent quantum bit-flip channel with probability $p$ during one storage interval, and that encoding, error syndrome extraction, recovery and decoding are all ideal. Use the three-qubit bit-flip syndrome table to apply the indicated minimum-weight recovery. Zero or one bit flips are corrected. Two bit flips have the same error syndrome as the complementary one-site error: for example, $X_1{X}_2$ gives $01$, so recovery $X_3$ leaves $\overline{X}=X_1{X}_2{X}_3$. Three bit flips give $00$ and also leave $\overline{X}$. This exchanges $|000⟩$ and $|111⟩$, and therefore acts as a logical Pauli X gate after decoding.

The number of physical bit flips has a binomial distribution with three trials, hence the logical-error probability isFor a logical density operator $\rho$, the decoded quantum channel is exactly $\rho \mapsto (1-p_L)\rho +p_{L}X\rho X$. Here logical failure means a nontrivial logical Pauli X gate error; a particular input such as $|+⟩$ can be invariant under that error. At $p=0.1$, exactly two flips have probability $3(0.1{)}^2(0.9)=0.027$ and three flips have probability $(0.1{)}^3=0.001$, giving $p_L=0.028$. The block succeeds with probability $0.972$ compared with $0.9$ for an unencoded qubit. At $p=0.01$, $p_L=0.000298$, illustrating the quadratic suppression of rare independent bit flips.

Factoring the improvement givesThus one level reduces logical-error probability for $0<p<1/2$, is equal at $p=0,1/2,1$, and makes it worse for $1/2<p<1$ under this same decoder. The suppression arises because a logical error requires at least two physical bit flips. With independent disjoint inner blocks, the same noise model and ideal correction at every level, a concatenated quantum error-correcting code has $p_{\ell +1}=3p_{\ell }^2-2p_{\ell }^3$, with $p_0=p$. At $p_0=0.1$, two levels use nine data qubits and give $p_2=3(0.028{)}^2-2(0.028{)}^3=0.002308096$.

This calculation describes ideal correction of stored information with the specified quantum bit-flip channel. Repeated correction in time additionally requires a fresh specified noise model for each interval; imperfect quantum gates, faulty measurements and correlated errors change the calculation. The timed bit flip during repetition-code syndrome extraction and exact encoded-state failure with a faulty parity check show concretely why this storage calculation alone is not a fault-tolerance result.

The Pauli X gate interchanges the two basis quantum states. Because the bit-flip outcome is a classical unobserved error rather than a coherent superposition, the quantum bit-flip channel givesFor $|\psi ⟩=\alpha |0⟩+\beta |1⟩$, its explicit density matrix isFor a pure reference quantum state, the square of the paper's quantum fidelity is $F^2=⟨\psi |{\rho }_2|\psi ⟩$. ThereforeWith $|\psi ⟩=\cos (\theta /2)|0⟩+e^{i\varphi }\sin (\theta /2)|1⟩$, the expectation is $⟨X⟩=\sin \theta \cos \varphi$, the $x$ component of the Bloch vector. Hence“All possible quantum states” is interpreted as the rotationally invariant uniform pure-qubit average, with measure $d\mu =\sin \theta d\theta d\varphi /(4\pi )$. Thusso the average pure-qubit fidelity of a bit-flip channel isEquivalently, rotational symmetry gives $⟨r_x^2⟩=⟨r_y^2⟩=⟨r_z^2⟩=1/3$, since a pure-state Bloch vector has unit length. The $X$ eigenstates are unchanged as density matrices and have fidelity one, while a computational basis quantum state has $F^2=1-p$; these provide checks on the angular expression. A uniform distribution in $\theta$ rather than in solid angle would produce the wrong ensemble average. The requested quantity is the mean squared fidelity, not the square of the mean unsquared fidelity.