Designing optimum CP maps for quantum teleportation
arXiv:quant-ph/0105119 · doi:10.1103/PhysRevA.64.060301
Abstract
We study general teleportation scheme with an arbitrary state of the pair of particles (2 and 3) shared by Alice and Bob, and arbitrary measurements on the input particle 1 and one of the members (2) of the pair on Alice's side. We find an efficient iterative algorithm for identifying optimum local operations on Bob's side. In particular we find that simple unitary transformations on his side are not always optimal even if particles 2 and 3 are perfectly entangled. We describe the most interesting protocols in the language of extremal completely-positive maps.
5 pages, 1 figure
References in corpus (2)
Cited by in corpus (8)
- Optimal discrimination of mixed quantum states involving inconclusive results
- Finding optimal strategies for minimum-error quantum-state discrimination
- Improving fidelity of continuous-variable teleportation via local operations
- Anti- (Conjugate) Linearity
- On quantum channels
- Quantum channel of continuous variable teleportation and nonclassicality of quantum states
- Perfect many-to-one teleportation with stabilizer states
- Quantum channels with correlated noise and entanglement teleportation