HOME

TheInfoList



OR:

Squashed entanglement, also called CMI entanglement (CMI can be pronounced "see me"), is an information theoretic
measure Measure may refer to: * Measurement, the assignment of a number to a characteristic of an object or event Law * Ballot measure, proposed legislation in the United States * Church of England Measure, legislation of the Church of England * Mea ...
of
quantum entanglement Quantum entanglement is the phenomenon that occurs when a group of particles are generated, interact, or share spatial proximity in a way such that the quantum state of each particle of the group cannot be described independently of the state of ...
for a bipartite quantum system. If \varrho_ is the
density matrix In quantum mechanics, a density matrix (or density operator) is a matrix that describes the quantum state of a physical system. It allows for the calculation of the probabilities of the outcomes of any measurement performed upon this system, using ...
of a system (A,B) composed of two subsystems A and B, then the CMI entanglement E_ of system (A,B) is defined by where K is the set of all density matrices \varrho_ for a tripartite system (A,B,\Lambda) such that \varrho_=tr_\Lambda (\varrho_). Thus, CMI entanglement is defined as an extremum of a functional S(A:B , \Lambda) of \varrho_. We define S(A:B , \Lambda), 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 In mathematics, the infimum (abbreviated inf; plural infima) of a subset S of a partially ordered set P is a greatest element in P that is less than or equal to each element of S, if such an element exists. Consequently, the term ''greatest lo ...
). When \varrho_ is a pure state, E_(\varrho_)=S(\varrho_)=S(\varrho_), in agreement with the definition of entanglement of formation for pure states. Here S(\varrho) is the
Von Neumann entropy In physics, the von Neumann entropy, named after John von Neumann, is an extension of the concept of Gibbs entropy from classical statistical mechanics to quantum statistical mechanics. For a quantum-mechanical system described by a density matrix ...
of density matrix \varrho.


Motivation for definition of CMI entanglement

CMI entanglement has its roots in classical (non-quantum) information theory, as we explain next. Given any two random variables A,B, classical information theory defines the
mutual information In probability theory and information theory, the mutual information (MI) of two random variables is a measure of the mutual dependence between the two variables. More specifically, it quantifies the " amount of information" (in units such ...
, a measure of correlations, as For three random variables A,B,\Lambda, it defines the CMI as It can be shown that H(A : B , \Lambda)\geq 0. Now suppose \varrho_ is the density matrix for a tripartite system (A,B,\Lambda). We will represent the
partial trace In linear algebra and functional analysis, the partial trace is a generalization of the trace. Whereas the trace is a scalar valued function on operators, the partial trace is an operator-valued function. The partial trace has applications in ...
of \varrho_ with respect to one or two of its subsystems by \varrho_ with the symbol for the traced system erased. For example, \varrho_= tr_\Lambda(\varrho_). One can define a quantum analogue of Eq.(2) by and a quantum analogue of Eq.(3) by It can be shown that S(A : B , \Lambda)\geq 0. This inequality is often called the strong-subadditivity property of quantum entropy. Consider three random variables A,B, \Lambda with probability distribution P_(a,b, \lambda), which we will abbreviate as P(a,b, \lambda). For those special P(a, b, \lambda) of the form it can be shown that H(A: B , \Lambda)=0. Probability distributions of the form Eq.(6) are in fact described by the
Bayesian network A Bayesian network (also known as a Bayes network, Bayes net, belief network, or decision network) is a probabilistic graphical model that represents a set of variables and their conditional dependencies via a directed acyclic graph (DAG). Bay ...
shown in Fig.1. One can define a classical CMI entanglement by where K is the set of all probability distributions P_ in three random variables A,B,\Lambda, such that \sum_\lambda P_(a, b,\lambda)=P_(a,b)\,for all a,b. Because, given a probability distribution P_, one can always extend it to a probability distribution P_ that satisfies Eq.(6), it follows that the classical CMI entanglement, E_( P_), is zero for all P_. The fact that E_( P_) always vanishes is an important motivation for the definition of E_( \varrho_). We want a measure of quantum entanglement that vanishes in the classical regime. Suppose w_\lambda for \lambda=1,2,...,dim(\Lambda) is a set of non-negative numbers that add up to one, and , \lambda\rangle for \lambda=1,2,...,dim(\Lambda) is an orthonormal basis for the Hilbert space associated with a quantum system \Lambda. Suppose \varrho_A^\lambda and \varrho_B^\lambda, for \lambda=1,2,...,dim(\Lambda) are density matrices for the systems A and B, respectively. It can be shown that the following density matrix satisfies S(A: B , \Lambda)=0. Eq.(8) is the quantum counterpart of Eq.(6). Tracing the density matrix of Eq.(8) over \Lambda, we get \varrho_ = \sum_\lambda \varrho_A^\lambda \varrho_B^\lambda w_\lambda \,, which is a
separable state In quantum mechanics, separable states are quantum states belonging to a composite space that can be factored into individual states belonging to separate subspaces. A state is said to be entangled if it is not separable. In general, determinin ...
. Therefore, E_(\varrho_) given by Eq.(1) vanishes for all separable states. When \varrho_ is a pure state, one gets E_(\varrho_)=S(\varrho_)=S(\varrho_). This agrees with the definition of entanglement of formation for pure states, as given in Ben96. Next suppose , \psi_^\lambda\rangle for \lambda=1,2,...,dim(\Lambda) are some states in the Hilbert space associated with a quantum system (A,B). Let K be the set of density matrices defined previously for Eq.(1). Define K_o to be the set of all density matrices \varrho_ that are elements of K and have the special form \varrho_ = \sum_\lambda, \psi_^\lambda\rangle \langle \psi_^\lambda, w_\lambda , \lambda\rangle\langle\lambda, \, . It can be shown that if we replace in Eq.(1) the set K by its proper subset K_o, then Eq.(1) reduces to the definition of entanglement of formation for mixed states, as given in Ben96. K and K_o represent different degrees of knowledge as to how \varrho_ was created. K represents total ignorance. Since CMI entanglement reduces to entanglement of formation if one minimizes over K_o instead of K, one expects that CMI entanglement inherits many desirable properties from entanglement of formation.


History

The important inequality S(A : B , \Lambda)\geq 0 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 S(A, B) 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 quantum computing, a qubit () or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state (or two-level) quantum-mechanical system, ...
. 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.


References

*Ali03 *BCY10 *Ben96 *Cer96 *Cer97 *Chr03 *Chr05 *Chr06 Cambridge PhD thesis. *Hay03 *Hua14 *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 *Tuc00a *Tuc00b *Tuc01a *Tuc01b *Tuc02 {{cite arXiv, eprint=quant-ph/0202144, last1=Tucci , first1=Robert R., title=Entanglement of Distillation and Conditional Mutual Information, year=2002


External links


Faithful squashed entanglement
Quantum information science