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 strongest model equals any one-way protocol in surpassing the classical teleportation
Deduction of an upper bound on the success probability of port-based teleportation from the no-cloning theorem and the no-signaling principle
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A resource theory of asynchronous quantum information processing
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 strongest model equals any one-way protocol in surpassing the classical teleportation