Open main menu

Squashed entanglement, also called CMI entanglement (CMI can be pronounced "see me"), is an information theoretic measure of quantum entanglement for a bipartite quantum system. If is the density matrix of a system composed of two subsystems and , then the CMI entanglement of system is defined by

,

 

 

 

 

Eq.(1)

where is the set of all density matrices for a tripartite system such that . Thus, CMI entanglement is defined as an extremum of a functional of . We define , the quantum Conditional Mutual Information (CMI), below. A more general version of Eq.(1) replaces the ``min" (minimum) in Eq.(1) by an ``inf" (infimum). When is a pure state, , in agreement with the definition of entanglement of formation for pure states. Here is the Von Neumann entropy of density matrix .

Contents

Motivation for definition of CMI entanglementEdit

CMI entanglement has its roots in classical (non-quantum) information theory, as we explain next.

Given any two random variables  , classical information theory defines the mutual information, a measure of correlations, as

 .

 

 

 

 

Eq.(2)

For three random variables  , it defines the CMI as

 .

 

 

 

 

Eq.(3)

It can be shown that  .

Now suppose   is the density matrix for a tripartite system  . We will represent the partial trace of   with respect to one or two of its subsystems by   with the symbol for the traced system erased. For example,  . One can define a quantum analogue of Eq.(2) by

 ,

 

 

 

 

Eq.(4)

and a quantum analogue of Eq.(3) by

 .

 

 

 

 

Eq.(5)

It can be shown that  . This inequality is often called the strong-subadditivity property of quantum entropy.

Consider three random variables   with probability distribution  , which we will abbreviate as  . For those special   of the form

 ,

 

 

 

 

Eq.(6)

 
Fig.1: Bayesian Network representation of Eq.(6)

it can be shown that  . Probability distributions of the form Eq.(6) are in fact described by the Bayesian network shown in Fig.1.

One can define a classical CMI entanglement by

 ,

 

 

 

 

Eq.(7)

where   is the set of all probability distributions   in three random variables  , such that  for all  . Because, given a probability distribution  , one can always extend it to a probability distribution   that satisfies Eq.(6)[citation needed], it follows that the classical CMI entanglement,  , is zero for all  . The fact that   always vanishes is an important motivation for the definition of  . We want a measure of quantum entanglement that vanishes in the classical regime.

Suppose   for   is a set of non-negative numbers that add up to one, and   for   is an orthonormal basis for the Hilbert space associated with a quantum system  . Suppose   and  , for   are density matrices for the systems   and  , respectively. It can be shown that the following density matrix

 

 

 

 

 

Eq.(8)

satisfies  . Eq.(8) is the quantum counterpart of Eq.(6). Tracing the density matrix of Eq.(8) over  , we get  , which is a separable state. Therefore,   given by Eq.(1) vanishes for all separable states.

When   is a pure state, one gets  . This agrees with the definition of entanglement of formation for pure states, as given in Ben96.

Next suppose   for   are some states in the Hilbert space associated with a quantum system  . Let   be the set of density matrices defined previously for Eq.(1). Define   to be the set of all density matrices   that are elements of   and have the special form  . It can be shown that if we replace in Eq.(1) the set   by its proper subset  , then Eq.(1) reduces to the definition of entanglement of formation for mixed states, as given in Ben96.   and   represent different degrees of knowledge as to how   was created.   represents total ignorance.

Since CMI entanglement reduces to entanglement of formation if one minimizes over   instead of  , one expects that CMI entanglement inherits many desirable properties from entanglement of formation.

HistoryEdit

The important inequality   was first proved by Lieb and Ruskai in LR73.

Classical CMI, given by Eq.(3), first entered information theory lore, shortly after Shannon's seminal 1948 paper and at least as early as 1954 in McG54. The quantum CMI, given by Eq.(5), was first defined by Cerf and Adami in Cer96. However, it appears that Cerf and Adami did not realize the relation of CMI to entanglement or the possibility of obtaining a measure of quantum entanglement based on CMI; this can be inferred, for example, from a later paper, Cer97, where they try to use   instead of CMI to understand entanglement. The first paper to explicitly point out a connection between CMI and quantum entanglement appears to be Tuc99.

The final definition Eq.(1) of CMI entanglement was first given by Tucci in a series of 6 papers. (See, for example, Eq.(8) of Tuc02 and Eq.(42) of Tuc01a). In Tuc00b, he pointed out the classical probability motivation of Eq.(1), and its connection to the definitions of entanglement of formation for pure and mixed states. In Tuc01a, he presented an algorithm and computer program, based on the Arimoto-Blahut method of information theory, for calculating CMI entanglement numerically. In Tuc01b, he calculated CMI entanglement analytically, for a mixed state of two qubits.

In Hay03, Hayden, Jozsa, Petz and Winter explored the connection between quantum CMI and separability.

It was not however, until Chr03, that it was shown that CMI entanglement is in fact an entanglement measure, i.e. that it does not increase under Local Operations and Classical Communication (LOCC). The proof adapted Ben96 arguments about entanglement of formation. In Chr03, they also proved many other interesting inequalities concerning CMI entanglement, including that it was additive, and explored its connection to other measures of entanglement. The name squashed entanglement first appeared in Chr03. In Chr05, Christandl and Winter calculated analytically the CMI entanglement of some interesting states.

In Ali03, Alicki and Fannes proved the continuity of CMI entanglement. In BCY10, Brandao, Christandl and Yard showed that CMI entanglement is zero if and only if the state is separable. In Hua14, Huang proved that computing squashed entanglement is NP-hard.

ReferencesEdit

  • Ali03 Alicki, R.; Fannes, M. (2003). "Continuity of quantum mutual information". J. Phys. A. 37 (55): L55–L57. arXiv:quant-ph/0312081. Bibcode:2004JPhA...37L..55A. doi:10.1088/0305-4470/37/5/L01.
  • BCY10 Brandao, F.; Christandl, M.; Yard, J. (September 2011). "Faithful Squashed Entanglement". Communications in Mathematical Physics. 306 (3): 805–830. arXiv:1010.1750. Bibcode:2011CMaPh.306..805B. doi:10.1007/s00220-011-1302-1.
  • Ben96 Bennett, Charles H.; DiVincenzo, David P.; Smolin, John A.; Wootters, William K. (1996). "Mixed State Entanglement and Quantum Error Correction". Physical Review A. 54 (5): 3824–3851. arXiv:quant-ph/9604024. Bibcode:1996PhRvA..54.3824B. doi:10.1103/PhysRevA.54.3824. PMID 9913930.
  • Cer96 Cerf, N. J.; Adami, C. (1996). "Quantum Mechanics of Measurement". arXiv:quant-ph/9605002.
  • Cer97 Cerf, N. J.; Adami, C.; Gingrich, R. M. (1999). "Quantum conditional operator and a criterion for separability". Physical Review A. 60 (2): 893–898. arXiv:quant-ph/9710001. Bibcode:1999PhRvA..60..893C. doi:10.1103/PhysRevA.60.893.
  • Chr03 Matthias Christandl; Andreas Winter (2003). ""Squashed Entanglement": An Additive Entanglement Measure". Journal of Mathematical Physics. 45 (3): 829–840. arXiv:quant-ph/0308088. Bibcode:2004JMP....45..829C. doi:10.1063/1.1643788.
  • Chr05 Matthias Christandl; Andreas Winter (2005). "Uncertainty, Monogamy, and Locking of Quantum Correlations". IEEE Transactions on Information Theory. 51 (9): 3159–3165. arXiv:quant-ph/0501090. doi:10.1109/TIT.2005.853338.
  • Chr06 Matthias Christandl (2006). "The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography". arXiv:quant-ph/0604183. Cambridge PhD thesis.
  • Hay03 Patrick Hayden; Richard Jozsa; Denes Petz; Andreas Winter (2004). "Structure of states which satisfy strong subadditivity of quantum entropy with equality". Communications in Mathematical Physics. 246 (2): 359–374. arXiv:quant-ph/0304007. Bibcode:2004CMaPh.246..359H. doi:10.1007/s00220-004-1049-z.
  • Hua14 Huang, Yichen (21 March 2014). "Computing quantum discord is NP-complete". New Journal of Physics. 16 (3): 033027. arXiv:1305.5941. Bibcode:2014NJPh...16c3027H. doi:10.1088/1367-2630/16/3/033027.
  • LR73 Elliott H. Lieb, Mary Beth Ruskai, "Proof of the Strong Subadditivity of Quantum-Mechanical Entropy", Journal of Mathematical Physics 14 (1973) 1938-1941.
  • McG54 W.J. McGill, "Multivariate Information Transmission", IRE Trans. Info. Theory 4 (1954) 93-111.
  • Tuc99 Tucci, Robert R. (1999). "Quantum Entanglement and Conditional Information Transmission". arXiv:quant-ph/9909041.
  • Tuc00a Tucci, Robert R. (2000). "Separability of Density Matrices and Conditional Information Transmission". arXiv:quant-ph/0005119.
  • Tuc00b Tucci, Robert R. (2000). "Entanglement of Formation and Conditional Information Transmission". arXiv:quant-ph/0010041.
  • Tuc01a Tucci, Robert R. (2001). "Relaxation Method for Calculating Quantum Entanglement". arXiv:quant-ph/0101123.
  • Tuc01b Tucci, Robert R. (2001). "Entanglement of Bell Mixtures of Two Qubits". arXiv:quant-ph/0103040.
  • Tuc02 Tucci, Robert R. (2002). "Entanglement of Distillation and Conditional Mutual Information". arXiv:quant-ph/0202144.

External linksEdit