Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle

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.

5 pages, plus 2 of supplemental material. Expanded discussion in response to referee comments. Final version

References in corpus (8)

• Asymptotic teleportation scheme as a universal programmable quantum processor
• Simplified instantaneous non-local quantum computation with applications to position-based cryptography
• Quantum teleportation scheme by selecting one of multiple output ports
• Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
• Location-Dependent Communications using Quantum Entanglement
• Insecurity of position-based quantum cryptography protocols against entanglement attacks
• Quantum Tagging for Tags Containing Secret Classical Data
• Entanglement consumption of instantaneous nonlocal quantum measurements

Cited by in corpus (6)

• Asymptotic performance of port-based teleportation
• Generalized teleportation and entanglement recycling
• Higher-dimensional performance of port-based teleportation
• Optimality of the pretty good measurement for port-based teleportation
• Port-Based State Preparation and Applications
• A resource theory of asynchronous quantum information processing