Quantum state discrimination bounds for finite sample size
arXiv:1204.0711 · doi:10.1063/1.4768252
Abstract
In the problem of quantum state discrimination, one has to determine by measurements the state of a quantum system, based on the a priori side information that the true state is one of two given and completely known states, rho or sigma. In general, it is not possible to decide the identity of the true state with certainty, and the optimal measurement strategy depends on whether the two possible errors (mistaking rho for sigma, or the other way around) are treated as of equal importance or not. Results on the quantum Chernoff and Hoeffding bounds and the quantum Stein's lemma show that, if several copies of the system are available then the optimal error probabilities decay exponentially in the number of copies, and the decay rate is given by a certain statistical distance between rho and sigma (the Chernoff distance, the Hoeffding distances, and the relative entropy, respectively). While these results provide a complete solution to the asymptotic problem, they are not completely satisfying from a practical point of view. Indeed, in realistic scenarios one has access only to finitely many copies of a system, and therefore it is desirable to have bounds on the error probabilities for finite sample size. In this paper we provide finite-size bounds on the so-called Stein errors, the Chernoff errors, the Hoeffding errors and the mixed error probabilities related to the Chernoff and the Hoeffding errors.
31 pages. v4: A few typos corrected. To appear in J.Math.Phys
References in corpus (8)
- The Quantum Chernoff Bound
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- The Chernoff lower bound for symmetric quantum hypothesis testing
- Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
- Error exponents in hypothesis testing for correlated states on a spin chain
- Large deviations and Chernoff bound for certain correlated states on a spin chain
- Block circulant matrices with circulant blocks, weil sums and mutually unbiased bases, II. The prime power case
- Asymptotic distinguishability measures for shift-invariant quasi-free states of fermionic lattice systems