On the one-classical-bit quantum teleportation

This study re-evaluates Parakh's one-classical-bit quantum teleportation protocol, in which the proposed protocol replaces the traditional two-classical-bit requirement with a reset procedure, resulting in only one classical bit. However, if the input (to-be-teleported) state is unknown, the reset procedure cannot always work effectively, thereby limiting the protocol's performance. This study modifies the protocol by adding simple CNOT operations, which ensures that the reset procedure always works properly even when the input state is unknown. We also compute the upper bound of the teleportation success probability and the classical bit resource cost inequality using the one-classical-bit protocol. Finally, we simulate the protocol in Qiskit and discuss the results.