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.
Bidirectional teleportation using scrambling dynamics: a practical protocol
JILA, University of Colorado and National Institute of Standards and Technology（科罗拉多大学与美国国家标准技术研究院 JILA）；Department of Physics, University of Colorado, Boulder（科罗拉多大学博尔德分校物理系）；Center for Theory of Quantum Matter（量子物质理论中心）；Department of Electrical and Computer Engineering, Saint Louis University（圣路易斯大学电气与计算机工程系）
PUBO Formulation for MST and Application to Optimum-Path Forest
Instituto de Física de São Carlos, Universidade de São Paulo（圣卡洛斯物理研究所，圣保罗大学）；Instituto de Física Gleb Wataghin, Universidade Estadual de Campinas（格莱布·瓦塔金物理研究所，坎皮纳斯州立大学）；São Paulo State University, School of Sciences（圣保罗州立大学，理学院）
