Consider the standard quantum teleportation scheme. Let the first register hold the state $\newcommand{\ket}[1]{|#1\rangle}\ket\psi$ to be teleported, and the second register be the one shared between the two parties. We can then summarise the protocol as follows:
- Start with the state $\ket{\psi}_1\ket{0,0}_{23}$
- Apply the unitary $U\equiv \operatorname{CNOT}(H\otimes I)$ between second and third register, thus evolving $\ket{00}$ to $\ket{\Psi^+}\simeq \ket{00}+\ket{11}$.
- Apply $U^{-1}$ between first and second registers.
- Measure the first two registers in the computational basis, and observe that for every outcome there is a local operation that can be applied to the third register that gives back $\ket\psi$.
My question is about the choice of this specific unitary $U$: Consider the following generalisation of the teleportation scheme:
Here, we again start with $\ket\psi\otimes\ket{0,0}$, but now apply some unitary $B$ between second and third register and then $B^{-1}$ between first and second. We then measure the first two registers in the computational basis.
What are the possible unitaries $B$ such that this circuit works as a teleportation protocol? More specifically, for what choices of $B$ can we always find a unitary to apply to the third register to get back $\ket\psi$ regardless of the measurement results $a,b$?
Intuitively, $B$ must be some gate creating maximal entanglement between the qubits, but requiring that $B$ sends $|00\rangle$ to a maximally entangled state is also not enough. As a counterexample, we can consider the following $B$: $$B\equiv \begin{pmatrix} 0&0&1&0 \\ 1/\sqrt2 & 1/\sqrt2 & 0 & 0 \\ 1/\sqrt2 & -1/\sqrt2 & 0 & 0 \\ 0 & 0 & 0 & 1 \end{pmatrix}.$$ It is not hard to check that with this choice teleportation is not possible, despite the two parties sharing a maximally entangled state. For example, the outcome $a=b=1$ projects the third qubit to $\ket0$, which contains no information about $\ket\psi$.