Researchers have developed a method for perfect quantum channel discrimination in a parallel scheme, a fundamental problem in quantum information theory. This advancement allows for the determination of the optimal quantum state for this task and the minimum number of quantum channel copies required to achieve perfect discrimination. The work is based on a semidefinite programming (SDP) formulation combined with a bisection procedure, enabling the quantum state to be computed in time linear with respect to the number of copies.

This study has affirmatively settled Conjecture 1 of Duan, Guo, Li, and Li (arXiv:1605.02294, IEEE ISIT 2016), which characterized the number of parallel uses needed to perfectly discriminate a distinguished family of operator subspaces. This achievement is grounded in the use of the concept and basic properties of the numerical range. A key result proven is that the minimal angle of the numerical range of a tensor product of matrix subspaces equals the sum of the minimal angles of the numerical ranges of the individual subspaces.

The ability to perfectly discriminate quantum channels is crucial for various applications in quantum computing and communication. This advance not only provides an efficient computational tool but also deepens the theoretical understanding of how different quantum operations can be distinguished. The resolution of the previous conjecture validates an important aspect of the theory and opens new avenues for designing more robust and efficient quantum protocols.