= Solution
Let $P$ be the <orthogonal projection> onto the code, and let $\{E_a\}$ be the specified error operators, including their <linear span>. The necessary and sufficient <Knill--Laflamme condition> is
$$
\boxed{PE_a^\dagger E_bP=C_{ab}P\quad\text{for every }a,b,}
$$
where the scalar <matrix> $C$ is independent of the encoded state. In an <orthonormal basis> $\{|j_L\rangle\}$ of the code this means
$$
\langle i_L|E_a^\dagger E_b|j_L\rangle=C_{ab}\delta_{ij}.
$$
There must be one recovery <quantum channel> which corrects every allowed error channel, rather than a different recovery chosen using the unknown logical input.
The scalar condition means that any information carried away by the errors depends on their labels but not on the encoded amplitudes. To see how recovery works, diagonalize the <positive semidefinite matrix> $C$ and take corresponding linear combinations $F_\ell$ of the errors. Then $PF_\ell^\dagger F_mP=\lambda_\ell\delta_{\ell m}P$. For each positive $\lambda_\ell$, the map $F_\ell P/\sqrt{\lambda_\ell}$ is an <linear isometry> into an error-image subspace, and these subspaces are mutually orthogonal. Measuring their label and reversing the associated <linear isometry> recovers the logical state without measuring its amplitudes. Zero <eigenvalues> correspond to errors that annihilate the code. This also explains why the condition corrects arbitrary coherent combinations of the listed errors.
Back to article page
