论文信息 - The Converse Part of The Theorem for Quantum Hoeffding Bound

The Converse Part of The Theorem for Quantum Hoeffding Bound

We prove the converse part of the theorem for quantum Hoeffding bound on the asymptotics of quantum hypothesis testing, essentially based on an argument developed by Nussbaum and Szkola in proving the converse part of the quantum Chernoff bound. Our result complements Hayashi's proof of the direct (achievability) part of the theorem, so that the quantum Hoeffding bound has now been established.

H. Nagaoka

[1] A. Uhlmann. Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory , 1977 .

[2] H. Yuen. Quantum detection and estimation theory , 1978, Proceedings of the IEEE.

[3] D. Petz. Quasi-entropies for finite quantum systems , 1986 .

[4] Richard E. Blahut,et al. Principles and practice of information theory , 1987 .

[5] F. Hiai,et al. The proper formula for relative entropy and its asymptotics in quantum probability , 1991 .

[6] Tomohiro Ogawa,et al. Strong converse and Stein's lemma in quantum hypothesis testing , 2000, IEEE Trans. Inf. Theory.

[7] Masahito Hayashi,et al. On error exponents in quantum hypothesis testing , 2004, IEEE Transactions on Information Theory.

[8] 林正人. Quantum information : an introduction , 2006 .

[9] M. Nussbaum,et al. A lower bound of Chernoff type for symmetric quantum hypothesis testing , 2006 .

[10] Masahito Hayashi,et al. An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses , 2007, IEEE Transactions on Information Theory.

[11] K. Audenaert,et al. Discriminating States: the quantum Chernoff bound. , 2006, Physical review letters.

[12] Masahito Hayashi. Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding , 2006, quant-ph/0611013.