Exponential error rates in multiple state discrimination on a quantum spin chain

Abstract

We consider decision problems on finite sets of hypotheses represented by pairwise different shift-invariant states on a quantum spin chain. The decision in favor of one of the hypotheses is based on outcomes of generalized measurements performed on local states on blocks of finite size. We assume the existence of the mean quantum Chernoff distances of any pair of states from the given set and refer to the minimum of them as the mean generalized quantum Chernoff distance. We establish that this minimum specifies an asymptotic bound on the exponential rate of decay of the averaged probability of rejecting the true state in increasing block size, if the mean quantum Chernoff distance of any pair of the hypothetic states is achievable as an asymptotic error exponent in the corresponding binary problem. This assumption is, in particular, fulfilled by shift-invariant product states (independent and identically distributed states). Further, we provide a constructive proof for the existence of a sequence of quantum tests in increasing block length with an error exponent which equals, up to a factor, the mean generalized quantum Chernoff distance. The factor depends on the configuration of the hypothetic states with respect to the binary quantum Chernoff distances. It can be arbitrary close to 1 and is never less than 1/m for m being the number of different pairs of states.