Step-by-Step Derivation
-
Error model after every CNOT
• With probability \((1-p)\) the gate is ideal.
• With probability \(p/15\) one of the \(15\) non–identity two-qubit Paulis is applied on the same two qubits.
-
Detectable vs. undetectable error on the [[4,2,2]] code
An error \(E\) escapes detection (commutes with both stabilisers \(XXXX\) and \(ZZZZ\)) iff the parities
\[
x(E)=\bigl(\text{ \# of }X\text{ or }Y\bigr)\bmod 2,\qquad
z(E)=\bigl(\text{ \# of }Z\text{ or }Y\bigr)\bmod 2
\]
are both even.
Among the 15 Paulis on the two qubits of a CNOT,
• \(XX,\;YY,\;ZZ\) give \((x,z)=(0,0)\) ⇒ undetectable,
• the remaining \(12\) give one of the three odd-parity patterns
\((1,0)\), \((0,1)\), \((1,1)\) ⇒ detectable.
Hence, for a single CNOT
\[
\Pr[\text{undetectable}]=3/15=\tfrac15 ,\qquad
\Pr[\text{detected}]=\tfrac{12}{15}=\tfrac45 .
\]
- Physical fidelity of one Bell pair
The ideal Bell state \(|\Phi^{+}\rangle\) is stabilised by \(XX,YY,ZZ\), so an undetectable error does not change the state.
Therefore the per-pair physical fidelity is
\[
F_{\text{pair}}(p)=(1-p)+\frac{p}{15}\times 3
=1-\frac{12}{15}p .
\]
- Two noisy CNOTs – probabilities to second order in \(p\)
For the whole 4-qubit circuit we need the joint error on the two disjoint pairs (03) and (21).
• No error: probability \((1-p)^2\).
• Exactly one faulty CNOT: probability \(2(1-p)p\).
– passes detection only if the single error is undetectable
\(\,\Rightarrow\) success probability \(2(1-p)p\,(3/15)\).
• Errors on both CNOTs: probability \(p^2\).
The two errors, chosen independently, have parities
\((x_1,z_1)\) and \((x_2,z_2)\).
Detection is passed iff \((x_1,z_1)=(x_2,z_2)\).
Using the counts
\((0,0):3,\;(1,0):4,\;(0,1):4,\;(1,1):4\)
we get
\[
\Pr[\text{pass }|\,2\text{ errors}]
=\frac{3^{2}+4^{2}+4^{2}+4^{2}}{15^{2}}
=\frac{57}{225}.
\]
- Probability of passing the check
\[
P_{\text{pass}}(p)=
(1-p)^2
+2(1-p)p\,\frac{3}{15}
+p^{2}\frac{57}{225}
=1-\tfrac85\,p+\tfrac{64}{75}p^{2}+O(p^{3}).
\]
- Probability of being correct after passing
The state is unchanged whenever both pairs experience either
no error or an undetectable \((0,0)\) error.
Thus
\[
P_{\text{correct \& pass}}(p)=
(1-p)^2
+2(1-p)p\,\frac{3}{15}
+p^{2}\Bigl(\frac{3}{15}\Bigr)^{2}
=(1-\tfrac45 p)^{2}
=1-\tfrac85\,p+\tfrac{16}{25}p^{2}+O(p^{3}).
\]
- Logical fidelity conditioned on no detected syndrome
\[
F_{\text{logical}}(p)
=\frac{P_{\text{correct \& pass}}(p)}
{P_{\text{pass}}(p)}
=\frac{(1-\frac45 p)^{2}}
{1-\frac85 p+\frac{64}{75}p^{2}}
=1-\frac{16}{75}p^{2}+O(p^{3}).
\]
The linear term cancels completely: all first-order errors that escape
detection act only as stabilisers, not as logical faults.
Logical errors first appear at second order in the physical error rate.
Final Answer:
The logical two-qubit fidelity, conditioned on post-selecting runs with no detected syndrome, is
\[
\boxed{\,F_{\text{logical}}(p)=1-\dfrac{16}{75}\,p^{2}+O\!\bigl(p^{3}\bigr)\,}.
\]
To leading order, the logical infidelity scales quadratically with the physical two-qubit-gate error rate \(p\), showing that the [[4,2,2]] code suppresses first-order faults under perfect detection.