2006/11/09 by Xiang-Fa Zhou, Qing Lin, Yong-Sheng Zhang +2 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computer science #Construct (python library) #Finite set #Mathematical analysis #Mathematics #Mixing (physics) #Physics #Probabilistic logic #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum cloning #Quantum computer #Quantum mechanics #Quantum network #Set (abstract data type) #State (computer science) #TRACE (psycholinguistics) #Transformation (genetics) #Unitary state #Unitary transformation #quant-ph
paper · pdf · doi:10.1103/physreva.75.012321
7 pages
arxiv created 2006/11/09 · openalex publication_date 2007/01/19 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We consider treating the usual probabilistic cloning, state separation, unambiguous state discrimination, etc., in a uniform framework. All these transformations can be regarded as special examples of generalized completely positive trace-nonincreasing maps on a finite number of input states. From the system-ancilla model we construct the corresponding unitary implementation of pure\ensuremath→pure, pure\ensuremath→mixed, mixed\ensuremath→pure, and mixed\ensuremath→mixed state transformations in the whole system and obtain the necessary and sufficient conditions for the existence of the desired maps. We expect our work will be helpful to explore physically accessible transormations on a finite set of input states.