Estimates of non-optimality of quantum measurements and a simple iterative method for computing optimal measurements

Abstract

We construct crude estimates for non-optimality of quantum measurements in terms of their violation of Holevo's simplified minimum-error optimality conditions. As an application, we show that a modification of Barnett and Croke's proof of the optimality conditions yields a convergent iterative scheme for computing optimal measurements.

The optimality condition in the prevoius version had already been shown by Holevo. The bounds on non-optimality and convergence of the iterative algorithm are unchanged

References in corpus (3)

• From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
• For Distinguishing Conjugate Hidden Subgroups, the Pretty Good Measurement is as Good as it Gets
• The Optimal Single Copy Measurement for the Hidden Subgroup Problem

Cited by in corpus (1)

• Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem