The probabilistic quantum teleportation scheme [ Phys. Lett. A 305 (2002) 12 ] is improved via two seemingly different methods (i.e., the usual ancilla method and the so-called Kraus method), respectively. The essence of the improvements is to fetch a part from the residues so that the success probability is accordingly increased. The two improved versions and a similar protocol proposed by Li et al. [ Phys. Rev. A 61 (2000) 034301 ] are compared mutually and discussed. It is found that they are equally efficient and can reach the success probability threshold determined by the inherent entanglement of the quantum channel.The probabilistic quantum teleportation scheme [ Phys. Lett. A 305 (2002) 12 ] is improved via two seemingly different methods (i.e., the usual ancilla method and the so-called Kraus method), respectively. The essence of the improvements is to fetch a part from the residues so that the success probability is accordingly increased. The two improved versions and a similar protocol proposed by Li et al. [ Phys. Rev. A 61 (2000) 034301 ] are compared mutually and discussed. It is found that they are equally efficient and can reach the success probability threshold determined by the inherent entanglement of the quantum channel.

Communications in Theoretical PhysicsDec 1, 20102 citations

Probabilistic quantum teleportation

Pankaj Agrawal, Arun K. Pati

arXiv:quant-ph/0210004Physics Letters ANov 1, 2002185 citations

Probabilistic Teleportation via Entanglement

Dechao Li, Shi Zhong-ke

International Journal of Theoretical PhysicsMar 17, 200810 citations

Probabilistic quantum teleportation in the presence of noise

Raphael Fortes, Gustavo Rigolin

We extend the research program initiated in [Phys. Rev. A 92, 012338 (2015)] from noisy deterministic teleportation protocols to noisy probabilistic (conditional) protocols. Our main goal now is to study how we can increase the fidelity of the teleported state in the presence of noise by working with probabilistic protocols. We work with several scenarios involving the most common types of noise in realistic implementations of quantum communication tasks and find many cases where adding more noise to the probabilistic protocol increases considerably the fidelity of the teleported state, without decreasing the probability of a successful run of the protocol. Also, there are cases where the entanglement of the channel connecting Alice and Bob leading to the greatest fidelity is not maximal. Moreover, there exist cases where the optimal fidelity for the probabilistic protocols are greater than the maximal fidelity $(2/3)$ achievable by using only classical resources, while the optimal ones for the deterministic protocols under the same conditions lie below this limit. This result clearly illustrates that in some cases we can only get a truly quantum teleportation if we use probabilistic instead of deterministic protocols.We extend the research program initiated in [Phys. Rev. A 92, 012338 (2015)] from noisy deterministic teleportation protocols to noisy probabilistic (conditional) protocols. Our main goal now is to study how we can increase the fidelity of the teleported state in the presence of noise by working with probabilistic protocols. We work with several scenarios involving the most common types of noise in realistic implementations of quantum communication tasks and find many cases where adding more noise to the probabilistic protocol increases considerably the fidelity of the teleported state, without decreasing the probability of a successful run of the protocol. Also, there are cases where the entanglement of the channel connecting Alice and Bob leading to the greatest fidelity is not maximal. Moreover, there exist cases where the optimal fidelity for the probabilistic protocols are greater than the maximal fidelity $(2/3)$ achievable by using only classical resources, while the optimal ones for the deterministic protocols under the same conditions lie below this limit. This result clearly illustrates that in some cases we can only get a truly quantum teleportation if we use probabilistic instead of deterministic protocols.

arXiv:1604.04644Physical Review AJun 23, 201642 citations

Probabilistic and controlled teleportation of unknown quantum states

Fengli Yan, Dong Wang

Physics Letters ASep 1, 2003173 citations

Probabilistic teleportation via a non-maximally entangled GHZ state

Yan Feng-Li, Tao Yan

We present a scheme for probabilistic teleportation via a non-maximally entangled GHZ state. Quantum teleportation will succeed with a certain probability if the sender makes a generalized Bell state measurement, the cooperator performs a generalized $X$ basis measurement, and the receiver introduces an auxiliary particle, performs a collective unitary transformation and makes a measurement on the auxiliary particle. The success probability of the teleportation is given. We also obtain the maximum of the success probability of the teleportation.We present a scheme for probabilistic teleportation via a non-maximally entangled GHZ state. Quantum teleportation will succeed with a certain probability if the sender makes a generalized Bell state measurement, the cooperator performs a generalized $X$ basis measurement, and the receiver introduces an auxiliary particle, performs a collective unitary transformation and makes a measurement on the auxiliary particle. The success probability of the teleportation is given. We also obtain the maximum of the success probability of the teleportation.

arXiv:0904.2029Apr 13, 20090 citations

(2/3)

achievable by using only classical resources, while the optimal ones for the deterministic protocols under the same conditions lie below this limit. This result clearly illustrates that in some cases we can only get a truly quantum teleportation if we use probabilistic instead of deterministic protocols.

X

basis measurement, and the receiver introduces an auxiliary particle, performs a collective unitary transformation and makes a measurement on the auxiliary particle. The success probability of the teleportation is given. We also obtain the maximum of the success probability of the teleportation.