typical subspace
{{short description|Term in quantum information theory}}
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:
:
\rho=\sum_{x}p_{X}( x) \vert x\rangle \langle
x\vert .
The weakly typical subspace is defined as the span of all vectors such that
the sample entropy of their classical
label is close to the true entropy of the distribution
:
:
T_{\delta}^{X^{n}}\equiv\text{span}\left\{ \left\vert x^{n}\right\rangle
:\left\vert \overline{H}( x^{n}) -H( X) \right\vert
\leq\delta\right\} ,
where
:
\overline{H}( x^{n}) \equiv-\frac{1}{n}\log( p_{X^{n}
}( x^{n}) ) ,
:
x) .
The projector onto the typical subspace of is
defined as
:
\Pi_{\rho,\delta}^{n}\equiv\sum_{x^{n}\in T_{\delta}^{X^{n}}}\vert
x^{n}\rangle \langle x^{n}\vert ,
where we have "overloaded" the symbol
to refer also to the set of -typical sequences:
:
T_{\delta}^{X^{n}}\equiv\left\{ x^{n}:\left\vert \overline{H}\left(
x^{n}\right) -H( X) \right\vert \leq\delta\right\} .
The three important properties of the typical projector are as follows:
:
\text{Tr}\left\{ \Pi_{\rho,\delta}^{n}\rho^{\otimes n}\right\}
\geq1-\epsilon,
:
X\right) +\delta\right] },
:
\leq\Pi_{\rho,\delta}^{n}\rho^{\otimes n}\Pi_{\rho,\delta}^{n}\leq2^{-n\left[
H( X) -\delta\right] }\Pi_{\rho,\delta}^{n},
where the first property holds for arbitrary and
sufficiently large .
Conditional quantum typicality
Consider an ensemble
_{x\in\mathcal{X}} of states. Suppose that each state has the
following spectral decomposition:
:
\rho_{x}=\sum_{y}p_{Y|X}( y|x) \vert y_{x}\rangle
\langle y_{x}\vert .
Consider a density operator which is conditional on a classical
sequence :
:
\rho_{x^{n}}\equiv\rho_{x_{1}}\otimes\cdots\otimes\rho_{x_{n}}.
We define the weak conditionally typical subspace as the span of vectors
(conditional on the sequence ) such that the sample conditional entropy
of their classical labels is close
to the true conditional entropy of the distribution
:
:
T_{\delta}^{Y^{n}|x^{n}}\equiv\text{span}\left\{ \left\vert y_{x^{n}}
^{n}\right\rangle :\left\vert \overline{H}( y^{n}|x^{n})
-H( Y|X) \right\vert \leq\delta\right\} ,
where
:
\overline{H}( y^{n}|x^{n}) \equiv-\frac{1}{n}\log\left(
p_{Y^{n}|X^{n}}( y^{n}|x^{n}) \right) ,
:
p_{Y|X}( y|x) \log p_{Y|X}( y|x) .
The projector onto the weak conditionally typical
subspace of is as follows:
:
\Pi_{\rho_{x^{n}},\delta}\equiv\sum_{y^{n}\in T_{\delta}^{Y^{n}|x^{n}}
}\vert y_{x^{n}}^{n}\rangle \langle y_{x^{n}}^{n}\vert ,
where we have again overloaded the symbol to refer
to the set of weak conditionally typical sequences:
:
T_{\delta}^{Y^{n}|x^{n}}\equiv\left\{ y^{n}:\left\vert \overline{H}\left(
y^{n}|x^{n}\right) -H( Y|X) \right\vert \leq\delta\right\} .
The three important properties of the weak conditionally typical projector are
as follows:
:
\mathbb{E}_{X^{n}}\left\{ \text{Tr}\left\{ \Pi_{\rho_{X^{n}},\delta}
\rho_{X^{n}}\right\} \right\} \geq1-\epsilon,
:
H( Y|X) +\delta\right] },
:
,\delta} \leq\Pi_{\rho_{x^{n}},\delta}\ \rho_{x^{n}}\ \Pi_{\rho_{x^{n}
},\delta} \leq2^{-n\left[ H( Y|X) -\delta\right] }\ \Pi
_{\rho_{x^{n}},\delta},
where the first property holds for arbitrary and
sufficiently large , and the expectation is with respect to the
distribution .
See also
References
- Wilde, Mark M., 2017, [http://www.cambridge.org/us/academic/subjects/computer-science/cryptography-cryptology-and-coding/quantum-information-theory-2nd-edition Quantum Information Theory, Cambridge University Press], Also available at [https://arxiv.org/abs/1106.1445 eprint arXiv:1106.1145]
{{Quantum computing}}