A Holevo-type bound for a Hilbert Schmidt distance measure

Similar documents
An Introduction to Quantum Computation and Quantum Information

Some Bipartite States Do Not Arise from Channels

Lecture: Quantum Information

Chapter 5. Density matrix formalism

Lecture 19 October 28, 2015

AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013

Entanglement Measures and Monotones Pt. 2

6.1 Main properties of Shannon entropy. Let X be a random variable taking values x in some alphabet with probabilities.

Lecture 11: Quantum Information III - Source Coding

Introduction to Quantum Information Hermann Kampermann

Lecture 4: Postulates of quantum mechanics

Multiplicativity of Maximal p Norms in Werner Holevo Channels for 1 < p 2

Entanglement Measures and Monotones

Quantum Achievability Proof via Collision Relative Entropy

Probabilistic exact cloning and probabilistic no-signalling. Abstract

Quantum Data Compression

Ph 219/CS 219. Exercises Due: Friday 3 November 2006

Quantum Information Types

arxiv: v1 [quant-ph] 3 Jan 2008

Ph 219/CS 219. Exercises Due: Friday 20 October 2006

Entanglement Manipulation

2. Introduction to quantum mechanics

9. Distance measures. 9.1 Classical information measures. Head Tail. How similar/close are two probability distributions? Trace distance.

Lecture 6: Quantum error correction and quantum capacity

QUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36

arxiv: v3 [quant-ph] 5 Jun 2015

Compression and entanglement, entanglement transformations

to mere bit flips) may affect the transmission.

Remarks on the Additivity Conjectures for Quantum Channels

5 Mutual Information and Channel Capacity

Quantum Entanglement and Measurement

Fidelity and Metrics of quantum states

Entanglement: concept, measures and open problems

Ensembles and incomplete information

Squashed entanglement

Valerio Cappellini. References

On the Relation between Quantum Discord and Purified Entanglement

arxiv: v2 [quant-ph] 26 Mar 2012

Structure of Unital Maps and the Asymptotic Quantum Birkhoff Conjecture. Peter Shor MIT Cambridge, MA Joint work with Anand Oza and Dimiter Ostrev

arxiv: v2 [quant-ph] 7 Apr 2014

1. Basic rules of quantum mechanics

Nullity of Measurement-induced Nonlocality. Yu Guo

Entropy in Classical and Quantum Information Theory

Homework 3 - Solutions

Introduction To Information Theory

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

Quantum Nonlocality Pt. 4: More on the CHSH Inequality

Problem Set: TT Quantum Information

Max-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig

arxiv: v3 [quant-ph] 17 Nov 2014

Entanglement: Definition, Purification and measures

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.

CS120, Quantum Cryptography, Fall 2016

Lecture 18: Quantum Information Theory and Holevo s Bound

Degradable Quantum Channels

Steering and Entropic Uncertainty Relations

Strong converse theorems using Rényi entropies

Capacity Estimates of TRO Channels

arxiv: v2 [quant-ph] 21 Oct 2013

Chapter 2 The Density Matrix

The Minimax Fidelity for Quantum Channels: Theory and Some Applications

Quantum Teleportation Pt. 1

Multipartite Monogamy of the Entanglement of Formation. Abstract

Maximal vectors in Hilbert space and quantum entanglement

CS/Ph120 Homework 4 Solutions

Introduction to Quantum Computing

Mixed-state sensitivity of several quantum-information benchmarks

Introduction to quantum information processing

Some applications of matrix inequalities in Rényi entropy

Quantum Hadamard channels (I)

Quantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar

Quantum Hadamard channels (II)

FRAMES IN QUANTUM AND CLASSICAL INFORMATION THEORY

On the power of unentangled measurements on two antiparallel spins

Bell inequality for qunits with binary measurements

Quantum metrology from a quantum information science perspective

CS286.2 Lecture 15: Tsirelson s characterization of XOR games

Basics on quantum information

Classical data compression with quantum side information

Gerardo Adesso. Davide Girolami. Alessio Serafini. University of Nottingham. University of Nottingham. University College London

Quantum Fisher Information. Shunlong Luo Beijing, Aug , 2006

arxiv: v1 [quant-ph] 17 Sep 2015

The Adaptive Classical Capacity of a Quantum Channel,

Entropic characterization of quantum operations

Asymptotic Pure State Transformations

arxiv: v2 [hep-th] 3 Jun 2018

Introduction to Information Theory. Uncertainty. Entropy. Surprisal. Joint entropy. Conditional entropy. Mutual information.

Dept. of Linguistics, Indiana University Fall 2015

Information measures, entanglement and quantum evolution

5. Communication resources

Mean-field equations for higher-order quantum statistical models : an information geometric approach

Semidefinite approximations of the matrix logarithm

Multivariate Trace Inequalities

A Course in Quantum Information Theory

Schur-Weyl duality, quantum data compression, tomography

Free probability and quantum information

Quantum-controlled measurement device for quantum-state discrimination

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS

On some special cases of the Entropy Photon-Number Inequality

Entanglement, mixedness, and spin-flip symmetry in multiple-qubit systems

Transcription:

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 distance measure arxiv:502.0469v3 [quant-ph] 2 Oct 205 Boaz Tamir, Eliahu Cohen 2 Faculty of interdisciplinary studies, Bar-Ilan University, Ramat-Gan, Israel Email: canjlm@actcom.co.il 2 School of Physics and Astronomy, Tel-Aviv University, Tel-Aviv, Israel Email: eliahuco@post.tau.ac.il, Received **/**/**** Copyright c 205 by authors and Scientific Research Publishing Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/ Abstract We prove a new version of the Holevo bound employing the Hilbert-Schmidt norm instead of the Kullback-Leibler divergence. Suppose Alice is sending classical information to Bob using a quantum channel, while Bob is performing some projective measurement. We bound the classical mutual information in terms of the Hilbert-Schmidt norm by its quantum Hilbert- Schmidt counterpart. This constitutes a Holevo-type upper bound on the classical information transmission rate via a quantum channel. The resulting inequality is rather natural and intuitive relating classical and quantum expressions using the same measure. Keywords Holevo bound; Hilbert-Schmidt norm; entanglement measures. Introduction and Motivation Holevo s theorem [] is one of the pillars of quantum information theory. It can be informally summarized as follows: It is not possible to communicate more than n classical bits of information by the transmission of n qubits alone. It therefore sets a useful upper bound on the classical information rate using quantum channel. SupposeAlicepreparesastateρ x insomesystemq,wherex X = {0,...,n}withprobabilitiesp(x). Bob performsameasurementdescribed by the POVMelements E Y = E 0,...,E m on that state, with measurement outcome Y. Let ρ = ρ Q = x p(x)ρ x. () How to cite this paper: B. Tamir and E. Cohen (205) A Holevo-type bound for a Hilbert Schmidt distance measure. Journal of Quantum Information Science,*,***-***

The Holevo Bound states that [2] H(X : Y) S(ρ) x p(x)s(ρ x ), (2) where S is the von Neumann entropy and H(X : Y) is the Shannon mutual information of X and Y. Recent proofs of the Holevo bound can be found in [3, 4]. Consider the following trace distance between two probability distributions p(x) and q(x) on X [5] We can extend the definition to density matrices ρ and σ d(p q) = (p(x) q(x)) 2. (3) 2 x d(ρ σ) = 2 tr(ρ σ)2, (4) where we use A 2 for A A. This is known as the Hilbert-Schmidt (HS) norm [6, 7, 8] (in fact this is one half of the HS norm). Recently, the above distance measure was coined the logical divergence of two densities [9]. We prove a Holevo-type upper bound on the mutual information of X and Y, where the mutual information is written this time in terms of the HS norm instead of the Kullback-Leibler divergence. It was recently suggested by Ellerman [9] that employing the HS norm in the formulation of classical mutual information is natural. This is consistent with the identification of information as a measure of distinction [9]. Note that employing the Kullback-Leibler divergence in the standard form of the Holevo bound gives an expression which can be identified with quantum mutual information, however the coherent information is considered a more appropriate expression (see also [2] chapter 2). In view of the above we hereby take Ellerman s idea a step further and write a Holevo-type bound based on the HS norm. The question whether d(ρ σ) is the right measure of quantum mutual information was discussed in [0], within the context of area laws. It was used there to provide an upper bound on the correlations between two distant operators M A and M B, where A is a region inside a spin grid and B is its complement: d(ρ A,B ρ A ρ B ) C(M A,M B ) 2 2 M A 2 M B 2, (5) where C(M A,M B ) = M A M B M A M B is the correlation function of M A and M B. In addition, the HS norm was suggested as an entanglement measure [7, ], however this was criticized in [2], claiming it does not fulfill the so called CP non-expansive property (i.e. non-increasing under every completely-positive trace-preserving map). In what follows we will prove a Holevo-type bound on the above HS distance between the probability p(x,y) on the product space (X,Y) and the product of its marginal probabilities p(x) p(y): where q d(x,y X Y) d(ρp,q ρ P ρ Q ), (6) ρ P,Q = x p(x) x x ρ x, (7) and where ρ Q = x p(x)ρ x, (8) ρ P = x p(x) x x (9) 2

are the partial traces of ρ P,Q, and q is the dimension of the space Q. Note that both sides of inequality 6 are measures of mutual information. Therefore, our claim is that the classical HS mutual information is bounded by the corresponding quantum one multiplied by the dimension of the quantum density matrices used in the channel. We will also show that where L(ρ Q ) and L(ρ P ) are the Tsallis entropies [3] q d(x,y X Y) 2 L(ρP )L(ρ Q ), (0) L(ρ) = tr(ρ( ρ)), () also known as the linear entropy, purity [4] or logical entropy of ρ [9]. All the above is proved for the case of projective measurements. However we expect similar results in the general case of POVM, in light of Naimark s dilation theorem (see [5] or [6] for instance). In the next section we review some basic properties of quantum logical divergence and then use these properties to demonstrate the new Holevo-type bound. 2. The HS norm and the Holevo-type bound Let d(ρ σ) = 2 tr(ρ σ)2. (2) In what follows we recall some basic properties of the HS distance measure, then we state and prove the main result of this paper. Theorem 2.: Contractivity of the HS norm with respect to projective measurements: Let ρ and σ be two density matrices of a system S. Let E(ρ) be the trace preserving operator E(ρ) = i P i ρp i, (3) where the projections P i satisfy i P i = I, P i = P i and P 2 i = P i for every i, then d(e(ρ) E(σ)) d(ρ σ). (4) Proof: We now write X = ρ σ. Then X is Hermitian with bounded spectrum, and using Lemma 2 in [7] we conclude that tr(eρ Eσ) 2 < tr(ρ σ) 2. (5) Theorem 2.2: The joint convexity of the HS norm The logical divergence d(ρ σ) is jointly convex. Proof: First observe that tr(ρ 2 ) is convex from the convexity of x 2 and the linearity of the trace. Next we can write d(λρ +( λ)ρ 2 λσ +( λ)σ 2 ) = (6) = 2 tr((λρ +( λ)ρ 2 ) (λσ +( λ)σ 2 )) 2 = = 2 tr(λ(ρ σ )+( λ)(ρ 2 σ 2 )) 2 λ 2 tr(ρ σ ) 2 + λ tr(ρ 2 σ 2 ) 2 = 2 = λd(ρ σ )+( λ)d(ρ 2 σ 2 ), 3

where the inequality is due to the convexity of tr(ρ 2 ). This constitute the joint convexity. Theorem 2.3: The monotonicity of the HS norm with respect to partial trace Let ρ A,B and σ A,B be two density matrices, then d(ρ A I/b σ A I/b) d(ρ A,B σ A,B ), (7) where b is the dimension of B. Proof: One can find a set of unitary matrices U j over B and a probability distribution p j such that ρ A I/b = j p j U j ρ A,B U j (8) σ A I/b = j p j U j σ A,B U j, (9) (see [2] chapter ). Now since d(ρ σ) is jointly convex on both densities, we can write d(ρ A I/b σ A I/b) j p j d(u j ρ A,B U j U jσ A,B U j ). (20) Observe now that the divergence is invariant under unitary conjugation, and therefore the sum in the right hand side of the above inequality is d(ρ A,B σ A,B ). We can now state the main result: Theorem 2.4: A Holevo-type bound for the HS trace distance between p(x,y) and p(x) p(y) Suppose Alice is using a distribution p(x), where x is in X = {,...,n}, to pick one of n densities ρ x in Q. She then sends the signal in a quantum physical channel to Bob. We can add an artificial quantum system P and write (P,Q) for Alice as: ρ P,Q = p(x) x x ρ x, (2) where the vectors x are orthogonal. Let ρ P and ρ Q be the partial traces of ρ P,Q. Suppose Bob is measuring the system using a projective measurement as in Theorem 2., then q d(x,y X Y) d(ρp,q ρ P ρ Q ), (22) where q is the dimension of the space Q. Proof: First we consider one more auxiliary quantum system, namely M for the measurement outcome for Bob. Initially the system M is in the state M 0 = 0 0. Let E be the operator defined by Bob s measurement as in Theorem 2. above: let {P y } y on Q be defined such that y P y = I and E(ρ x ) = y P y ρ x P y. (23) One can easily extend E to the space (Q,M) by E(ρ 0 0 ) = y P y ρp y y y. (24) This can be done by choosing a set of operators, conjugating 0 0 ) to y y ). It amounts to writing the measurement result in the space M (see also Ch. 2.. in [2]). If we now trace out Q we find tr Q E(ρ 0 0 ) = y p(y) y y. (25) 4

Moreover, E can be extended to ρ (P,Q,M) by ( ) E p(x) x x ρ x 0 0 = (26) x = p(x) x x P y ρ x P y y y. x y If we trace out Q we arrive at tr Q E(ρ (P,Q,M0) ) = (27) = p(y/x)p(x) x x y y x,y = x,y p(x,y) x x y y. Finally, we can extend E to ρ P ρ (Q,M) by ( ) E p(x) x x ρ 0 0 = (28) x = p(x) x x P y ρp y y y. x y If we trace out Q we get tr Q E(ρ P ρ (Q,M0) ) = (29) = p x x x p(y) y y = x y = ( x p x x x ) ( y p y y y ). We can now use the properties stated in the above theorems and Eqs. 27 and 29 to deduce d(ρ P,Q ρ P ρ Q ) = d(ρ P,Q,M0 ρ P ρ Q,M0 ) (30) d(e(ρ P,Q,M0 ) E(ρ P ρ Q,M0 )) d(tr Q E(ρ P,Q,M0 ) I q tr Q E(ρ P ρ (Q,M0) ) I q ) = = d(x,y X Y), q where in the first inequality we have used Theorem 2. and in the second inequality Theorem 2.3. The final equality is an easy consequence of the definition of the HS norm. Corollary: Suppose Alice is sending classical information to Bob using a quantum channel Q, Bob measures the quantum state using a projective measurement defined above (having results in space Y). Under all the above assumptions q d(x,y X Y) 2 L(ρP )L(ρ Q ), (3) wherel(ρ Q ) and L(ρ P ) aretsallisentropiesofthe second type (the quantum logicalentropies)ofρ Q and ρ P. 5

Proof: Clearly (see also [8]) d(ρ P,Q ρ P ρ Q ) = tr(ρ P,Q ( ρ P ρ Q )) (32) 2 L(ρP ρ Q ) 2 L(ρP,Q ). It is easy to see (by a matrix representation) that for ρ P,Q as in Eq. 2 tr(ρ P,Q ( ρ P ρ Q )) = L(ρ P,Q ), (33) therefore d(ρ P,Q ρ P ρ Q ) = 2 L(ρP,Q ) 2 L(ρP ρ Q ). (34) However, L(ρ P,Q ) L(ρ P )+L(ρ Q ), and L(ρ P ρ Q ) = L(ρ P )+L(ρ Q ) L(ρ P ) L(ρ Q ), (see [8] Theorem II.2.4 and Theorem II.3), therefore Combining this with Theorem 2.4 we find d(ρ P,Q ρ P ρ Q ) 2 L(ρP ) L(ρ Q ). (35) q d(x,y X Y) 2 L(ρP )L(ρ Q ). (36) Example: Suppose Alice sends the state 0 with probability /2 and the state ψ = cosθ 0 +sinθ with probability /2, then ρ P,Q = 2 0 0 ρ 0 + 2 ρ, (37) where ρ 0 = 0 0 and ρ = ψ ψ. By partial tracing we get ρ Q = ( ) 0 + ( cos 2 θ cosθsinθ 2 0 0 2 cosθsinθ sin 2 θ and ρ P is a balanced coin. The eigenvalues of ρ Q are (±cosθ)/2 and therefore Also L(ρ P ) = /2 and q = 2, hence ), (38) L(ρ Q ) = [(+cosθ) 2 /4+( cosθ) 2 /4] = 2 sin2 θ. (39) d(x,y X Y) 4 sin2 θ /4. (40) The left hand side of the above inequality is a measure of the classical mutual information according to the HS norm between X and Y. The very fact that it is smaller than the Tsallis information measure of X (which is /2) means that the quantum channel restricts the rate of classical information transfer, where the mutual information is measured by the HS norm and the source of information X is measured by Tsallis entropy. This is analogous to Holevo s upper bound in the framework of Tsalis/linear entropy. We find this result similar in spirit to the well-known limitation on the rate of classical information transmission via a quantum channel (without utilizing entanglement): one cannot send more than one bit for each use of the channel using a one qubit channel. In the above example, if ρ 0 and ρ are mixed states, then by the same argument we can show that: d(x,y X Y) 2 L(ρQ ) (4) 6

This gives a bound on the classical mutual information using the quantum logical entropy (the Tsallis entropy). 3. Discussion We proved a Holevo-type bound employing the Hilbert-Schmidt distance between the density matrices on the product space (X,Y) and the tensor of the two marginal density matrices on X Y. Using a different measure of mutual information, we showed that this Holevo-type upper bound on classical information transmission can be written as an inequality between the classical mutual information expression and its quantum counterpart. It seems that by utilizing Naimark s dilation [5, 6], the above result can be generalized to any POVM, if one is willing to employ the suitable channel in a higher dimensional Hilbert space. As was claimed in [8], the divergence distance used above is the natural one in the context of quantum logical entropy [9]. Being the right measure of mutual information in quantum channels passing classical information, we expect that this formalism would be helpful in further studying various problems such as channel capacity theory, entanglement detection and area laws. Acknowledgments E.C. was partially supported by Israel Science Foundation Grant No. 3/4. References [] A. S. Holevo. Bounds for the quantity of information transmitted by a quantum communication channel. Probl. Peredachi Inf. 9(3):3, 973. [2] M. A. Nielsen and I. L. Chuang. Quantum Information and Quantum Computation. Cambridge university press, Cambridge, UK, 200. [3] N. J. Cerf and C. Adami. Accessible information in quantum measurement. quant-ph/96032, 996. [4] A. Winter. Coding Theorem and Strong Converse for Quantum Channels. IEEE T. Inform. Theory 45(7):248 2485, 999. [5] Note that the trace distance here is different than the one used in [2](chapter 9) by a square. [6] V. Buzek and M. Hillery. Quantum copying: Beyond the no-cloning theorem. Phys. Rev. A 54(3):844 852, 996. [7] V. Vedral and M. B. Plenio. Entanglement measures and purification procedures. Phys. Rev. A 57(3):69 633, 998. [8] D. Perez-Garcia, M. M. Wolf, D. Petz and M. B. Ruskai. Contractivity of positive and trace-preserving maps under Lp norms. J. Math. Phys. 47(8):083506, 2006. [9] D. Ellerman. Information as Distinction: New Foundation for Information Theory. arxiv:30.5607, 203. [0] M. M. Wolf, F. Verstraete, M. B. Hasting and J. I. Cirac. Area law in quantum systems: mutual information and correlations. Phys. Rev. Lett. 00(7):070502, 2008. [] C. Witte and M. Trucks. A new entanglement measure induced by the Hilbert-Schmidt norm. Phys. Lett. A 257():4 20, 999. 7

[2] M. Ozawa. Entanglement measures and the HilbertSchmidt distance. Phys. Lett. A 268(3):58 60, 2000. [3] C. Tsallis. Possible generalization of Boltzmann-Gibbs statistics. J. Stat. Phys. 52(-2):479 487, 988. [4] N. A. Peters, T. C. Wei and P. G. Kwiat. Mixed state sensitivity of several quantum information benchmarks. Phys. Rev. A 70(5):052309, 2004. [5] V. Paulsen. Completely bounded maps and operator algebras. Cambridge University Press, Cambridge, UK, 2002. [6] K. Matsumoto, T. Shimono and A. Winter. Remarks on additivity of the Holevo channel capacity and of the entanglement of formation. Commun. Math. Phys. 246(3):427 442, 2004. [7] A. E. Rastegin. Some General Properties of Unified Entropies. J. Stat. Phys 43(6):20 35, 200. [8] B. Tamir and E. Cohen. Logical Entropy for Quantum States. arxiv:42.066, 204. 8