Viscous vortex domains method

From formulasearchengine
Revision as of 16:17, 31 October 2013 by en>Dthomsen8 (→Discrete formulas: clean up, typo(s) fixed: so called → so-called using AWB)
Jump to navigation Jump to search

In quantum information theory, the idea of a typical subspace plays an important role in the proofs of many coding theorems (the most prominent example being Schumacher compression). Its role is analogous to that of the typical set in classical information theory.

Unconditional Quantum Typicality

Consider a density operator ρ with the following spectral decomposition:

ρ=∑xpX(x)|x⟩⟨x|.

The weakly typical subspace is defined as the span of all vectors such that the sample entropy H‾(xn) of their classical label is close to the true entropy H(X) of the distribution pX(x):

TδXn≡span{|xn⟩:|H‾(xn)−H(X)|≤δ},

where

H‾(xn)≡−1nlog⁡(pXn(xn)),
H(X)≡−∑xpX(x)log⁡pX(x).

The projector Πρ,δn onto the typical subspace of ρ is defined as

Πρ,δn≡∑xn∈TδXn|xn⟩⟨xn|,

where we have "overloaded" the symbol TδXn to refer also to the set of δ-typical sequences:

TδXn≡{xn:|H‾(xn)−H(X)|≤δ}.

The three important properties of the typical projector are as follows:

Tr{Πρ,δnρ⊗n}≥1−ϵ,
Tr{Πρ,δn}≤2n[H(X)+δ],
2−n[H(X)+δ]Πρ,δn≤Πρ,δnρ⊗nΠρ,δn≤2−n[H(X)−δ]Πρ,δn,

where the first property holds for arbitrary ϵ,δ>0 and sufficiently large n.

Conditional Quantum Typicality

Consider an ensemble {pX(x),ρx}x∈𝒳 of states. Suppose that each state ρx has the following spectral decomposition:

ρx=∑ypY|X(y|x)|yx⟩⟨yx|.

Consider a density operator ρxn which is conditional on a classical sequence xn≡x1⋯xn:

ρxn≡ρx1⊗⋯⊗ρxn.

We define the weak conditionally typical subspace as the span of vectors (conditional on the sequence xn) such that the sample conditional entropy H‾(yn|xn) of their classical labels is close to the true conditional entropy H(Y|X) of the distribution pY|X(y|x)pX(x):

TδYn|xn≡span{|yxnn⟩:|H‾(yn|xn)−H(Y|X)|≤δ},

where

H‾(yn|xn)≡−1nlog⁡(pYn|Xn(yn|xn)),
H(Y|X)≡−∑xpX(x)∑ypY|X(y|x)log⁡pY|X(y|x).

The projector Πρxn,δ onto the weak conditionally typical subspace of ρxn is as follows:

Πρxn,δ≡∑yn∈TδYn|xn|yxnn⟩⟨yxnn|,

where we have again overloaded the symbol TδYn|xn to refer to the set of weak conditionally typical sequences:

TδYn|xn≡{yn:|H‾(yn|xn)−H(Y|X)|≤δ}.

The three important properties of the weak conditionally typical projector are as follows:

𝔼Xn{Tr{ΠρXn,δρXn}}≥1−ϵ,
Tr{Πρxn,δ}≤2n[H(Y|X)+δ],
2−n[H(Y|X)+δ] Πρxn,δ≤Πρxn,δ ρxn Πρxn,δ≤2−n[H(Y|X)−δ] Πρxn,δ,

where the first property holds for arbitrary ϵ,δ>0 and sufficiently large n, and the expectation is with respect to the distribution pXn(xn).

See also

References

Template:Quantum computing