A lower bound of Chernoff type for symmetric quantum hypothesis testing
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] I. N. Sanov. On the probability of large deviations of random variables , 1958 .
[3] W. Hoeffding. Asymptotically Optimal Tests for Multinomial Distributions , 1965 .
[4] C. Helstrom. Quantum detection and estimation theory , 1969 .
[5] H. Yuen. Quantum detection and estimation theory , 1978, Proceedings of the IEEE.
[6] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.
[7] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[8] Tomohiro Ogawa,et al. Strong converse and Stein's lemma in quantum hypothesis testing , 2000, IEEE Trans. Inf. Theory.
[9] Vladislav Kargin,et al. On the Chernoff bound for efficiency of quantum hypothesis testing , 2003, math/0308077.
[10] Masahito Hayashi,et al. On error exponents in quantum hypothesis testing , 2004, IEEE Transactions on Information Theory.
[11] J. Deuschel,et al. A Quantum Version of Sanov's Theorem , 2004, quant-ph/0412157.
[12] Thierry Paul,et al. Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.