pith. sign in

arxiv: 1206.4836 · v2 · pith:6A2RSFOSnew · submitted 2012-06-21 · 🪐 quant-ph

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

classification 🪐 quant-ph
keywords statetheoremport-basedteleportationaliceboundno-cloningno-signaling
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A resource theory of asynchronous quantum information processing

    quant-ph 2025-04 unverdicted novelty 7.0

    Introduces resource theories for asynchronous port-based teleportation with free classical and quantum pre-processing, computes tight fidelity bounds for isotropic, graph, and symmetrized EPR states, and proves the st...