2019/03/31 by Hayato Arai, Yuuya Yoshida, Masahito Hayashi
Computer Science · Physics and Astronomy · #Bipartite graph #Class (philosophy) #Probabilistic logic #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Separable space #Separable state #quant-ph
paper · pdf · doi:10.1088/1751-8121/ab4b64
published as Journal of Physics A: Mathematical and Theoretical, Vol. 52, 465304 (2019) · 18 pages
openalex created_date 2019/03/11 · arxiv created 2019/06/30 · openalex publication_date 2019/10/07 · arxiv updated 2020/10/08 · openalex updated_date 2026/08/06
Abstract We address perfect discrimination of two separable states. When available states are restricted to separable states, we can theoretically consider a larger class of measurements than the class of measurements allowed in quantum theory. The framework composed of the class of separable states and the above extended class of measurements is a typical example of general probabilistic theories. In this framework, we give a necessary and sufficient condition to discriminate two separable pure states perfectly. In particular, we derive measurements explicitly to discriminate two separable pure states perfectly, and find that some non-orthogonal states are perfectly distinguishable. However, the above framework does not improve the capacity , namely, the maximum number of states that are simultaneously and perfectly distinguishable.