Axiomatic approach

The aim of the axiomatic approach to entanglement measures is to find, classify and study all functions that capture our intuitive notion of what it means to measure entanglement. The approach sets out axioms, i.e. properties, that an entanglement measure should or should not satisfy. This intuitive notion may be based on more practical grounds such as operational definitions. The most striking applications of the axiomatic approach are upper and lower bounds on operational measures such as distillable entanglement, entanglement cost and most recently distillable key. == Properties == The following is a list of properties that have been studied in the context of [[entanglement measures]]. E(\rho) denotes an entanglement measure. '''Norm:''' normalised on maximally entangled states For all \psi=\frac{1}{\sqrt{\dim A}}\sum_i |i\rangle^A|i\rangle^B , E(|\psi\rangle \langle \psi |)=\log \dim A with \{ |i\rangle^A\} an orthonormal basis. '''Van Sep:''' vanishing on separable states For all separable states \rho , E(\rho)=0 . '''PPT Mon:''' PPT monotone For all PPT operations \rho \rightarrow \{p_i, \rho_i\}, E(\rho) \geq \sum_i p_i E(\rho_i) . '''SEP Mon:''' SEP monotone For all separable operations \rho \rightarrow \{p_i, \rho_i\}, E(\rho) \geq \sum_i p_i E(\rho_i) . '''LOCC Mon:''' LOCC monotone For all LOCC operations \rho \rightarrow \{p_i, \rho_i\}, E(\rho) \geq \sum_i p_i E(\rho_i) . '''Loc Mon:''' local monotone For all (strictly) local instruments (i.e. an instrument that acts either on A or B) \rho \rightarrow \{p_i, \rho_i\}, E(\rho) \geq \sum_i p_i E(\rho_i) . '''LOq Mon:''' LOq monotone For all LOq operations \rho \rightarrow \{p_i, \rho_i\}, E(\rho) \geq \sum_i p_i E(\rho_i) . '''As Cont:''' asymptotic continuity There are c, c'\geq 0 s.th. for all \rho, \sigma with \delta(\rho, \sigma) \leq \epsilon, |E(\rho)-E(\sigma)|\leq c \epsilon \log d + c' . '''As Cont Pure:''' asympt. cont. near pure states There are c, c'\geq 0 s.th. for all \rho, \sigma=|\psi\rangle \langle \psi| with \delta(\rho, \sigma) \leq \epsilon, |E(\rho)-E(\sigma)|\leq c \epsilon \log d + c'. '''Conv:''' convex For all \rho, \sigma and p \in [0,1] , pE(\rho)+(1-p)E(\sigma) \geq E(p \rho+(1-p)\sigma) . '''Conv Pure:''' convex on pure states For all \{p_i, |\psi_i \rangle\} with p_i \geq 0 and \sum_i p_i =1, \sum_i p_i E(\rho_i) \geq E(\rho) . '''Strong Super:''' superadditive For all \rho^{AA'BB'}, E(\rho^{AA',BB'})\geq E(\rho^{AB})+E(\rho^{A'B'}) . '''Add:''' additive For all \rho, \sigma , E(\rho \otimes \sigma)= E(\rho)+E(\sigma) . '''Ext (Add i.i.d.):''' extensive For all \rho and N, NE(\rho)= E(\rho^{\otimes N}). '''Sub Add:''' subadditive For all \rho, \sigma, E(\rho\otimes \sigma)\leq E(\rho)+E(\sigma) . '''Sub Add i.i.d.''' subadditive i.i.d. For all \rho and m, n , E(\rho^{\otimes (m+n)})\leq E(\rho^{\otimes m})+E(\rho^{\otimes n}) . '''Regu:''' regularisable For all \rho , the limit E^\infty(\rho)=\lim_{n \rightarrow \infty} \frac{E(\rho^{\otimes n})}{n} exists. '''Non Lock:''' not lockable There is c\geq 0 s.th. for all \rho^{AA'B} , E(\rho^{AA'B}) \leq E(\rho^{AB})+ c \log rank \rho^{A'} . [[Category:Handbook of Quantum Information]] [[Category:Entanglement]]