Remote Preparation and Distribution of Bipartite Entangled States
classification
🪐 quant-ph
keywords
entanglementdistributionremotetheoremamountbipartiteboundcapacity
read the original abstract
We prove a powerful theorem for tripartite remote entanglement distribution protocols that establishes an upper bound on the amount of entanglement of formation that can be created between two single-qubit nodes of a quantum network. Our theorem also provides an operational interpretation of concurrence as a type of entanglement capacity.
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.