= Solution
Define $E|0\rangle=|D_k^N\rangle$ and $E|1\rangle=|D_{k+1}^N\rangle$. From the branch calculation in part (b), outcome $R_0=0,R_1=1$ leaves
$$
\alpha|D_{k+1}^N\rangle+\beta|D_k^N\rangle=E(\beta|0\rangle+\alpha|1\rangle)=EX|\psi\rangle.
$$
Thus \b[the effective input teleported was $X|\psi\rangle=\beta|0\rangle+\alpha|1\rangle$]. A <Pauli X gate> flips every bit and hence maps a <Dicke state> with $j$ excitations to one with $N-j$ excitations. Since $N-k=k+1$, applying $X$ at every receiving party interchanges the two logical <basis> states and restores $E|\psi\rangle$. Therefore
$$
\boxed{\text{Bob and each other recipient should apply }X.}
$$
In particular Bob's uncorrected <reduced density matrix> is $X\rho X$, and his correction returns it to the <matrix> in part (c). The remaining branches can likewise be corrected: $Z^{\otimes N}$ implements logical $Z$ up to the common <global phase> $(-1)^k$, while $X^{\otimes N}$ implements logical $X$. Thus the outcome dependence can be removed by local <Pauli gates> even though the resulting copies remain imperfect.
Back to article page
