Threefold entanglement matching

We address the problem of entanglement matching in the probabilistic teleportation scheme by considering two independent levels of entanglement in the measurement basis. The probability of a successful teleportation has an upper bound which only depends on the amount of entanglement of the quantum channel. However, we found that each entanglement of the measurement basis contributes independently to the success probability as long as it is weaker than the entanglement of the channel. Accordingly, the teleportation process reaches its optimal probability when both entanglements of the measurement basis match the entanglement of the channel. Additionally, we study the probabilistic scheme for extracting an unknown state from a partially known state. We characterize the success probability and the concurrence involved in that process.