In
quantum information theory, the reduction criterion is a necessary condition a
mixed state must satisfy in order for it to be
separable. In other words, the reduction criterion is a ''separability criterion''. It was first proved
and independently formulated in 1999.
Violation of the reduction criterion is closely related to the
distillability of the state in question.
Details
Let ''H''
1 and ''H''
2 be Hilbert spaces of finite dimensions ''n'' and ''m'' respectively. ''L''(''H
i'') will denote the space of linear operators acting on ''H
i''. Consider a bipartite quantum system whose state space is the tensor product
:
An (un-normalized) mixed state ''ρ'' is a positive linear operator (density matrix) acting on ''H''.
A linear map Φ: ''L''(''H''
2) → ''L''(''H''
1) is said to be positive if it preserves the cone of positive elements, i.e. ''A'' is positive implied ''Φ''(''A'') is also.
From the one-to-one correspondence between positive maps and
entanglement witness
In quantum information theory, an entanglement witness is a functional which distinguishes a specific entangled state from separable ones. Entanglement witnesses can be linear or nonlinear functionals of the density matrix. If linear, then t ...
es, we have that a state ''ρ'' is entangled if and only if there exists a positive map ''Φ'' such that
:
is not positive. Therefore, if ''ρ'' is separable, then for all positive map Φ,
:
Thus every positive, but not
completely positive
In mathematics a positive map is a map between C*-algebras that sends positive elements to positive elements. A completely positive map is one which satisfies a stronger, more robust condition.
Definition
Let A and B be C*-algebras. A linea ...
, map Φ gives rise to a necessary condition for separability in this way. The reduction criterion is a particular example of this.
Suppose ''H''
1 = ''H''
2. Define the positive map Φ: ''L''(''H''
2) → ''L''(''H''
1) by
:
It is known that Φ is positive but not completely positive. So a mixed state ''ρ'' being separable implies
:
Direct calculation shows that the above expression is the same as
:
where ''ρ''
1 is the
partial trace of ''ρ'' with respect to the second system. The dual relation
:
is obtained in the analogous fashion. The reduction criterion consists of the above two inequalities.
Connection with Fréchet bounds
The above last two inequalities together with lower bounds for ''ρ'' can be seen as quantum
Fréchet inequalities In probabilistic logic, the Fréchet inequalities, also known as the Boole–Fréchet inequalities, are rules implicit in the work of George BooleBoole, G. (1854). ''An Investigation of the Laws of Thought, On Which Are Founded the Mathematical Theo ...
, that is as the quantum analogous of the classical
Fréchet probabilistic bounds, that hold for
separable quantum states. The upper bounds are the previous ones
,
, and the lower bounds are the obvious constraint
together with
, where
are identity matrices of suitable dimensions. The lower bounds have been obtained in.
These bounds are satisfied by separable density matrices, while
entangled states can
violate them. Entangled states exhibit a form of ''stochastic dependence stronger than the strongest classical dependence'' and in fact they violate Fréchet like bounds.
It is also worth mentioning that is possible to give a Bayesian interpretation of these bounds.
[
]
References
{{DEFAULTSORT:Reduction Criterion
Quantum information science