Classical communication lower bound for exact qubit teleportation ($c\ge 2\text{classical bits}$)

Exact quantum teleportation that preserves an arbitrary reference requires at least two classical bits from sender to receiver, even with preshared quantum entanglement. For the essential reduction, encode two classical bits in the four Bell states by Pauli gates on the sender's half of a Bell pair. Teleportation as an identity channel on a reference transfers this half while preserving the encoding. The receiver then has both halves and recovers both bits by a Bell-basis measurement, as in superdense coding.

The classical bit bound itself has a short no-communication theorem proof. For $N$ possible messages and $K$ possible classical transmissions, let ${\sigma }_{m,c}$ be the receiver's subnormalized conditional density matrix before decoding. The no-communication theorem gives ${\sum }_c{\sigma }_{m,c}=\tau$, independent of $m$, so $0\le {\sigma }_{m,c}\le \tau$. For each transmission $c$, let $\{E_{m|c}{\}}_m$ be the decoding POVM. Averaging over equiprobable messages,Perfect decoding of four messages requires $K\ge 4$, hence at least two classical bits. This applies to the preshared resources of the proposed quantum teleportation protocol as well as the Bell pair used for the encoding.