2004/03/31 by Yuan Feng, Runyao Duan, Mingsheng Ying · 3 citations
Computer Science · Mathematics · Physics and Astronomy · #A priori and a posteriori #Algorithm #Computer science #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Quantum state #Series (stratigraphy) #Set (abstract data type) #State (computer science) #Statistical physics #quant-ph
paper · pdf · doi:10.1103/physreva.70.012308
published as Phys. Rev. A 70, 012308 (2004) · 4 pages, journal version
openalex publication_date 2004/07/14 · arxiv created 2005/04/07 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
We prove that the states secretly chosen from a mixed state set can be perfectly discriminated if and only if they are orthogonal. The sufficient and necessary condition under which nonorthogonal mixed quantum states can be unambiguously discriminated is also presented. Furthermore, we derive a series of lower bounds on the inconclusive probability of unambiguous discrimination of states from a mixed state set with a priori probabilities.