Paper
16 May 2003 Quantum noise and probabilistic teleportation
Arun K. Pati, P. Agrawal
Author Affiliations +
Proceedings Volume 5111, Fluctuations and Noise in Photonics and Quantum Optics; (2003) https://doi.org/10.1117/12.497241
Event: SPIE's First International Symposium on Fluctuations and Noise, 2003, Santa Fe, New Mexico, United States
Abstract
In the presence of quantum noise a perfect EPR pair becomes imperfect and may be described by a non-maximally entangled pair. With non-maximally entangled state as a resource one cannot teleport an unknown state faithfully. Typically, one has to perform either local filtering or entanglement concentration and then follow the standard teleportation method. In this talk, we will present a new protocol that uses neither local filtering nor entanglement concentration to teleport an unknown state. We show that using non-maximally entangled measurements one can teleport an unknown state with unit fidelity but with a probability that is less than unit. Ours is a generalized quantum teleportation protocol that encompasses probabilistic as well as deterministic teleportation scenarios. We describe the probabilistic teleportation in terms of quantum operations and give explicit expressions for success and failure probabilities. This may have practical value in real experiments, and even may be tested with current technology.
© (2003) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Arun K. Pati and P. Agrawal "Quantum noise and probabilistic teleportation", Proc. SPIE 5111, Fluctuations and Noise in Photonics and Quantum Optics, (16 May 2003); https://doi.org/10.1117/12.497241
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Teleportation

Entangled states

Particles

Quantum communications

Failure analysis

Quantum information

Drug discovery

RELATED CONTENT


Back to Top