Separable state
Quantum states that are not entangled
In quantum mechanics, separable states are multipartite quantum states that can be written as a convex combination of product states. Product states are multipartite quantum states that can be written as a tensor product of states in each space. The physical intuition behind these definitions is that product states have no correlation between the different degrees of freedom, while separable states might have correlations, but all such correlations can be explained as due to a classical random variable, as opposed to being due to entanglement.
In the special case of pure states the definition simplifies: a pure state is separable if and only if it is a product state.
A state is said to be entangled if it is not separable. In general, determining if a state is separable is not straightforward and the problem is classed as NP-hard.
01Separability of bipartite systems
Consider first composite states with two degrees of freedom, referred to as bipartite states. By a postulate of quantum mechanics these can be described as vectors in the tensor product space . In this discussion we will focus on the case of the Hilbert spaces
and
being finite-dimensional.
Pure states
Let and
be orthonormal bases for
and
, respectively. A basis for
is then
, or in more compact notation
. From the very definition of the tensor product, any vector of norm 1, i.e. a pure state of the composite system, can be written as
where is a constant.
If
can be written as a simple tensor, that is, in the form
with
a pure state in the i-th space, it is said to be a product state, and, in particular, separable. Otherwise it is called entangled. Note that, even though the notions of product and separable states coincide for pure states, they do not in the more general case of mixed states.
Pure states are entangled if and only if their partial states are not pure. To see this, write the Schmidt decomposition of as
where are positive real numbers,
is the Schmidt rank of
, and
and
are sets of orthonormal states in
and
, respectively.
The state
is entangled if and only if
. At the same time, the partial state has the form
It follows that is pure --- that is, is projection with unit-rank --- if and only if
, which is equivalent to
being separable.
Physically, this means that it is not possible to assign a definite (pure) state to the subsystems, which instead ought to be described as statistical ensembles of pure states, that is, as density matrices. A pure state is thus entangled if and only if the von Neumann entropy of the partial state
is nonzero.
Formally, the embedding of a product of states into the product space is given by the Segre embedding. That is, a quantum-mechanical pure state is separable if and only if it is in the image of the Segre embedding.
For example, in a two-qubit space, where , the states
,
,
, are all product (and thus separable) pure states, as is
with
. On the other hand, states like
or
are not separable.
Mixed states
Consider the mixed state case. A mixed state of the composite system is described by a density matrix acting on
. Such a state
is separable if there exist
,
and
which are mixed states of the respective subsystems such that
where
Otherwise is called an entangled state. We can assume without loss of generality in the above expression that
and
are all rank-1 projections, that is, they represent pure ensembles of the appropriate subsystems. It is clear from the definition that the family of separable states is a convex set.
Notice that, again from the definition of the tensor product, any density matrix, indeed any matrix acting on the composite state space, can be trivially written in the desired form, if we drop the requirement that and
are themselves states and
If these requirements are satisfied, then we can interpret the total state as a probability distribution over uncorrelated product states.
In terms of quantum channels, a separable state can be created from any other state using local actions and classical communication while an entangled state cannot.
When the state spaces are infinite-dimensional, density matrices are replaced by positive trace class operators with trace 1, and a state is separable if it can be approximated, in trace norm, by states of the above form.
If there is only a single non-zero , then the state can be expressed just as
and is called simply separable or product state. One property of the product state is that in terms of entropy,
02Extending to the multipartite case
The above discussion generalizes easily to the case of a quantum system consisting of more than two subsystems. Let a system have n subsystems and have state space . A pure state
is separable if it takes the form
Similarly, a mixed state ρ acting on H is separable if it is a convex sum
Or, in the infinite-dimensional case, ρ is separable if it can be approximated in the trace norm by states of the above form.
03Separability criterion
The problem of deciding whether a state is separable in general is sometimes called the separability problem in quantum information theory. It is considered to be a difficult problem. It has been shown to be NP-hard in many cases and is believed to be so in general. Some appreciation for this difficulty can be obtained if one attempts to solve the problem by employing the direct brute force approach, for a fixed dimension. The problem quickly becomes intractable, even for low dimensions. Thus more sophisticated formulations are required. The separability problem is a subject of current research.
A separability criterion is a necessary condition a state must satisfy to be separable. In the low-dimensional (2 X 2 and 2 X 3) cases, the Peres-Horodecki criterion is actually a necessary and sufficient condition for separability. Other separability criteria include (but not limited to) the range criterion, reduction criterion, and those based on uncertainty relations. See Ref. for a review of separability criteria in discrete variable systems.
In continuous variable systems, the Peres-Horodecki criterion also applies. Specifically, Simon formulated a particular version of the Peres-Horodecki criterion in terms of the second-order moments of canonical operators and showed that it is necessary and sufficient for -mode Gaussian states (see Ref. for a seemingly different but essentially equivalent approach). It was later found that Simon's condition is also necessary and sufficient for
-mode Gaussian states, but no longer sufficient for
-mode Gaussian states. Simon's condition can be generalized by taking into account the higher order moments of canonical operators or by using entropic measures.
04Testing for separability
Testing for separability in the general case is an NP-hard problem. Leinaas et al. formulated an iterative, probabilistic algorithm for testing if a given state is separable. When the algorithm is successful, it gives an explicit, random, representation of the given state as a separable state. Otherwise it gives the distance of the given state from the nearest separable state it can find.
05Optimization over the set of separable states
The set of separable states appear in computing the convex roof of a function defined on pure states
where the optimization is over all decompositions of the density matrix of the form
It has been proven that
the convex roof of any quantity that can be written as a order
polynomial of expectation values for pure states as
where are operators and
are constants, can be computed with an optimization over symmetric separable states. In particular, the convex roof can be obtained as an optimization over
-copy symmetric fully separable states
where is symmetric, fully separable, all its marginals are
, and
is an appropriately defined operator given as
The next example shows a relevant convex roof in quantum physics. The quantum Fisher information can be given as four times the convex roof of the variance
The optimization problem can be written as
where Sep is the set of bipartite separable states.
Another example is the convex roof of the linear entropy of the reduced state in a bipartite system
which is zero if and only if the density matrix is separable.
A polinomial with is sufficient to compute the quantity above. It is an alternative of the entanglement of formation that is simpler to calculate.
A similar idea has been used to define the quantum Wasserstein distance based on an optimization over separable states. In particular, the distance
beween states and
can be defined as
where are operators. The optimization is over separable states
with marginals
and
.
Sources and credits
This article is adapted from the Wikipedia article “Separable state”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.