Quantum teleportation scheme by selecting one of multiple output ports

Abstract

The scheme of quantum teleportation, where Bob has multiple (N) output ports and obtains the teleported state by simply selecting one of the N ports, is thoroughly studied. We consider both deterministic version and probabilistic version of the teleportation scheme aiming to teleport an unknown state of a qubit. Moreover, we consider two cases for each version: (i) the state employed for the teleportation is fixed to a maximally entangled state, and (ii) the state is also optimized as well as Alice's measurement. We analytically determine the optimal protocols for all the four cases, and show the corresponding optimal fidelity or optimal success probability. All these protocols can achieve the perfect teleportation in the asymptotic limit of $N\to \infty$. The entanglement properties of the teleportation scheme are also discussed.

14 pages, 4 figures

References in corpus (5)

• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum Teleportation with Continuous Variables: a survey
• Nonmaximally entangled states can be better for multiple linear optical teleportation
• Optimality of programmable quantum measurements
• Optimal state in the Knill-Laflamme-Milburn scheme of linear optical teleportation