This is the authors' abstract. We don't add key points for this paper.
The no-cloning theorem is a cornerstone of quantum cryptography. Here we generalize and rederive in a unified framework various upper bounds on the maximum achievable fidelity of probabilistic and deterministic cloning machines. Building on ideas by Gisin [Phys. Lett. A 242, 1 (1998)], our result follows from the fact that remote state preparation is possible and the no-signaling principle holds. We apply our general theorem to several subsets of states that are of interest in quantum cryptography.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Hu et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: