The quantum Chernoff bound is a famous result about discriminating two different states in a setting where large numbers of copies are available, which gives the analytic asymptotic rate at which the minimal error probability decays to zero exponentially. It is however a challenging task to calculate the quantum Chernoff bound exactly in practical scenarios. In this paper, from the viewpoint of differential geometry, we demonstrate a remarkable link between the quantum Chernoff bound and Wigner-Yanase skew information. As a result, the quantum Chernoff bound can be estimated efficiently by virtue of the skew information. We present several examples to illustrate the efficiency of estimation about the quantum Chernoff bound via Wigner-Yanase skew information.
The quantum Chernoff bound is a famous result about discriminating two different states in a setting where large numbers of copies are available, which gives the analytic asymptotic rate at which the minimal error probability decays to zero exponentially. It is however a challenging task to calculate the quantum Chernoff bound exactly in practical scenarios. In this paper, from the viewpoint of differential geometry, we demonstrate a remarkable link between the quantum Chernoff bound and Wigner-Yanase skew information. As a result, the quantum Chernoff bound can be estimated efficiently by virtue of the skew information. We present several examples to illustrate the efficiency of estimation about the quantum Chernoff bound via Wigner-Yanase skew information.
We consider the problem of discriminating two different quantum states in the setting of asymptotically many copies, and determine the minimal probability of error. This leads to the identification of the quantum Chernoff bound, thereby solving a long-standing open problem. The bound reduces to the classical Chernoff bound when the quantum states under consideration commute. The quantum Chernoff bound is the natural symmetric distance measure between quantum states because of its clear operational meaning and because it does not seem to share some of the undesirable features of other distance measures.
Hypothesis testing is a fundamental issue in statistical inference and has been a crucial element in the development of information sciences. The Chernoff bound gives the minimal Bayesian error probability when discriminating two hypotheses given a large number of observations. Recently the combined work of Audenaert et al. [Phys. Rev. Lett. 98, 160501 (2007)] and Nussbaum and Szkola [e-print arXiv:quant-ph/0607216] has proved the quantum analog of this bound, which applies when the hypotheses correspond to two quantum states. Based on this quantum Chernoff bound, we define a physically meaningful distinguishability measure and its corresponding metric in the space of states; the latter is shown to coincide with the Wigner-Yanase metric. Along the same lines, we define a second, more easily implementable, distinguishability measure based on the error probability of discrimination when the same local measurement is performed on every copy. We study some general properties of these measures, including the probability distribution of density matrices, defined via the volume element induced by the metric. It is shown that the Bures and the local-measurement based metrics are always proportional. Finally, we illustrate their use in the paradigmatic cases of qubits and Gaussian infinite-dimensional states.
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 the two given and completely known states, ρ or σ. 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 ρ for σ, 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 ρ and σ (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.
We consider the problem of discriminating between two different states of a finite quantum system in the setting of large numbers of copies, and find a closed form expression for the asymptotic exponential rate at which the error probability tends to zero. This leads to the identification of the quantum generalisation of the classical Chernoff distance, which is the corresponding quantity in classical symmetric hypothesis testing. The proof relies on two new techniques introduced by the authors, which are also well suited to tackle the corresponding problem in asymmetric hypothesis testing, yielding the quantum generalisation of the classical Hoeffding bound. This has been done by Hayashi and Nagaoka for the special case where the states have full support. The goal of this paper is to present the proofs of these results in a unified way and in full generality, allowing hypothesis states with different supports. From the quantum Hoeffding bound, we then easily derive quantum Stein’s Lemma and quantum Sanov’s theorem. We give an in-depth treatment of the properties of the quantum Chernoff distance, and argue that it is a natural distance measure on the set of density operators, with a clear operational meaning.
Determining the closeness of two quantum states with minimal error probability is a central problem in quantum information theory. The optimal exponents characterizing the error probability in the symmetric and asymmetric settings are given by the quantum Chernoff bound (QCB) and the quantum Hoeffding bound (QHB), respectively. In this work, we introduce the first algorithms for estimating the QCB and QHB of two unknown states. We propose a unitary encoding for diagonal density matrix based on the copy matrix, which enables unbiased estimation of nonlinear matrix functions via quantum singular value transformation (QSVT). For general density matrices, we combine QSVT with the Hadamard test to estimate both QCB and QHB. Numerical simulations demonstrate that the algorithm converges to the optimal value within a limited number of iterations. Furthermore, we establish the first integration of QSVT with convex optimization, yielding a hybrid quantum-classical framework for quantum estimation.
Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding the set of achievable errors, using the trace norm, the fidelity, and the quantum Chernoff bound. The upper bound is asymptotically tight and the lower bound is exact for pure states. Unlike asymptotic bounds, our bounds give error values instead of exponents, so can give more precise results when applied to finite-copy state discrimination problems.