The probabilistic quantum teleportation scheme [Phys.Lett.A 305 (2002) 12] is improved via twoseemingly different methods (i.e., the usual ancilla method and the so-called Kraus method), respectively.The essenceof the...The probabilistic quantum teleportation scheme [Phys.Lett.A 305 (2002) 12] is improved via twoseemingly different methods (i.e., the usual ancilla method and the so-called Kraus method), respectively.The essenceof the improvements is to fetch a part from the residues so that the success probability is accordingly increased.The twoimproved versions and a similar protocol proposed by Li et al.[Phys.Rev.A 61 (2000) 034301] are compared mutuallyand discussed.It is found that they are equally efficient and can reach the success probability threshold determined bythe inherent entanglement of the quantum channel.展开更多
基金Supported by the Program for New Century Excellent Talents at the University of China under Grant No.NCET-06-0554the National Natural Science Foundation of China under Grant Nos.10975001,60677001,10747146,and 10874122+3 种基金the Science-Technology Fund of Anhui Province for Outstanding Youth under Grant No.06042087the General Fund of the Educational Committee of Anhui Province under Grant No.2006KJ260Bthe Natural Science Foundation of Guangdong Province under Grant Nos.06300345 and 7007806 the Talent Foundation of High Education of Anhui Province for Outstanding Youth under Grant No.2009SQRZ018
文摘The probabilistic quantum teleportation scheme [Phys.Lett.A 305 (2002) 12] is improved via twoseemingly different methods (i.e., the usual ancilla method and the so-called Kraus method), respectively.The essenceof the improvements is to fetch a part from the residues so that the success probability is accordingly increased.The twoimproved versions and a similar protocol proposed by Li et al.[Phys.Rev.A 61 (2000) 034301] are compared mutuallyand discussed.It is found that they are equally efficient and can reach the success probability threshold determined bythe inherent entanglement of the quantum channel.
