Strong Converse and Stein s Lemma in the Quantum Hypothesis Testing
|
|
- Hubert Jennings
- 5 years ago
- Views:
Transcription
1 Strong Converse and Stein s Lemma in the Quantum Hypothesis Testing arxiv:uant-ph/ v 24 Jun 999 Tomohiro Ogawa and Hiroshi Nagaoka Abstract The hypothesis testing problem of two uantum states is treated. We show a new ineuality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the uantum version of Stein s lemma. The ineuality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the uantum relative entropy, and the bound yields the strong converse in the uantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi in the classical hypothesis testing. Keywords Quantum hypothesis testing, Stein s lemma, strong converse, uantum relative entropy. Introduction Let H be a Hilbert space which represents a physical system in interest. We suppose dim H < for mathematical simplicity. Let B(H) be the set of linear operators on H and put S(H) = {ρ B(H) ρ = ρ 0, Tr ρ = }, which is the set of density operators on H. We treat the problem of hypothesis testing a null hypothesis ρ S(H) versus an alternative hypothesis σ S(H). Here, we assume Im ρ Im σ. To consider an asymptotic situation, suppose that either ρ n S(H n ) or σ n S(H n ) is given. The problem is to decide which hypothesis is true, and the decision is given by a two-valued uantum measurement {A n, A n } (A n B(H n ), 0 A n ), where A n corresponds to the acceptance of ρ n and A n corresponds to the acceptance of σ n. We call A n B(H n ) (0 A n ) a test in the seuel. The authors are with the Graduate School of Information Systems, University of Electro- Communications, 5 Chofugaoka, Chofu, Tokyo , Japan. ( ogawa@hn.is.uec.ac.jp, nagaoka@is.uec.ac.jp)
2 For a test A n, ine the error probability of the first kind and the second kind by α n (A n ) β n (A n ) = Tr ρ n ( A n ), = Tr σ n A n, respectively. We see that α n (A n ) is the error probability of the acceptance of σ n when ρ n is true and β n (A n ) is the error probability of the converse situation. Since we can not have α n (A n ) and β n (A n ) arbitrarily small simultaneously, we will make β n (A n ) as small as possible under the constraint α n (A n ) ε. In other words, the problem is to examine the asymptotic behavior of the following uantity: β n(ε) = min{β n (A n ) A n B(H n ), 0 A n I, α n (A n ) ε}. Concerning β n(ε), Hiai and Petz [] showed and where lim sup n log β n(ε) D(ρ σ), () D(ρ σ) lim inf ε n log β n(ε), (2) D(ρ σ) = Tr ρ(log ρ log σ), is the uantum relative entropy. As for (2), they used the monotonicity of the uantum relative entropy [2, 3] as follows: D(ρ n σ n ) α n (A n ) α n (A n ) log β n (A n ) + ( α n(a n )) log α n(a n ) β n (A n ) = h(α n (A n )) α n (A n ) log( β n (A n )) ( α n (A n )) log β n (A n ) log 2 ( α n (A n )) log β n (A n ), where h(x) is the binary entropy. Thus it holds that ( α n (A n )) n log β n(a n ) log 2 n D(ρ σ), (3) which immediately yields (2). Note that (3) also leads the weak converse property, which means that if β n (A n ) e nr (r > D(ρ σ)) then α n (A n ) does not go to zero as n. In this paper, we will show a fundamental ineuality, which complements () by Hiai and Petz to show the uantum version of Stein s lemma (see e.g. [4], p.5). We will also show a bound on α n (A n ) under the exponential-type constraint β n (A n ) e nr. The bound leads to the strong converse property [5, 6] in the uantum hypothesis testing, i.e., if β n (A n ) e nr (r > D(ρ σ)) then α n (A n ) goes to one as n. Finally, we discuss the relation with the result of Han and Kobayashi [6] in the classical hypothesis testing.
3 2 A Fundamental Bound on the Error Probabilities In this section, we show a fundamental ineuality between the error probabilities of the first kind and the second kind. Let λ be a real number and ρ n e nλ σ n = j µ n,j E n,j, (4) be the spectral decomposition. Define a test X n,λ by X n,λ = j D n E n,j, where D n = {j µ n,j 0}. Then, the following lemma holds, which corresponds to the uantum version of the Neyman-Pearson lemma (see [7], p.08). Lemma For any test A n, we have Proof: Tr (ρ n e nλ σ n )X n,λ Tr (ρ n e nλ σ n )A n. (5) Tr (ρ n e nλ σ n )A n = µ n,j Tr E n,j A n j µ n,j Tr E n,j A n j D n µ n,j Tr E n,j j D n = Tr (ρ n e nλ σ n )X n,λ. Theorem For any test A n and any λ R, we have where α n (A n ) e nϕ(λ) + e nλ β n (A n ), (6) ϕ(λ) ψ(s) = max {λs ψ(s)}, (7) 0 s = log Tr ρ +s σ s. (8) Here, note that ϕ(λ) is the Legendre transformation of a convex function ψ(s) (see Fig. and 2). Putting A = log ρ log σ ψ (s), the convexity of ψ(s) is verified as ψ (s) = e ψ(s) Tr ρ +s σ s (log ρ log σ), ψ (s) = e ψ(s) Tr ρ +s Aσ s A = e ψ(s) Tr ( ) ( ) ρ +s 2 Aσ s +s 2 ρ 2 Aσ s 2 > 0.
4 Observing that ψ(0) = 0 and ψ (0) = D(ρ σ), we can see that if λ > D(ρ σ) then ϕ(λ) > 0. It is important to note that for any λ satisfying D(ρ σ) λ ψ (), we have s = argmax{λs ψ(s)} ψ (s ) = λ. (9) 0 s Proof of Theorem : Define probability distributions p n = {p n,j } and n = { n,j } by p n,j = Tr ρ n E n,j, n,j = Tr σ n E n,j. From (4), we have µ n,j Tr E n,j = p n,j e nλ n,j, and hence, Thus, we obtain D n = {j 0 s, e nλs p s n,j s n,j }. Tr ρ n X n,λ = j D n Tr ρ n E n,j = p n,j j D n j D n p n,j e nλs p s n,j s n,j e nλs j p +s n,j s n,j e nλs Tr (ρ n ) +s (σ n ) s, where we used the monotonicity of the uantum f-divergence [8] for an operator convex function f(u) = u s (0 s ) (see e.g. [9], p.23). Therefore, we have and hence, Tr ρ n X n,λ exp [ n{λs ψ(s)}], Tr ρ n X n,λ e nϕ(λ), by taking the maximum. Now, from (5), the theorem is proved as follows: α n (A n ) = Tr ρ n A n Tr (ρ n e nλ σ n )X n,λ + e nλ Tr σ n A n Tr ρ n X n,λ + e nλ Tr σ n A n e nϕ(λ) + e nλ β n (A n ). 3 The Quantum Stein s Lemma Theorem 2 For any 0 ε <, it holds that lim n log β n(ε) = D(ρ σ). (0)
5 Proof: From () by Hiai and Petz, we have only to show that lim inf n log β n (ε) D(ρ σ). () Let A n be an arbitrary test which satisfies α n (A n ) ε. From (6), we have and hence, By taking the minimum, we obtain ε α n (A n ) e nϕ(λ) + e nλ β n (A n ), β n (A n ) e nλ ( ε e nϕ(λ) ). β n(ε) e nλ ( ε e nϕ(λ) ). (2) Now, let λ = D(ρ σ) + δ (δ > 0), then ϕ(λ) > 0 and ε e nϕ(λ) > 0 for sufficiently large n. Thus, (2) yields and hence, n log β n (ε) λ + n log( ε e nϕ(λ) ), lim inf n log β n (ε) D(ρ σ) δ. Since δ > 0 is arbitrary, the theorem has been proved. 4 Strong Converse Theorem 3 For any test A n, if then lim sup lim sup n log β n(a n ) r, (3) n log( α n(a n )) ϕ(λ ), (4) where λ is a real number which satisfies ϕ(λ ) = r λ. Moreover, ϕ(λ ) is represented as { s ϕ(λ ) = max 0 s + s r } + s ψ(s). (5) Proof: For all δ > 0, there exists n 0 such that β n (A n ) e n(r δ), n n 0,
6 from (3). Putting λ = λ in (6), we have and hence, α n (A n ) e nϕ(λ ) + e n(r λ δ), n n 0, lim sup n log( α n(a n )) ϕ(λ ) + δ. Since δ > 0 is arbitrary, (4) has been proved. To show (5), suppose that ψ (0) r 2ψ () ψ() firstly (see Fig. 2), and s attains the maximum in the euation u(r) = ϕ(λ ) = max 0 s {sλ ψ(s)} = r λ. Then, taking (9) into account, u(r) is represented parametrically as u(r) = s ψ (s ) ψ(s ), (6) where, r = (s + )ψ (s ) ψ(s ). (7) By using (7) to eliminate ψ (s ) from (6), we have On the other hand, let then we have g (s) = u(r) = s s + r s + ψ(s ). g(s) = s s + r s + ψ(s), (s + ) 2 {r + ψ(s) ( + s)ψ (s)}. To examine the sign of g (s), put h(s) = r + ψ(s) ( + s)ψ (s), and we have h (s) = ( + s)ψ (s) 0, which indicates that the sign of g (s) changes at most once. Therefore g(s) takes its maximum at s = ŝ if and only if r + ψ(ŝ) ( + ŝ)ψ (ŝ) = 0. This is nothing but the condition (7), and hence, we obtain u(r) = max 0 s g(s). In the other cases, it is clear that and ϕ(λ ) = 2 r ψ() = g() = max 2 g(s), if r 0 s 2ψ () ψ(), ϕ(λ ) = 0 = g(0) = max 0 s g(s), if r ψ (0).
7 It should be noted that (5) corresponds to the representation which Blahut [5] derived, in the classical hypothesis testing (i.e., when ρ and σ commute), concerning the power exponent for α n (A n ) when r < D(ρ σ). We can easily see that if r > D(ρ σ) then ϕ(λ ) > 0 (see Fig. 2). Hence, the following corollary holds. Corollary For any test A n, if lim sup then α n (A n ) goes to one exponentially. n log β n(a n ) < D(ρ σ), (8) 5 Relation with the Classical Hypothesis Testing In this section, we discuss the relation between ϕ(λ ) and the power exponent derived by Han and Kobayashi [6] in the classical hypothesis testing. Let p and be probability distributions on a finite set X, a null hypothesis and an alternative hypothesis respectively. And ine α n (A n ) = p n (A c n) and β n (A n ) = n (A n ), where p n and n are the i.i.d. extensions of p and, and A n X n is an acceptance region of p n. Blahut [5] proved that if β n (A n ) e nr (r > D(p )) then α n (A n ) tends to one as n for all A n X n. Although Blahut showed that α n (A n ) converges at one in the polynomial order, Han and Kobayashi [6] proved a stronger result. Putting α n(r) = min{α n (A n ) A n X n, β n (A n ) e nr }, they derived the power exponent for α n(r), namely, they proved where lim inf n log( α n (r)) = ũ(r), (9) ũ(r) = min {D(ˆp p) + r D(ˆp )}. (20) ˆp:D(ˆp ) r As remarked in Han and Kobayashi [6], when r > D(p ) is not so large, the minimum of (20) is attained with euality, which we suppose here. Applying the method used in Appendix, (20) is rewritten as ũ(r) = max s 0 s + s r + s log j X p +s j Moreover, when r > D(p ) is sufficiently small, (2) yields which corresponds to (5). s ũ(r) = max 0 s + s r + s log j X p +s j j s. (2) j s,
8 It is interesting to observe that in the uantum case we have where we put min ˆρ:D(ˆρ σ) r {D(ˆρ ρ) + r D(ˆρ σ)} = max s 0 ψ(s) = log Tr e (+s) log ρ s log σ. { s + s r + s ψ(s) }, By the Golden-Thompson ineuality (see e.g. [9], p.26), we can see that ψ(s) ψ(s) and the euality holds if and only if ρ and σ commute. Thus, we have 6 Concluding Remarks min {D(ˆρ ρ) + r D(ˆρ σ)} ˆρ:D(ˆρ σ) r ϕ(λ ). (22) So far we have shown the fundamental ineuality, and seen that the uantum Stein s lemma and the strong converse in the uantum hypothesis testing are obtained as applications of the ineuality. In the classical hypothesis testing, ũ(r) is shown to be the optimal exponent. However, whether ϕ(λ ) in the uantum hypothesis testing is optimal or not is left open. Appendix We show (2) for readers convenience. Here, we will derive (2) by the information geometrical method (see e.g., [0]), although (2) can be shown by using the Lagrange multiplier method as given in [5]. Suppose that r > D(p ) is not so large that there exists a probability distribution of the form: where, p(s) j = e ψ(s) p +s ψ(s) = log j X j s j, (j X, s > 0), p +s j j s, such that D(p(s) ) = r. Note that [ ψ (s) = E p(s) log p ] = η(s), ψ (s) = E p(s) (log p ) 2 η(s) > 0. Firstly, we will show that for all probability distribution ˆp it holds that D(ˆp ) = D(p(s) ) = D(ˆp p) D(p(s) p). (23) To this end, suppose that there exists a probability distribution ˆp which satisfies D(ˆp ) = D(p(s) ) and [ E p(s) log p ] [ < Eˆp log p ].
9 Then, we have D(ˆp ) = D(ˆp p(s)) + D(p(s) ) + j X(ˆp j p(s) j )(log p(s) j log j ) = D(ˆp p(s)) + D(p(s) ) + j X(ˆp ( j p(s) j ) ( + s) log p ) j ψ(s) j = D(ˆp p(s)) + D(p(s) ) + ( + s) > D(p(s) ), (Eˆp [ log p ] E p(s) [ log p which contradicts with the assumption. Therefore, for all probability distribution with D(ˆp ) = D(p(s) ), we have [ E p(s) log p ] [ Eˆp log p ], and hence, there exists t s such that [ E p(t) log p ] [ = Eˆp log p ], (24) since η(s) is continuous and monotone increasing. Now, from (24) and the Pythagorean relation for the Kullback-Leibler divergence we have D(ˆp ) = D(ˆp p(t)) + D(p(t) ) ]) = D(p(s) ). (25) Using the Pythagorean relation one more times and from (25), (23) is proved as follows: D(ˆp p) D(p(s) p) = D(ˆp p(t)) + D(p(t) p) D(p(s) p) = D(p(s) ) D(p(t) ) + D(p(t) p) D(p(s) p) = {D(p(s) ) D(p(s) p)} {D(p(t) ) D(p(t) p)} = η(s) η(t) 0. Now, taking (23) into account, (20) is represented as ũ(r) = min {D(p(s) p) + r D(p(s) )} s:d(p(s) ) r = min {r η(s)}. (26) s:d(p(s) ) r Here, we can see that d(s) = D(p(s) ) is a monotone increasing function of s, which is verified by d (s) = ( + s) ψ (s) > 0. Thus, the minimum of (26) is attained with euality, and ũ(r) is represented parametrically as where, ũ(r) = D(p(s) p) = s η(s) ψ(s), r = D(p(s) ) = ( + s)η(s) ψ(s). This representation corresponds to (6) (7) and we obtain (2) by following the same procedure as the proof of Theorem 3.
10 Acknowledgment The authors wish to thank Prof. Fumio Hiai for his helpful comments. They are also grateful to Prof. Te Sun Han for his suggestion for the strong converse in the uantum hypothesis testing. References [] F. Hiai and D. Petz, The proper formula for relative entropy and its asymptotics in uantum probability, Commun. Math. Phys., vol. 43, pp. 99 4, 99. [2] G. Lindblad, Completely positive maps and entropy ineualities, Commun. Math. Phys., vol. 40, pp. 47 5, 975. [3] A. Uhlmann, Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory, Commun. Math. Phys., vol. 54, pp. 2 32, 997. [4] R. E. Blahut, Principles and Practice of Information Theory, Addison-Wesley, Massachusetts, 99. [5] R. E. Blahut, Hypothesis testing and information theory, IEEE Trans. Inform. Theory, vol. IT-20, pp , 974. [6] T. S. Han and K. Kobayashi, The strong converse theorem for hypothesis testing, IEEE Trans. Inform. Theory, vol. IT-35, pp , 989. [7] C. W. Helstrom, Quantum Detection and Estimation Theory, Academic Press, New York, 976. [8] D. Petz, Quasi-entropies for finite uantum systems, Rep. Math. Phys., vol. 23, pp , 986. [9] R. Bhatia, Matrix Analysis, Springer, New York, 997. [0] S. Amari, Differential-Geometrical Methods in Statistics, Springer, New York, 985.
11 ψ(s) λs ϕ(λ) D(ρ σ) s 0 s Figure : The graph of ψ(s)
12 2ψ () ψ() r ϕ(λ) D(ρ σ) r λ ϕ(λ ) = r λ 0 D(ρ σ) λ ψ () 2ψ () ψ() λ Figure 2: The graph of ϕ(λ)
Correlation Detection and an Operational Interpretation of the Rényi Mutual Information
Correlation Detection and an Operational Interpretation of the Rényi Mutual Information Masahito Hayashi 1, Marco Tomamichel 2 1 Graduate School of Mathematics, Nagoya University, and Centre for Quantum
More informationDifferent quantum f-divergences and the reversibility of quantum operations
Different quantum f-divergences and the reversibility of quantum operations Fumio Hiai Tohoku University 2016, September (at Budapest) Joint work with Milán Mosonyi 1 1 F.H. and M. Mosonyi, Different quantum
More informationMultivariate Trace Inequalities
Multivariate Trace Inequalities Mario Berta arxiv:1604.03023 with Sutter and Tomamichel (to appear in CMP) arxiv:1512.02615 with Fawzi and Tomamichel QMath13 - October 8, 2016 Mario Berta (Caltech) Multivariate
More informationExtremal properties of the variance and the quantum Fisher information; Phys. Rev. A 87, (2013).
1 / 24 Extremal properties of the variance and the quantum Fisher information; Phys. Rev. A 87, 032324 (2013). G. Tóth 1,2,3 and D. Petz 4,5 1 Theoretical Physics, University of the Basque Country UPV/EHU,
More informationEECS 750. Hypothesis Testing with Communication Constraints
EECS 750 Hypothesis Testing with Communication Constraints Name: Dinesh Krithivasan Abstract In this report, we study a modification of the classical statistical problem of bivariate hypothesis testing.
More informationUniversal recoverability in quantum information theory
Universal recoverability in quantum information theory Mark M. Wilde Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State
More informationOn Composite Quantum Hypothesis Testing
University of York 7 November 207 On Composite Quantum Hypothesis Testing Mario Berta Department of Computing with Fernando Brandão and Christoph Hirche arxiv:709.07268 Overview Introduction 2 Composite
More informationRecoverability in quantum information theory
Recoverability in quantum information theory Mark M. Wilde Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State University,
More informationDISCRIMINATING two distributions is treated as a fundamental problem in the field of statistical inference. This problem
Discrimination of two channels by adaptive methods and its application to quantum system Masahito Hayashi 1 arxiv:0804.0686v1 [quant-ph] 4 Apr 2008 Abstract The optimal exponential error rate for adaptive
More informationQuantum Stein s Lemma. July 2, 2015
Quantum Stein s Lemma July 2, 205 Contents Introduction 3. Motivation............................................. 3.2 Histrical Remark......................................... 5 2 Quantum Stein s Lemma
More informationInformation Theory and Hypothesis Testing
Summer School on Game Theory and Telecommunications Campione, 7-12 September, 2014 Information Theory and Hypothesis Testing Mauro Barni University of Siena September 8 Review of some basic results linking
More informationBanach Journal of Mathematical Analysis ISSN: (electronic)
Banach J Math Anal (009), no, 64 76 Banach Journal of Mathematical Analysis ISSN: 75-8787 (electronic) http://wwwmath-analysisorg ON A GEOMETRIC PROPERTY OF POSITIVE DEFINITE MATRICES CONE MASATOSHI ITO,
More informationHypothesis Testing with Communication Constraints
Hypothesis Testing with Communication Constraints Dinesh Krithivasan EECS 750 April 17, 2006 Dinesh Krithivasan (EECS 750) Hyp. testing with comm. constraints April 17, 2006 1 / 21 Presentation Outline
More informationLecture 8: Information Theory and Statistics
Lecture 8: Information Theory and Statistics Part II: Hypothesis Testing and Estimation I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw December 22, 2015
More informationCONVEX FUNCTIONS AND MATRICES. Silvestru Sever Dragomir
Korean J. Math. 6 (018), No. 3, pp. 349 371 https://doi.org/10.11568/kjm.018.6.3.349 INEQUALITIES FOR QUANTUM f-divergence OF CONVEX FUNCTIONS AND MATRICES Silvestru Sever Dragomir Abstract. Some inequalities
More informationA Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks Marco Tomamichel, Masahito Hayashi arxiv: 1208.1478 Also discussing results of: Second Order Asymptotics for Quantum
More information6.1 Main properties of Shannon entropy. Let X be a random variable taking values x in some alphabet with probabilities.
Chapter 6 Quantum entropy There is a notion of entropy which quantifies the amount of uncertainty contained in an ensemble of Qbits. This is the von Neumann entropy that we introduce in this chapter. In
More informationLecture 8: Information Theory and Statistics
Lecture 8: Information Theory and Statistics Part II: Hypothesis Testing and I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw December 23, 2015 1 / 50 I-Hsiang
More informationCOMMUTATIVITY OF OPERATORS
COMMUTATIVITY OF OPERATORS MASARU NAGISA, MAKOTO UEDA, AND SHUHEI WADA Abstract. For two bounded positive linear operators a, b on a Hilbert space, we give conditions which imply the commutativity of a,
More informationMean-field equations for higher-order quantum statistical models : an information geometric approach
Mean-field equations for higher-order quantum statistical models : an information geometric approach N Yapage Department of Mathematics University of Ruhuna, Matara Sri Lanka. arxiv:1202.5726v1 [quant-ph]
More informationMultivariate trace inequalities. David Sutter, Mario Berta, Marco Tomamichel
Multivariate trace inequalities David Sutter, Mario Berta, Marco Tomamichel What are trace inequalities and why we should care. Main difference between classical and quantum world are complementarity and
More informationOpen Questions in Quantum Information Geometry
Open Questions in Quantum Information Geometry M. R. Grasselli Department of Mathematics and Statistics McMaster University Imperial College, June 15, 2005 1. Classical Parametric Information Geometry
More informationQuantum Stein s lemma revisited, inequalities for quantum entropies, and a concavity theorem of Lieb
Quantum Stein s lemma revisited, inequalities for quantum entropies, and a concavity theorem of Lieb Igor Bjelaković and Rainer Siegmund-Schultze 2 Technische Universität München, Theoretische Informationstechnik,
More informationConvexity/Concavity of Renyi Entropy and α-mutual Information
Convexity/Concavity of Renyi Entropy and -Mutual Information Siu-Wai Ho Institute for Telecommunications Research University of South Australia Adelaide, SA 5095, Australia Email: siuwai.ho@unisa.edu.au
More informationNullity of Measurement-induced Nonlocality. Yu Guo
Jul. 18-22, 2011, at Taiyuan. Nullity of Measurement-induced Nonlocality Yu Guo (Joint work with Pro. Jinchuan Hou) 1 1 27 Department of Mathematics Shanxi Datong University Datong, China guoyu3@yahoo.com.cn
More informationLecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016
Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 1 Entropy Since this course is about entropy maximization,
More informationGeneralized Neyman Pearson optimality of empirical likelihood for testing parameter hypotheses
Ann Inst Stat Math (2009) 61:773 787 DOI 10.1007/s10463-008-0172-6 Generalized Neyman Pearson optimality of empirical likelihood for testing parameter hypotheses Taisuke Otsu Received: 1 June 2007 / Revised:
More informationOn asymmetric quantum hypothesis testing
On asymmetric quantum hypothesis testing JMP, Vol 57, 6, 10.1063/1.4953582 arxiv:1612.01464 Cambyse Rouzé (Cambridge) Joint with Nilanjana Datta (University of Cambridge) and Yan Pautrat (Paris-Saclay)
More informationPerformance of the Neyman-Pearson Receiver for a Binary Thermal. Coherent State Signal
ISSN 86-6570 Performance of the Neyman-Pearson Receiver for a Binary Thermal Coherent State Signal Kentaro Kato Quantum ICT Research Institute, Tamagawa University 6-- Tamagawa-gakuen, Machida, Tokyo 94-860,
More informationArimoto Channel Coding Converse and Rényi Divergence
Arimoto Channel Coding Converse and Rényi Divergence Yury Polyanskiy and Sergio Verdú Abstract Arimoto proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code
More information40.530: Statistics. Professor Chen Zehua. Singapore University of Design and Technology
Singapore University of Design and Technology Lecture 9: Hypothesis testing, uniformly most powerful tests. The Neyman-Pearson framework Let P be the family of distributions of concern. The Neyman-Pearson
More informationGeneral formulas for capacity of classical-quantum channels
General formulas for capacity of classical-quantum channels arxiv:quant-ph/020686v4 28 Feb 2003 Masahito Hayashi Hiroshi Nagaoka Abstract The capacity of a classical-quantum channel (or in other words
More informationQuantum Statistics -First Steps
Quantum Statistics -First Steps Michael Nussbaum 1 November 30, 2007 Abstract We will try an elementary introduction to quantum probability and statistics, bypassing the physics in a rapid first glance.
More informationarxiv: v1 [quant-ph] 31 Aug 2007
arxiv:0708.4282v1 [quant-ph] 31 Aug 2007 Asymptotic Error Rates in Quantum Hypothesis Testing K.M.R. Audenaert 1,2, M. Nussbaum 3, A. Szkoła 4, F. Verstraete 5 1 Institute for Mathematical Sciences, Imperial
More informationShunlong Luo. Academy of Mathematics and Systems Science Chinese Academy of Sciences
Superadditivity of Fisher Information: Classical vs. Quantum Shunlong Luo Academy of Mathematics and Systems Science Chinese Academy of Sciences luosl@amt.ac.cn Information Geometry and its Applications
More informationMultiplicativity of Maximal p Norms in Werner Holevo Channels for 1 < p 2
Multiplicativity of Maximal p Norms in Werner Holevo Channels for 1 < p 2 arxiv:quant-ph/0410063v1 8 Oct 2004 Nilanjana Datta Statistical Laboratory Centre for Mathematical Sciences University of Cambridge
More informationAttempting to reverse the irreversible in quantum physics
Attempting to reverse the irreversible in quantum physics Mark M. Wilde Hearne Institute for Theoretical Physics, Department of Physics and Astronomy, Center for Computation and Technology, Louisiana State
More informationConverse bounds for private communication over quantum channels
Converse bounds for private communication over quantum channels Mark M. Wilde (LSU) joint work with Mario Berta (Caltech) and Marco Tomamichel ( Univ. Sydney + Univ. of Technology, Sydney ) arxiv:1602.08898
More informationQuantum Fisher information and entanglement
1 / 70 Quantum Fisher information and entanglement G. Tóth 1,2,3 1 Theoretical Physics, University of the Basque Country (UPV/EHU), Bilbao, Spain 2 IKERBASQUE, Basque Foundation for Science, Bilbao, Spain
More information4. Algebra and Duality
4-1 Algebra and Duality P. Parrilo and S. Lall, CDC 2003 2003.12.07.01 4. Algebra and Duality Example: non-convex polynomial optimization Weak duality and duality gap The dual is not intrinsic The cone
More informationChapter 2 Exponential Families and Mixture Families of Probability Distributions
Chapter 2 Exponential Families and Mixture Families of Probability Distributions The present chapter studies the geometry of the exponential family of probability distributions. It is not only a typical
More informationDiscussion of Hypothesis testing by convex optimization
Electronic Journal of Statistics Vol. 9 (2015) 1 6 ISSN: 1935-7524 DOI: 10.1214/15-EJS990 Discussion of Hypothesis testing by convex optimization Fabienne Comte, Céline Duval and Valentine Genon-Catalot
More informationLecture 22: Error exponents in hypothesis testing, GLRT
10-704: Information Processing and Learning Spring 2012 Lecture 22: Error exponents in hypothesis testing, GLRT Lecturer: Aarti Singh Scribe: Aarti Singh Disclaimer: These notes have not been subjected
More informationLarge Deviations Performance of Knuth-Yao algorithm for Random Number Generation
Large Deviations Performance of Knuth-Yao algorithm for Random Number Generation Akisato KIMURA akisato@ss.titech.ac.jp Tomohiko UYEMATSU uematsu@ss.titech.ac.jp April 2, 999 No. AK-TR-999-02 Abstract
More informationFinding a Needle in a Haystack: Conditions for Reliable. Detection in the Presence of Clutter
Finding a eedle in a Haystack: Conditions for Reliable Detection in the Presence of Clutter Bruno Jedynak and Damianos Karakos October 23, 2006 Abstract We study conditions for the detection of an -length
More informationMonotonicity of quantum relative entropy revisited
Monotonicity of quantum relative entropy revisited This paper is dedicated to Elliott Lieb and Huzihiro Araki on the occasion of their 70th birthday arxiv:quant-ph/0209053v1 6 Sep 2002 Dénes Petz 1 Department
More informationA NOTE ON SUMS OF INDEPENDENT RANDOM MATRICES AFTER AHLSWEDE-WINTER
A NOTE ON SUMS OF INDEPENDENT RANDOM MATRICES AFTER AHLSWEDE-WINTER 1. The method Ashwelde and Winter [1] proposed a new approach to deviation inequalities for sums of independent random matrices. The
More informationLegendre-Fenchel transforms in a nutshell
1 2 3 Legendre-Fenchel transforms in a nutshell Hugo Touchette School of Mathematical Sciences, Queen Mary, University of London, London E1 4NS, UK Started: July 11, 2005; last compiled: August 14, 2007
More informationA Holevo-type bound for a Hilbert Schmidt distance measure
Journal of Quantum Information Science, 205, *,** Published Online **** 204 in SciRes. http://www.scirp.org/journal/**** http://dx.doi.org/0.4236/****.204.***** A Holevo-type bound for a Hilbert Schmidt
More informationOn Improved Bounds for Probability Metrics and f- Divergences
IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES On Improved Bounds for Probability Metrics and f- Divergences Igal Sason CCIT Report #855 March 014 Electronics Computers Communications
More informationInformation geometry of sandwiched Rényi α-divergence
Information geometry of sandwiched Rényi -divergence Kaito Takahashi and Akio Fujiwara Department of Mathematics, Osaka University Toyonaka, Osaka 56-43, Japan Abstract Information geometrical structure
More informationMAPS ON DENSITY OPERATORS PRESERVING
MAPS ON DENSITY OPERATORS PRESERVING QUANTUM f-divergences LAJOS MOLNÁR, GERGŐ NAGY AND PATRÍCIA SZOKOL Abstract. For an arbitrary strictly convex function f defined on the non-negative real line we determine
More informationError Exponents of Quantum Communication System with M-ary. PSK Coherent State Signal
ISSN 2186-6570 Error Exponents of Quantum Communication System with -ary PSK Coherent State Signal Kentaro Kato Quantum ICT Research Institute, Tamagawa University 6-1-1 Tamagawa-gakuen, achida, Tokyo
More informationThe Pacic Institute for the Mathematical Sciences http://www.pims.math.ca pims@pims.math.ca Surprise Maximization D. Borwein Department of Mathematics University of Western Ontario London, Ontario, Canada
More informationInformation geometry of Bayesian statistics
Information geometry of Bayesian statistics Hiroshi Matsuzoe Department of Computer Science and Engineering, Graduate School of Engineering, Nagoya Institute of Technology, Nagoya 466-8555, Japan Abstract.
More informationAn upper bound on l q norms of noisy functions
Electronic Collouium on Computational Complexity, Report No. 68 08 An upper bound on l norms of noisy functions Alex Samorodnitsky Abstract Let T ɛ, 0 ɛ /, be the noise operator acting on functions on
More informationNorm inequalities related to the matrix geometric mean
isid/ms/2012/07 April 20, 2012 http://www.isid.ac.in/ statmath/eprints Norm inequalities related to the matrix geometric mean RAJENDRA BHATIA PRIYANKA GROVER Indian Statistical Institute, Delhi Centre
More informationQuiz 2 Date: Monday, November 21, 2016
10-704 Information Processing and Learning Fall 2016 Quiz 2 Date: Monday, November 21, 2016 Name: Andrew ID: Department: Guidelines: 1. PLEASE DO NOT TURN THIS PAGE UNTIL INSTRUCTED. 2. Write your name,
More informationOperational capacity and pseudoclassicality of a quantum channel
Operational capacity and pseudoclassicality of a quantum channel Akio Fujiwara and Hiroshi Nagaoka Abstract We explore some basic properties of coding theory of a general quantum communication channel
More informationLaw of Cosines and Shannon-Pythagorean Theorem for Quantum Information
In Geometric Science of Information, 2013, Paris. Law of Cosines and Shannon-Pythagorean Theorem for Quantum Information Roman V. Belavkin 1 School of Engineering and Information Sciences Middlesex University,
More informationArimoto-Rényi Conditional Entropy. and Bayesian M-ary Hypothesis Testing. Abstract
Arimoto-Rényi Conditional Entropy and Bayesian M-ary Hypothesis Testing Igal Sason Sergio Verdú Abstract This paper gives upper and lower bounds on the minimum error probability of Bayesian M-ary hypothesis
More informationEntropy, Inference, and Channel Coding
Entropy, Inference, and Channel Coding Sean Meyn Department of Electrical and Computer Engineering University of Illinois and the Coordinated Science Laboratory NSF support: ECS 02-17836, ITR 00-85929
More informationarxiv: v2 [quant-ph] 2 Oct 2016
Regularized Boltzmann entropy determines macroscopic adiabatic accessibility Hiroyasu Tajima and Eyuri Wakakuwa 2 Center for Emergent Matter Science (CEMS), RIKEN, Wako, Saitama 35-098 Japan 2 Graduate
More informationStability of local observables
Stability of local observables in closed and open quantum systems Angelo Lucia anlucia@ucm.es Universidad Complutense de Madrid NSF/CBMS Conference Quantum Spin Systems UAB, June 20, 2014 A. Lucia (UCM)
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationINFORMATION THEORY AND STATISTICS
CHAPTER INFORMATION THEORY AND STATISTICS We now explore the relationship between information theory and statistics. We begin by describing the method of types, which is a powerful technique in large deviation
More informationhere, this space is in fact infinite-dimensional, so t σ ess. Exercise Let T B(H) be a self-adjoint operator on an infinitedimensional
15. Perturbations by compact operators In this chapter, we study the stability (or lack thereof) of various spectral properties under small perturbations. Here s the type of situation we have in mind:
More information2. reverse inequalities via specht ratio To study the Golden-Thompson inequality, Ando-Hiai in [1] developed the following log-majorizationes:
ON REVERSES OF THE GOLDEN-THOMPSON TYPE INEQUALITIES MOHAMMAD BAGHER GHAEMI, VENUS KALEIBARY AND SHIGERU FURUICHI arxiv:1708.05951v1 [math.fa] 20 Aug 2017 Abstract. In this paper we present some reverses
More informationLecture 19 October 28, 2015
PHYS 7895: Quantum Information Theory Fall 2015 Prof. Mark M. Wilde Lecture 19 October 28, 2015 Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
More information( 1 k "information" I(X;Y) given by Y about X)
SUMMARY OF SHANNON DISTORTION-RATE THEORY Consider a stationary source X with f (x) as its th-order pdf. Recall the following OPTA function definitions: δ(,r) = least dist'n of -dim'l fixed-rate VQ's w.
More informationMODULUS OF CONTINUITY OF THE DIRICHLET SOLUTIONS
MODULUS OF CONTINUITY OF THE DIRICHLET SOLUTIONS HIROAKI AIKAWA Abstract. Let D be a bounded domain in R n with n 2. For a function f on D we denote by H D f the Dirichlet solution, for the Laplacian,
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 EXERCISES FROM CHAPTER 1 Homework #1 Solutions The following version of the
More informationInformation measures in simple coding problems
Part I Information measures in simple coding problems in this web service in this web service Source coding and hypothesis testing; information measures A(discrete)source is a sequence {X i } i= of random
More informationC.7. Numerical series. Pag. 147 Proof of the converging criteria for series. Theorem 5.29 (Comparison test) Let a k and b k be positive-term series
C.7 Numerical series Pag. 147 Proof of the converging criteria for series Theorem 5.29 (Comparison test) Let and be positive-term series such that 0, for any k 0. i) If the series converges, then also
More informationNecessary and Sufficient Conditions for High-Dimensional Salient Feature Subset Recovery
Necessary and Sufficient Conditions for High-Dimensional Salient Feature Subset Recovery Vincent Tan, Matt Johnson, Alan S. Willsky Stochastic Systems Group, Laboratory for Information and Decision Systems,
More informationarxiv: v2 [cs.it] 10 Apr 2017
Divergence and Sufficiency for Convex Optimization Peter Harremoës April 11, 2017 arxiv:1701.01010v2 [cs.it] 10 Apr 2017 Abstract Logarithmic score and information divergence appear in information theory,
More informationInformation geometry of the power inverse Gaussian distribution
Information geometry of the power inverse Gaussian distribution Zhenning Zhang, Huafei Sun and Fengwei Zhong Abstract. The power inverse Gaussian distribution is a common distribution in reliability analysis
More informationAN EFFECTIVE METRIC ON C(H, K) WITH NORMAL STRUCTURE. Mona Nabiei (Received 23 June, 2015)
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 46 (2016), 53-64 AN EFFECTIVE METRIC ON C(H, K) WITH NORMAL STRUCTURE Mona Nabiei (Received 23 June, 2015) Abstract. This study first defines a new metric with
More informationAN AFFINE EMBEDDING OF THE GAMMA MANIFOLD
AN AFFINE EMBEDDING OF THE GAMMA MANIFOLD C.T.J. DODSON AND HIROSHI MATSUZOE Abstract. For the space of gamma distributions with Fisher metric and exponential connections, natural coordinate systems, potential
More informationarxiv: v2 [math.ag] 24 Jun 2015
TRIANGULATIONS OF MONOTONE FAMILIES I: TWO-DIMENSIONAL FAMILIES arxiv:1402.0460v2 [math.ag] 24 Jun 2015 SAUGATA BASU, ANDREI GABRIELOV, AND NICOLAI VOROBJOV Abstract. Let K R n be a compact definable set
More informationQuantum Fisher Information. Shunlong Luo Beijing, Aug , 2006
Quantum Fisher Information Shunlong Luo luosl@amt.ac.cn Beijing, Aug. 10-12, 2006 Outline 1. Classical Fisher Information 2. Quantum Fisher Information, Logarithm 3. Quantum Fisher Information, Square
More informationIntermittent Communication
Intermittent Communication Mostafa Khoshnevisan, Student Member, IEEE, and J. Nicholas Laneman, Senior Member, IEEE arxiv:32.42v2 [cs.it] 7 Mar 207 Abstract We formulate a model for intermittent communication
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 3, MARCH
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 57, NO 3, MARCH 2011 1587 Universal and Composite Hypothesis Testing via Mismatched Divergence Jayakrishnan Unnikrishnan, Member, IEEE, Dayu Huang, Student
More informationTHE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS
J. Appl. Math. & Computing Vol. 4(2004), No. - 2, pp. 277-288 THE SET OF RECURRENT POINTS OF A CONTINUOUS SELF-MAP ON AN INTERVAL AND STRONG CHAOS LIDONG WANG, GONGFU LIAO, ZHENYAN CHU AND XIAODONG DUAN
More informationNonlinear Programming Algorithms Handout
Nonlinear Programming Algorithms Handout Michael C. Ferris Computer Sciences Department University of Wisconsin Madison, Wisconsin 5376 September 9 1 Eigenvalues The eigenvalues of a matrix A C n n are
More informationUncertainty. Jayakrishnan Unnikrishnan. CSL June PhD Defense ECE Department
Decision-Making under Statistical Uncertainty Jayakrishnan Unnikrishnan PhD Defense ECE Department University of Illinois at Urbana-Champaign CSL 141 12 June 2010 Statistical Decision-Making Relevant in
More informationLecture 4 Lebesgue spaces and inequalities
Lecture 4: Lebesgue spaces and inequalities 1 of 10 Course: Theory of Probability I Term: Fall 2013 Instructor: Gordan Zitkovic Lecture 4 Lebesgue spaces and inequalities Lebesgue spaces We have seen how
More informationLecture 7 Introduction to Statistical Decision Theory
Lecture 7 Introduction to Statistical Decision Theory I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw December 20, 2016 1 / 55 I-Hsiang Wang IT Lecture 7
More informationLecture 4 Noisy Channel Coding
Lecture 4 Noisy Channel Coding I-Hsiang Wang Department of Electrical Engineering National Taiwan University ihwang@ntu.edu.tw October 9, 2015 1 / 56 I-Hsiang Wang IT Lecture 4 The Channel Coding Problem
More informationThe Yau-Tian-Donaldson Conjectuture for general polarizations
The Yau-Tian-Donaldson Conjectuture for general polarizations Toshiki Mabuchi, Osaka University 2015 Taipei Conference on Complex Geometry December 22, 2015 1. Introduction 2. Background materials Table
More informationf-divergence Estimation and Two-Sample Homogeneity Test under Semiparametric Density-Ratio Models
IEEE Transactions on Information Theory, vol.58, no.2, pp.708 720, 2012. 1 f-divergence Estimation and Two-Sample Homogeneity Test under Semiparametric Density-Ratio Models Takafumi Kanamori Nagoya University,
More informationLatent voter model on random regular graphs
Latent voter model on random regular graphs Shirshendu Chatterjee Cornell University (visiting Duke U.) Work in progress with Rick Durrett April 25, 2011 Outline Definition of voter model and duality with
More informationSpectral law of the sum of random matrices
Spectral law of the sum of random matrices Florent Benaych-Georges benaych@dma.ens.fr May 5, 2005 Abstract The spectral distribution of a matrix is the uniform distribution on its spectrum with multiplicity.
More informationAutomorphic Equivalence Within Gapped Phases
1 Harvard University May 18, 2011 Automorphic Equivalence Within Gapped Phases Robert Sims University of Arizona based on joint work with Sven Bachmann, Spyridon Michalakis, and Bruno Nachtergaele 2 Outline:
More informationA Note On Large Deviation Theory and Beyond
A Note On Large Deviation Theory and Beyond Jin Feng In this set of notes, we will develop and explain a whole mathematical theory which can be highly summarized through one simple observation ( ) lim
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. A Superharmonic Prior for the Autoregressive Process of the Second Order
MATHEMATICAL ENGINEERING TECHNICAL REPORTS A Superharmonic Prior for the Autoregressive Process of the Second Order Fuyuhiko TANAKA and Fumiyasu KOMAKI METR 2006 30 May 2006 DEPARTMENT OF MATHEMATICAL
More informationInformation Geometry
2015 Workshop on High-Dimensional Statistical Analysis Dec.11 (Friday) ~15 (Tuesday) Humanities and Social Sciences Center, Academia Sinica, Taiwan Information Geometry and Spontaneous Data Learning Shinto
More informationTheorem (4.11). Let M be a closed subspace of a Hilbert space H. For any x, y E, the parallelogram law applied to x/2 and y/2 gives.
Math 641 Lecture #19 4.11, 4.12, 4.13 Inner Products and Linear Functionals (Continued) Theorem (4.10). Every closed, convex set E in a Hilbert space H contains a unique element of smallest norm, i.e.,
More informationBrownian survival and Lifshitz tail in perturbed lattice disorder
Brownian survival and Lifshitz tail in perturbed lattice disorder Ryoki Fukushima Kyoto niversity Random Processes and Systems February 16, 2009 6 B T 1. Model ) ({B t t 0, P x : standard Brownian motion
More information