We investigate the quantum state discrimination task for sets of linear independent pure states with an intrinsic ordering. These structured discrimination problems allow for a scheme that provides a certified level of error; that is, answers that never deviate from the true value by more than a specified distance and hence control the desired quality of the results. We obtain an efficient semidefinite program and also find a general lower bound valid for any error distance that only requires the knowledge of an optimal minimum-error scheme. We apply our results to the cases of quantum change point and quantum state anomaly detection.
|Journal||Physical Review A|
|Publication status||Published - 30 Oct 2019|