Separable state

In quantum mechanics, separable states are quantum states belonging to a composite space that can be factored into individual states belonging to separate subspaces. 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.

Separability of bipartite systems[]

We first consider composite states with two degrees of freedom. Such states are referred to as bipartite states, and by a postulate of quantum mechanics they can be described as vectors in the tensor product space ${\displaystyle H_{1}\otimes H_{2}}$. In this discussion we will focus on the case of the Hilbert spaces ${\displaystyle H_{1}}$ and ${\displaystyle H_{2}}$ being finite-dimensional.

Pure states[]

Let ${\displaystyle \{|{a_{i}}\rangle \}_{i=1}^{n}\subset H_{1}}$ and ${\displaystyle \{|{b_{j}}\rangle \}_{j=1}^{m}\subset H_{2}}$ be orthonormal bases for ${\displaystyle H_{1}}$ and ${\displaystyle H_{2}}$, respectively. A basis for ${\displaystyle H_{1}\otimes H_{2}}$ is then ${\displaystyle \{|{a_{i}}\rangle \otimes |{b_{j}}\rangle \}}$, or in more compact notation ${\displaystyle \{|a_{i}b_{j}\rangle \}}$. 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

${\displaystyle |\psi \rangle =\sum _{i,j}c_{i,j}(|a_{i}\rangle \otimes |b_{j}\rangle )=\sum _{i,j}c_{i,j}|a_{i}b_{j}\rangle ,}$

where ${\displaystyle c_{i,j}}$ is a constant. If ${\displaystyle |\psi \rangle }$ can be written as a simple tensor, that is, in the form ${\displaystyle |\psi \rangle =|\psi _{1}\rangle \otimes |\psi _{2}\rangle }$ with ${\displaystyle |\psi _{i}\rangle }$ 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. Entangled pure states are characterized by the property that their partial states are not pure. 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 ${\displaystyle \rho =|\psi \rangle \!\langle \psi |}$ is thus entangled if and only if the von Neumann entropy of the partial state ${\displaystyle \rho _{A}\equiv \operatorname {Tr} _{B}(\rho )}$ 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.

The above discussion can be extended to the case of when the state space is infinite-dimensional with virtually nothing changed.^{[clarification needed]}

Mixed states[]

Consider the mixed state case. A mixed state of the composite system is described by a density matrix ${\displaystyle \rho }$ acting on ${\displaystyle H_{1}\otimes H_{2}}$. ρ is separable if there exist ${\displaystyle p_{k}\geq 0}$, ${\displaystyle \{\rho _{1}^{k}\}}$ and ${\displaystyle \{\rho _{2}^{k}\}}$ which are mixed states of the respective subsystems such that

${\displaystyle \rho =\sum _{k}p_{k}\rho _{1}^{k}\otimes \rho _{2}^{k}}$

where

${\displaystyle \;\sum _{k}p_{k}=1.}$

Otherwise ${\displaystyle \rho }$ is called an entangled state. We can assume without loss of generality in the above expression that ${\displaystyle \{\rho _{1}^{k}\}}$ and ${\displaystyle \{\rho _{2}^{k}\}}$ 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 ${\displaystyle \{\rho _{1}^{k}\}}$ and ${\displaystyle \{\rho _{2}^{k}\}}$ are themselves states and ${\displaystyle \;\sum _{k}p_{k}=1.}$ 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 ${\displaystyle p_{k}}$, then the state can be expressed just as ${\textstyle \rho =\rho _{1}\otimes \rho _{2},}$ and is called simply separable or product state. One property of the product state is that in terms of entropy,

${\displaystyle S(\rho )=S(\rho _{1})+S(\rho _{2}).}$

Extending 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 ${\displaystyle H=H_{1}\otimes \cdots \otimes H_{n}}$. A pure state ${\displaystyle |\psi \rangle \in H}$ is separable if it takes the form

${\displaystyle |\psi \rangle =|\psi _{1}\rangle \otimes \cdots \otimes |\psi _{n}\rangle .}$

Similarly, a mixed state ρ acting on H is separable if it is a convex sum

${\displaystyle \rho =\sum _{k}p_{k}\rho _{1}^{k}\otimes \cdots \otimes \rho _{n}^{k}.}$

Or, in the infinite-dimensional case, ρ is separable if it can be approximated in the trace norm by states of the above form.

Separability 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.^[1][2] 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. We see that 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.^[3][4][5][6] See Ref.^[7] for a review of separability criteria in discrete variable systems.

In continuous variable systems, the Peres-Horodecki criterion also applies. Specifically, Simon ^[8] 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 ${\displaystyle 1\oplus 1}$-mode Gaussian states (see Ref.^[9] for a seemingly different but essentially equivalent approach). It was later found ^[10] that Simon's condition is also necessary and sufficient for ${\displaystyle 1\oplus n}$-mode Gaussian states, but no longer sufficient for ${\displaystyle 2\oplus 2}$-mode Gaussian states. Simon's condition can be generalized by taking into account the higher order moments of canonical operators ^[11][12] or by using entropic measures.^[13][14]

Characterization via algebraic geometry[]

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 in their paper "Geometrical aspects of entanglement"^[15] 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[]

Testing for separability in the general case is an NP-hard problem.^[1][2] Leinaas et. al.^[15] 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.

See also[]

• Entanglement witness

References[]

External links[]

• "StateSeparator" web-app