- Step-by-Step Derivation
- Circuit, noise model, and acceptance
- Data qubits are 0–3; ancilla is 4. The (right-to-left) circuit is
\[
H_1 \;\to\; CNOT_{12} \;\to\; CNOT_{10} \;\to\; CNOT_{23} \;\to\; CNOT_{34}\;\to\; CNOT_{04}\;\to\; M_4,
\]
with a two-qubit depolarizing error after each CNOT: with probability $1-p$ no error, and with probability $p$ a uniformly random non-identity two-qubit Pauli (15 choices, each $p/15$).
-
Post-selection/acceptance: keep runs with ancilla outcome 0 and with no code-detectable error on the data (i.e., the final data Pauli error commutes with both stabilizers \(XXXX\) and \(ZZZZ\)).
-
Target encoded state and its stabilizer
- The target is the encoded logical two-qubit state \(\lvert 00\rangle_{AB}\) in the [[4,2,2]] code, whose stabilizer we may take as
\[
\mathcal{S}_{\text{tgt}}=\langle XXXX,\; ZZZZ,\; Z_A:=ZZII,\; Z_B:=ZIZI\rangle.
\]
- Equivalently, the four commuting checks we will use are
\[
S_X:=XXXX, \quad S_Z:=ZZZZ,\quad Z_A=Z_0Z_1,\quad Z_B=Z_0Z_2.
\]
-
The ancilla sequence \(CNOT_{34},CNOT_{04}\) followed by \(M_4\) in the \(Z\) basis measures \(Z_0Z_3\); for the ideal target state, the outcome is +1 (we keep outcome “0”).
-
Where leading-order logical errors can come from
- Any single two-qubit fault that is accepted (i.e., passes the two code checks and the ancilla parity) must act as an element of the target stabilizer \(\mathcal{S}_{\text{tgt}}\), hence does not reduce fidelity (no \(O(p)\) infidelity). Therefore the first nontrivial contribution to logical infidelity is \(O(p^2)\), from two-fault combinations among the three “data-building” CNOTs: \(CNOT_{12}\), \(CNOT_{10}\), \(CNOT_{23}\).
-
Faults on the ancilla CNOTs do not affect the data (they cannot propagate back to controls), and while they can flip the ancilla outcome, they cannot by themselves induce data logical errors; mixed pairs (one data, one ancilla fault) cannot produce an undetected logical error after code post-selection.
-
Signature method: how an error transforms the four checks
- For any final data Pauli error \(E\), define its commutation signatures with the four checks as
\[
s_X(E)=\pm1\ \text{for } [E,S_X]=0 \text{ or } \{E,S_X\}=0,
\]
\[
s_Z(E)=\pm1\ \text{for } [E,S_Z]=0 \text{ or } \{E,S_Z\}=0,
\]
\[
\]
- Acceptance constraints:
- code post-selection requires s_X(E)=+1 and s_Z(E)=+1,
- ancilla parity +1 (outcome 0) requires \(s_{Z_0Z_3}(E)=+1\). Noting \(Z_0Z_3 = S_Z \cdot Z_A \cdot Z_B\), we have
\[
s_{Z_0Z_3}(E)=s_Z(E)\,s_A(E)\,s_B(E).
\]
With $s_Z(E)=+1$ from code post-selection, this reduces to $s_A(E)\,s_B(E)=+1$.
\[
v=(s_X, s_Z, s_A, s_B)\in\{\pm1\}^4.
\]
- Location L1: after \(CNOT_{12}\) (on qubits 1,2), only later CNOTs are \(CNOT_{10}\) and \(CNOT_{23}\). A two-qubit Pauli \(P_1\otimes P_2\) on (1,2) with bits
\[
x_k=\mathbf{1}[P_k\in\{X,Y\}],\quad z_k=\mathbf{1}[P_k\in\{Z,Y\}],\quad k=1,2,
\]
yields the final signatures
\[
s_X=(-1)^{z_1+z_2},\quad s_Z=+1,\quad s_A=+1,\quad s_B=(-1)^{x_1+x_2}.
\]
Thus $v$ depends only on the parities $(z_1+z_2)\bmod2$ and $(x_1+x_2)\bmod2$. Counting over the 15 non-identity $P_1\otimes P_2$ gives:
- $(+,+,+,+)$: 3
- $(-,+,+,+)$: 4
- $(+,+,+,-)$: 4
- $(-,+,+,-)$: 4
- Location L2: after \(CNOT_{10}\) (on qubits 1,0), with no later data CNOT touching these qubits:
\[
s_X=(-1)^{z_1+z_0},\quad s_Z=(-1)^{x_1+x_0},\quad s_A=(-1)^{x_1+x_0},\quad s_B=(-1)^{x_0}.
\]
Counting over 15 non-identity pairs yields:
- $(+,-,-,+)$: 2, $(-,-,-,+)$: 2, $(-,+,+,+)$: 2, $(+,+,+,+)$: 1,
- $(+,-,-,-)$: 2, $(+,+,+,-)$: 2, $(-,+,+,-)$: 2, $(-,-,-,-)$: 2.
- Location L3: after \(CNOT_{23}\) (on qubits 2,3), with no later data CNOT at all:
\[
s_X=(-1)^{z_2+z_3},\quad s_Z=(-1)^{x_2+x_3},\quad s_A=+1,\quad s_B=(-1)^{x_2}.
\]
Counting over 15 non-identity pairs yields:
- $(+,-,+,+)$: 1, $(-,-,+,+)$: 2, $(-,+,+,+)$: 2, $(+,+,+,+)$: 2,
- $(+,-,+,-)$: 2, $(+,+,+,-)$: 2, $(-,+,+,-)$: 2, $(-,-,+,-)$: 2.
- No first-order logical error
-
For a single fault to be accepted it must satisfy \(s_X=+1\), \(s_Z=+1\), and \(s_A s_B=+1\). From the above distributions, all such single faults, if any, lie in the target stabilizer (e.g., \(Z_0Z_1\), \(Z_2Z_3\), or \(XXXX\)), hence they contribute no \(O(p)\) loss of fidelity.
-
Counting the \(O(p^2)\) accepted logical errors
- For two independent faults at locations \(g\) and \(h\), the total signature is the componentwise product of the two signature vectors: \(v_{gh}=v_g\cdot v_h\).
- An accepted logical error (to second order) requires:
\[
s_X^{(g)}s_X^{(h)}=+1,\quad s_Z^{(g)}s_Z^{(h)}=+1,\quad s_A^{(g)}s_A^{(h)}=-1,\quad s_B^{(g)}s_B^{(h)}=-1.
\]
That is, the $s_X$ and $s_Z$ signs must match between the two faults, while $s_A$ and $s_B$ must be opposite.
- Using the per-location distributions above, we count for each unordered pair of data CNOTs:
- Pair (L1,L2): impossible, because L1 has \(s_A=+1\) always, while acceptance requires \(s_Z^{(1)}s_Z^{(2)}=+1\), which with L1’s \(s_Z=+1\) would force \(s_Z^{(2)}=+1\), but then \(s_A^{(2)}=s_Z^{(2)}=+1\) for L2 (since \(s_A=s_Z\) at L2), contradicting \(s_A^{(1)}s_A^{(2)}=-1\). So 0 combinations.
- Pair (L1,L3): impossible, because both L1 and L3 have \(s_A=+1\), hence \(s_A^{(1)}s_A^{(2)}=+1\) cannot equal −1. So 0 combinations.
- Pair (L2,L3): feasible. Imposing the four constraints and summing over the tabulated categories gives
\[
N_{\text{bad}}(L2,L3)=14.
\]
(Details: from L2 we must choose categories with $s_A^{(2)}=-1$ (equivalently $s_Z^{(2)}=-1$), and from L3 we must choose categories with $s_Z^{(3)}=-1$; then require equal $s_X$, and opposite $s_B$ signs. The count by matching the listed categories is 14.)
- Therefore, among the \(15\times15=225\) ordered pairs of non-identity Pauli faults at a given unordered gate pair, only the (L2,L3) pair yields accepted logical errors, with 14 such combinations. There is only one such unordered pair among the three data CNOTs, so the total second-order probability of an accepted logical error is
\[
P_{\text{bad}} = \frac{14}{225}\,p^2 + O(p^3).
\]
- Logical fidelity to second order
- The overall acceptance probability is \(1-O(p)\), so normalizing by acceptance affects the \(p^2\) coefficient only at \(O(p^3)\). Hence the logical state fidelity conditioned on acceptance is
\[
F_{\text{logical}}(p) = 1 - \frac{14}{225}\,p^2 + O(p^3).
\]
- Mathematical Typesetting
All relevant formulas are expressed using LaTeX above.
- Conventions and Units
- Only two-qubit CNOTs are noisy with a two-qubit depolarizing channel at rate \(p\); \(H\) and \(M\) are ideal.
- Qubit labels and logical operators follow the problem statement.
- Final Answer:
F_logical(p) = 1 - (14/225) p^2 + O(p^3).