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(ρ) 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(∣ψ⟩⟨ψ∣) = logdimA with {∣i⟩^A} an orthonormal basis.

Van Sep: vanishing on separable states

For all separable states ρ, E(ρ) = 0 .

PPT Mon: PPT monotone

For all PPT operations ρ → {p_i, ρ_i}, E(ρ) ≥ ∑_ip_iE(ρ_i).

SEP Mon: SEP monotone

For all separable operations ρ → {p_i, ρ_i}, E(ρ) ≥ ∑_ip_iE(ρ_i).

LOCC Mon: LOCC monotone

For all LOCC operations ρ → {p_i, ρ_i}, E(ρ) ≥ ∑_ip_iE(ρ_i).

Loc Mon: local monotone

For all (strictly) local instruments (i.e. an instrument that acts either on A or B) ρ → {p_i, ρ_i}, E(ρ) ≥ ∑_ip_iE(ρ_i).

LOq Mon: LOq monotone

For all LOq operations ρ → {p_i, ρ_i}, E(ρ) ≥ ∑_ip_iE(ρ_i).

As Cont: asymptotic continuity

There are c, cʹ ≥ 0 s.th. for all ρ, σ with δ(ρ, σ) ≤ ε, ∣E(ρ) − E(σ)∣ ≤ cεlogd + cʹ.

As Cont Pure: asympt. cont. near pure states

There are c, cʹ ≥ 0 s.th. for all ρ, σ = ∣ψ⟩⟨ψ∣ with δ(ρ, σ) ≤ ε, ∣E(ρ) − E(σ)∣ ≤ cεlogd + cʹ.

Conv: convex

For all ρ, σ and p ∈ [0, 1] , pE(ρ) + (1 − p)E(σ) ≥ E(pρ + (1 − p)σ).

Conv Pure: convex on pure states

For all {p_i, ∣ψ_i⟩} with p_i ≥ 0 and ∑_ip_i = 1, ∑_ip_iE(ρ_i) ≥ E(ρ).

Strong Super: superadditive

For all ρ^AAʹBBʹ, E(ρ^AAʹ, BBʹ) ≥ E(ρ^AB) + E(ρ^AʹBʹ).

Add: additive

For all ρ, σ, E(ρ ⊗ σ) = E(ρ) + E(σ).

Ext (Add i.i.d.): extensive

For all ρ and N, NE(ρ) = E(ρ^⊗ N).

Sub Add: subadditive

For all ρ, σ, E(ρ ⊗ σ) ≤ E(ρ) + E(σ).

Sub Add i.i.d. subadditive i.i.d.

For all ρ and m, n, E(ρ^{⊗ (m + n)}) ≤ E(ρ^⊗ m) + E(ρ^⊗ n).

Regu: regularisable

For all ρ, the limit $E^\infty(\rho)=\lim_{n \rightarrow \infty} \frac{E(\rho^{\otimes n})}{n}$ exists.

Non Lock: not lockable

There is c ≥ 0 s.th. for all ρ^AAʹB, E(ρ^AAʹB) ≤ E(ρ^AB) + clogrankρ^Aʹ.

Category:Handbook of Quantum Information Category:Entanglement