Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0210004 · Physics Letters A

Probabilistic quantum teleportation

Pankaj Agrawal, Arun Kumar Pati

Published Nov 1, 2002• 188 citations
arXivHTMLPDF
DOI
10.1016/s0375-9601(02)01383-x

Related papers

Probabilistic resumable bidirectional quantum teleportation

Yitao Gou, Hailong Shi, Xiao-Hui Wang +1 more

Quantum Information Processing•Oct 4, 2017•28 citations

Probabilistic Teleportation Protocols

Binayak S. Choudhury, Soumen Samanta

The protocols presented in this chapter are probabilistic teleportation protocols in which there are cases of failures with certain probabilities. Probabilistic teleportation schemes of various kinds have been discussed in works like [ 1 , 41 , 45 , 76 , 82 , 85 , 98 , 118 , 135 , 168 , 169 , 180 ]. Generally the quantum resources used in these protocols are not maximally entangled. This is one explanation for the probabilistic nature of these protocols. The justification of studying these protocols is that the generation and preservation of resources for these protocols are less difficult compared to that of those where maximally entangled states are used. Also, there is a class of resumable protocols in which the probabilistic teleportation process can be repeated in the case where the attempt fails in the first place [ 21 , 52 , 104 , 105 ].

Chapman & Hall/CRC eBooks•Dec 10, 2025•0 citations

Probabilistic Teleportation via Entanglement

Dechao Li, Shi Zhong-ke

International Journal of Theoretical Physics•Mar 17, 2008•11 citations

Probabilistic and controlled teleportation of unknown quantum states

Fengli Yan, Dong Wang

Physics Letters A•Sep 1, 2003•173 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.

arXiv:1604.04644•Physical Review A•Jun 23, 2016•43 citations

Teleportation in general probabilistic theories

Howard Barnum, Jonathan Barrett, Matthew Leifer +1 more

In a previous paper, we showed that many important quantum information-theoretic phenomena, including the no-cloning and no-broadcasting theorems, are in fact generic in all non-classical probabilistic theories. An exception is teleportation, which most such theories do not support. In this paper, we investigate which probabilistic theories, and more particularly, which composite systems, {\em do} support a teleportation protocol. We isolate a natural class of composite systems that we term {\em regular}, and establish necessary and sufficient conditions for a regular tripartite system to support a conclusive, or post-selected, teleportation protocol. We also establish a sufficient condition for deterministic teleportation that yields a large supply of theories, neither classical nor quantum, that support such a protocol.

arXiv:0805.3553•Proceedings of symposia in applied mathematics•Jan 1, 2012•117 citations
The protocols presented in this chapter are probabilistic teleportation protocols in which there are cases of failures with certain probabilities. Probabilistic teleportation schemes of various kinds have been discussed in works like [ 1 , 41 , 45 , 76 , 82 , 85 , 98 , 118 , 135 , 168 , 169 , 180 ]. Generally the quantum resources used in these protocols are not maximally entangled. This is one explanation for the probabilistic nature of these protocols. The justification of studying these protocols is that the generation and preservation of resources for these protocols are less difficult compared to that of those where maximally entangled states are used. Also, there is a class of resumable protocols in which the probabilistic teleportation process can be repeated in the case where the attempt fails in the first place [ 21 , 52 , 104 , 105 ].
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)(2/3)(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.
In a previous paper, we showed that many important quantum information-theoretic phenomena, including the no-cloning and no-broadcasting theorems, are in fact generic in all non-classical probabilistic theories. An exception is teleportation, which most such theories do not support. In this paper, we investigate which probabilistic theories, and more particularly, which composite systems, {\em do} support a teleportation protocol. We isolate a natural class of composite systems that we term {\em regular}, and establish necessary and sufficient conditions for a regular tripartite system to support a conclusive, or post-selected, teleportation protocol. We also establish a sufficient condition for deterministic teleportation that yields a large supply of theories, neither classical nor quantum, that support such a protocol.