Bayes-cost reduction algorithm in quantum hypothesis testing (Corresp.)
Carl W. Helstrom · IEEE Transactions on Information Theory · 1982
An iterative procedure is described for reducing the Bayes cost in decisions amongM>2quantum hypotheses by minimizing the average cost in binary decisions between all possible pairs of hypotheses: the resulting decision strategy is a projection-valued measure and yields an upper bound to the minimum attainable Bayes cost. From it is derived an algorithm for finding the optimum measurement states for choosing amongMlinearly independent pure states with minimum probability of error. The method is also applied to decisions amongMunimodal coherent quantum signals in thermal noise.