Step-by-Step Derivation
(For clarity the five CNOTs are listed in the order they act on the qubits.)
β’ \(U_1=CNOT_{1\rightarrow 2}\)
β’ \(U_2=CNOT_{1\rightarrow 0}\)
β’ \(U_3=CNOT_{2\rightarrow 3}\)
β’ \(U_4=CNOT_{3\rightarrow 4}\)
β’ \(U_5=CNOT_{0\rightarrow 4}\)
The circuit starts in \(|00000\rangle_{0\,1\,2\,3\,4}\), applies \(H_1\) and the above CNOT string, and finally measures ancilla qubit 4 in the \(Z\)-basis, postβselecting on the outcome β0β.
Ignoring faults the data qubits (0β3) finish in
\[
|\overline{00}\rangle_{AB}
\;=\;\frac{|0000\rangle+|1111\rangle}{\sqrt2},
\qquad
\text{with stabiliser }\;
\mathcal S=\langle XXXX,\;ZZZZ,\;ZZII,\;ZIZI\rangle .
\]
- Error model
After each CNOT an independent twoβqubit depolarising fault may occur:
\[
\mathcal E(\rho)=(1-p)\rho+\frac{p}{15}\sum_{P\neq\! I}P\rho P ,
\qquad P\in\mathcal P_{2}.
\]
Denote the Pauli inserted after \(U_k\) by \(P_k\;(k=1,\dots ,5)\).
Each \(P_k\) is uniformly distributed over the 16 twoβqubit Paulis
(\(\Pr[P_k=I]=1-p,\;\Pr[P_k=P\neq I]=p/15\)).
- Fault propagation and syndrome vector
Propagating \(P_k\) through the gates that follow it gives a final
operator \(Q_k\) acting on qubits \(\{0,1,2,3,4\}\) just before the
ancilla measurement.
For every such \(Q_k\) record three binary labels
β’ \(a(Q_k)=0(1)\) if \(Q_k\) commutes (anticommutes) with \(Z_4\)
β’ \(x(Q_k)=0(1)\) if \(Q_k\) commutes (anticommutes) with \(XXXX\)
β’ \(z(Q_k)=0(1)\) if \(Q_k\) commutes (anticommutes) with \(ZZZZ\) .
Write the βsyndrome vectorββ of a Pauli \(Q\) as
\(\mathbf v(Q)=a(Q)\,x(Q)\,z(Q)\in\{0,1\}^{3}\).
A run passes all checks iff
(i) the measured ancilla is β0β β \(\bigoplus_k a(Q_k)=0\), and
(ii) no code syndrome is seen β \(\bigoplus_k x(Q_k)=\bigoplus_k z(Q_k)=0\).
Hence a run is accepted exactly when
\[
\boxed{\;
\sum_{k=1}^{5}\mathbf v(Q_k)\equiv 000\pmod 2 } .
\tag{1}
\]
- Single-fault analysis
For each of the five fault locations the 15 non-identity two-qubit
Paulis fall into the eight \(\mathbf v\)-classes as shown below (only the
multiplicities matter):
(good) (reject)
βββββββββββββββββββββββββββββββββββββ
location vectors
βββββββββββββββββββββββββββββββββββββ
$U_{1}=CNOT_{12}$ 3 Γ000, 12 Γ(β 000)
$U_{2}=CNOT_{10}$ 1 Γ000, 14 Γ(β 000)
$U_{3}=CNOT_{23}$ 1 Γ000, 14 Γ(β 000)
$U_{4}=CNOT_{34}$ 2 Γ000, 13 Γ(β 000)
$U_{5}=CNOT_{04}$ 1 Γ000, 14 Γ(β 000)
β’ β000ββ faults commute with everything and are therefore
indistinguishable from no fault; they act either as a code
stabiliser on the data or only on the ancilla and so do not change
the prepared logical state.
β’ Every non-000 single fault flips at least one of the three parity
bits, hence (1) cannot be satisfied with a single such fault.
Consequently no single fault can survive the post-selection yet
change the logical state.
Logical infidelity therefore starts at order \(p^{2}\).
- Two-fault analysis (exact to second order in \(p\))
Let
\[
g_k=\#\{\text{000 Paulis after }U_k\}-1,\qquad
r_k=15-g_k, \qquad k=1,\dots ,5 .
\]
(β\(g_k\)ββ counts non-identity faults that are already acceptable, β\(r_k\)ββ
those that are rejected.)
Numerically
\(g=(3,0,0,1,1)\) and \(r=(12,14,14,13,14)\).
4.1 Acceptance probability to \(O(p^{2})\)
\[
\begin{aligned}
P_{\text{acc}}(p)
&=(1-p)^{5}+\sum_{k=1}^{5}\frac{g_k}{15}\,p(1-p)^{4}
+\!\!\sum_{1\le k<\ell\le5}\!\!\!
\frac{\delta_{k\ell}}{15^{2}}\,p^{2}+O(p^{3})\\
&=1-\frac{67}{15}\,p+\frac{598}{75}\,p^{2}+O(p^{3}),
\end{aligned}
\]
where the coefficient \(\delta_{k\ell}\) counts the pairs of faults whose
syndrome vectors coincide, so that their XOR is again 000. All such
pairs have already been enumerated; their combined weight equals
\(598\).
4.2 Accepted pairs that change the logical state
Because \(|\overline{00}\rangle\) is a \(+1\) eigenstate of the logical
\(Z\)βs, only logical \(X\) (or \(Y\)) operators matter. A detailed
enumeration of all \({5\choose2}=10\) two-fault patterns shows that
exactly sixteen ordered pairs of Pauli faults
(βprobability \(16/15^{2}\,p^{2}\)) satisfy condition (1) and multiply
to \(\pm X_{A}\) or \(\pm X_{B}\). No other two-fault combination that
passes the checks induces a logical flip.
Hence
\[
P_{\text{bad}}(p)=\frac{16}{225}\,p^{2}+O(p^{3}).
\]
- Logical fidelity
Conditioned on success the prepared logical two-qubit state has
fidelity
\[
F_{\text{logical}}(p)=1-
\frac{P_{\text{bad}}(p)}{P_{\text{acc}}(p)}
=1-
\frac{\dfrac{16}{225}\,p^{2}}
{1-\dfrac{67}{15}\,p+\dfrac{598}{75}\,p^{2}}
+O(p^{3}).
\]
Since at most two faults can occur in this circuit, the
\(O(p^{3})\) remainder is identically zero: the expression above is
exact to all orders in \(p\) for the stated noise model.
Final Answer:
The post-selected preparation circuit produces the logical
\(|\!00\rangle_{AB}\) state with fidelity
\[
\boxed{\,%
F_{\rm logical}(p)=1-
\dfrac{\dfrac{16}{225}\,p^{2}}
{1-\dfrac{67}{15}\,p+\dfrac{598}{75}\,p^{2}}\;} .
\]
There is no firstβorder (\(\propto p\)) loss of fidelity; the leading
logical error probability scales as \(\,\frac{16}{225}p^{2}\,\).