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 as 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.
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
H1 ⊗ H2
H1
H2
Let
\{|{ai}\rangle\}
n\subset | |
i=1 |
H1
\{|{bj}\rangle\}
m | |
j=1 |
\subsetH2
H1
H2
H1 ⊗ H2
\{|{ai}\rangle ⊗ |{bj}\rangle\}
\{|aibj\rangle\}
|\psi\rangle=\sumi,jci,j(|ai\rangle ⊗ |bj\rangle)=\sumi,jci,j|aibj\rangle,
where
ci,j
|\psi\rangle
|\psi\rangle=|\psi1\rangle ⊗ |\psi2\rangle
|\psii\rangle
Pure states are entangled if and only if their partial states are not pure. To see this, write the Schmidt decomposition of
|\psi\rangle
r\psi | |
|\psi\rangle=\sum | |
k=1 |
\sqrt{pk}(|uk\rangle ⊗ |vk\rangle),
\sqrt{pk}>0
r\psi
|\psi\rangle
\{|uk\rangle\}
r\psi | |
k=1 |
\subsetH1
\{|vk\rangle\}
r\psi | |
k=1 |
\subsetH2
H1
H2
|\psi\rangle
r\psi>1
\rhoA\equiv\operatorname{Tr}B(|\psi\rangle\langle\psi|)=
r\psi | |
\sum | |
k=1 |
pk|uk\rangle\langleuk|.
It follows that
\rhoA
r\psi=1
|\psi\rangle
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
\rho=|\psi\rangle\langle\psi|
\rhoA\equiv\operatorname{Tr}B(\rho)
Formally, the embedding of a product of states into the product space is given by the Segre embedding.[1] 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
H1=H
2 | |
2=C |
|0\rangle ⊗ |0\rangle
|0\rangle ⊗ |1\rangle
|1\rangle ⊗ |1\rangle
|0\rangle ⊗ |\psi\rangle
|\psi\rangle\equiv\sqrt{1/3}|0\rangle+\sqrt{2/3}|1\rangle
\sqrt{1/2}|00\rangle+\sqrt{1/2}|11\rangle
\sqrt{1/3}|01\rangle+\sqrt{2/3}|10\rangle
\rho
H1 ⊗ H2
pk\geq0
\{
k | |
\rho | |
1 |
\}
\{
k | |
\rho | |
2 |
\}
\rho=\sumkpk
k | |
\rho | |
1 |
⊗
k | |
\rho | |
2 |
where
\sumkpk=1.
Otherwise
\rho
\{
k | |
\rho | |
1 |
\}
\{
k | |
\rho | |
2 |
\}
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
\{
k | |
\rho | |
1 |
\}
\{
k | |
\rho | |
2 |
\}
\sumkpk=1.
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
pk
S(\rho)=S(\rho1)+S(\rho2).
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
H=H1 ⊗ … ⊗ Hn
|\psi\rangle\inH
|\psi\rangle=|\psi1\rangle ⊗ … ⊗ |\psin\rangle.
Similarly, a mixed state ρ acting on H is separable if it is a convex sum
\rho=\sumkpk
k | |
\rho | |
1 |
⊗ … ⊗
k. | |
\rho | |
n |
Or, in the infinite-dimensional case, ρ is separable if it can be approximated in the trace norm by states of the above form.
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 [2] [3] 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.[4] [5] [6] [7] See Ref.[8] for a review of separability criteria in discrete variable systems.
In continuous variable systems, the Peres-Horodecki criterion also applies. Specifically, Simon [9] 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
1 ⊕ 1
1 ⊕ n
2 ⊕ 2
Quantum mechanics may be modelled on a projective Hilbert space, and the categorical product of two such spaces is the Segre embedding. In the bipartite case, a quantum state is separable if and only if it lies in the image of the Segre embedding.Jon Magne Leinaas, Jan Myrheim and Eirik Ovrum in their paper "Geometrical aspects of entanglement"[16] describe the problem and study the geometry of the separable states as a subset of the general state matrices. This subset have some intersection with the subset of states holding Peres-Horodecki criterion. In this paper, Leinaas et al. also give a numerical approach to test for separability in the general case.
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.