Error exponent in asymmetric quantum hypothesis testing and its application to classical-quantum channel coding

An upper bound on simple quantum hypothesis testing in the asymmetric setting is shown using a useful inequality by Audenaert et al. [Phys. Rev. Lett. 98, 160501 (2007)] which was originally invented for symmetric setting. Using this upper bound, we obtain the Hoeffding bound, which is identical with the classical counterpart if the hypotheses, composed of two density operators, are mutually commutative. Its attainability has been a long-standing open problem. Further, using this bound, we obtain a better exponential upper bound of the average error probability of classical-quantum channel coding.

[1]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[2]  C. Helstrom.  Quantum detection and estimation theory , 1969 .

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

[4]  Te Sun Han,et al.  The strong converse theorem for hypothesis testing , 1989, IEEE Trans. Inf. Theory.

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

[6]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[7]  Wassily Hoeffding,et al.  On probabilities of large deviations , 1994 .

[8]  A.S.Holevo,et al.  On Reliability Function of Quantum Communication Channel , 1997 .

[9]  Michael D. Westmoreland,et al.  Sending classical information via noisy quantum channels , 1997 .

[10]  A. Holevo,et al.  On Reliability Function of Quantum Communication Channel , 1997 .

[11]  Alexander S. Holevo,et al.  The Capacity of the Quantum Channel with General Signal States , 1996, IEEE Trans. Inf. Theory.

[12]  H. Nagaoka,et al.  Strong converse theorems in the quantum information theory , 1999, 1999 Information Theory and Networking Workshop (Cat. No.99EX371).

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

[14]  M. Hayashi.  Exponents of quantum fixed-length pure-state source coding , 2002, quant-ph/0202002.

[15]  H. Nagaoka,et al.  A new proof of the channel coding theorem via hypothesis testing in quantum information theory , 2002, Proceedings IEEE International Symposium on Information Theory,.

[16]  Hiroki Koga,et al.  Information-Spectrum Methods in Information Theory , 2002 .

[17]  Masahito Hayashi,et al.  General formulas for capacity of classical-quantum channels , 2003, IEEE Transactions on Information Theory.

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

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

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

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

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