极小最大量子态区分

Minimax quantum state discrimination

得到在未知先验概率的情况下,区分三个非正交量子态的最优概率,给出了求解这类问题的公式,同时,把这类区分和Bayesian非正交量子态的区分相比较。该方法可以推广到N个非正交量子态问题的区分。

We derive the optimal probabilities for minimax unambiguous discrimination（MUD） among three pure states without knowing a priori probabilities. We present the formulation for solving the MUD problem, and make a detailed comparison between MUD and Bayesian unambiguous discrimination（BUD） with a priori probabilities when N = 3. Our method can be generalized to any N linearly independent pure states.