When is the Chernoff Exponent for Quantum Operations Finite?

We consider the problem of testing two hypotheses of quantum operations in a setting of many uses where an arbitrary prior probability distribution is given. The Chernoff exponent for quantum operations is investigated to track the minimal average error probability of discriminating two quantum operations asymptotically. We answer the question, When is the Chernoff exponent for quantum operations finite? We show that either two quantum operations can be perfectly distinguished with finite uses, or the minimal discrimination error decays exponentially with respect to the number of uses asymptotically. That is, the Chernoff exponent is finite if and only if the quantum operations can not be perfectly distinguished with finite uses. This rules out the possibility of super-exponential decay of error probability. Upper bounds of the Chernoff exponent for quantum operations are provided.

Automated summary

The problem of testing two hypotheses of quantum operations with an arbitrary prior probability distribution in a setting of many uses is considered. The Chernoff exponent for quantum operations is investigated to track the minimal average error probability of discriminating two quantum operations asymptotically. It is shown that the Chernoff exponent is finite if and only if the quantum operations can not be perfectly distinguished with finite uses, ruling out the possibility of super-exponential decay of error probability. Upper bounds of the Chernoff exponent for quantum operations are provided.