Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle
Dami\'an Pital\'ua-Garc\'ia

TL;DR
This paper establishes a fundamental upper limit on the success probability of port-based quantum teleportation by leveraging principles from no-cloning and no-signaling, highlighting inherent quantum constraints.
Contribution
It introduces a new theorem linking no-cloning and no-signaling to derive an upper bound on port-based teleportation success probability.
Findings
Derived an upper bound on teleportation success probability
Linked quantum no-cloning and no-signaling principles
Provided theoretical limits for port-based teleportation
Abstract
In port-based teleportation, Alice teleports an unknown quantum state to one of N ports at Bob's site. Alice applies a measurement and sends Bob the outcome k. Bob only needs to select the kth port in order to obtain the state. We present a theorem in the spirit of the no-cloning theorem, which says that it is impossible to extract any information from an unknown quantum state if only a single copy of it is provided and if the state remains unchanged. We use this theorem and the no-signaling principle to prove an upper bound on the success probability of port-based teleportation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
