2019/05/06 by Haixin Liu, Liu, Haixin, Heng Fan +1
Computer Science · Physics and Astronomy · #Applied Physics (physics.app-ph) #FOS: Physical sciences #Mathematical Physics (math-ph) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1905.01878
openalex publication_date 2019/05/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.