Probabilistic quantum cloning of N quantum states
Haixin Liu, Heng Fan

TL;DR
This paper develops a geometric framework for optimal probabilistic quantum cloning of N known states, providing rigorous proofs and conditions that improve understanding of cloning and state identification in quantum information.
Contribution
It introduces a general geometric approach to probabilistic quantum cloning for N states, including necessary and sufficient conditions and optimal cloning strategies.
Findings
Established a rigorous geometric proof for N=2 case.
Derived the general geometric form of cloning conditions for N states.
Achieved optimal probabilistic cloning applicable to quantum state identification.
Abstract
Probabilistically creating n perfect clones from m copies for one of N priori known quantum states with minimum failure probability is a long-standing problem. We provide a rigorous proof for the geometric approach to this probabilistic quantum cloning problem when N = 2. Then, we give the general geometric form of the sufficient and necessary condition of probabilistic cloning for N known quantum states. By this general geometric approach, we realize the optimal probabilistic quantum cloning of N known quantum states with priori probabilities. The results are also applicable to the identification of those N quantum states.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
