Belle experiment: Difference between revisions
en>Headbomb m Cleanup for Book:Hadronic Matter using AWB |
en>Jess Riedel mNo edit summary |
||
Line 1: | Line 1: | ||
In [[quantum mechanics]], '''separable quantum states''' are [[quantum state|states]] without [[quantum entanglement]]. | |||
== Separable pure states == | |||
For simplicity, the following assumes all relevant state spaces are finite dimensional. First, consider separability for [[pure state]]s. | |||
Let <math>H_1</math> and <math>H_2</math> be quantum mechanical state spaces, that is, finite dimensional [[Hilbert space]]s with basis states <math>\{|{a_i}\rangle\}_{i=1}^n</math> and <math>\{|{b_j}\rangle\}_{j=1}^m</math>, respectively. By a [[mathematical formulation of quantum mechanics#Mathematical structure of quantum mechanics|postulate of quantum mechanics]], the state space of the composite system is given by the [[tensor product]] | |||
:<math>H_1 \otimes H_2</math> | |||
with base states <math>\{|{a_i}\rangle\otimes |{b_j}\rangle\}</math>, or in more compact notation <math>\{|a_i b_j \rangle\}</math>. 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 | |||
: <math> | |||
|\psi\rangle = \Sigma_{i,j} c_{i,j} | a_i \rangle \otimes | b_j \rangle =\Sigma_{i,j} c_{i,j} | a_i b_j \rangle | |||
</math> | |||
If a pure state <math> |\psi\rangle \in H_1 \otimes H_2</math> can be written in the form <math>|\psi\rangle = |\psi_1\rangle \otimes |\psi_2\rangle </math> where <math>|\psi _i \rangle </math> is a pure state of the i-th subsystem, it is said to be ''separable''. Otherwise it is called ''entangled''. When a system is in an entangled pure state, it is not possible to assign states to its subsystems. This will be true, in the appropriate sense, for the mixed state case as well. | |||
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. | |||
==Separability for mixed states== | |||
Consider the mixed state case. A mixed state of the composite system is described by a [[density matrix]] <math>\rho</math> acting on <math>H_1 \otimes H_2</math>. ρ is separable if there exist <math>p_k\geq 0</math>, <math>\{ \rho_1^k \}</math> and <math>\{ \rho_2^k \}</math> which are mixed states of the respective subsystems such that | |||
:<math> | |||
\rho=\sum_k p_k \rho_1^k \otimes \rho_2^k | |||
</math> | |||
where | |||
:<math>\; | |||
\sum_k p_k = 1. | |||
</math> | |||
Otherwise <math>\rho</math> is called an entangled state. We can assume without loss of generality in the above expression that <math>\{ \rho_1^k \}</math> and <math>\{ \rho_2^k \}</math> 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 <math>\{ \rho_1^k \}</math> and <math>\{ \rho_2^k \}</math> are themselves states and <math>\; \sum_k p_k = 1.</math> If these requirements are satisfied, then we can interpret the total state as a probability distribution over uncorrelated [[product state]]s. | |||
In terms of [[quantum channel]]s, a separable state can be created from any other state using [[LOCC|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 <math>p_k</math>, then the state is called [[simply separable state|simply separable]] (or it is called a "product state"). | |||
== 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 <math>H = H_1 \otimes \cdots \otimes H_n</math>. A pure state <math>| \psi \rangle \in H</math> is separable if it takes the form | |||
:<math>| \psi \rangle = | \psi_1 \rangle \otimes \cdots \otimes | \psi_n \rangle .</math> | |||
Similarly, a mixed state ρ acting on ''H'' is separable if it is a convex sum | |||
:<math>\rho = \sum_k p_k \rho_1 ^k \otimes \cdots \otimes \rho_n ^k.</math> | |||
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'''{{anchor|quantum separability problem}} in [[quantum information theory]]. It is considered to be a difficult problem. It has been shown to be [[NP-hard]].<ref>Gurvits, L., Classical deterministic complexity of Edmonds’ problem and quantum entanglement, in | |||
Proceedings of the 35th ACM Symposium on Theory of Computing, ACM Press, New York, 2003.</ref><ref>Sevag Gharibian, Strong NP-Hardness of the Quantum Separability Problem, Quantum Information and Computation, Vol. 10, No. 3&4, pp. 343-360, 2010. arXiv:0810.4507.</ref> 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 the [[range criterion]] and [[reduction criterion]]. | |||
== 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 (mathematics)|image]] of the Segre embedding. | |||
== References == | |||
<references/> | |||
== See also == | |||
* [[Entanglement witness]] | |||
[[Category:Quantum mechanics]] | |||
[[Category:Quantum information science]] |
Revision as of 20:28, 23 January 2014
In quantum mechanics, separable quantum states are states without quantum entanglement.
Separable pure states
For simplicity, the following assumes all relevant state spaces are finite dimensional. First, consider separability for pure states.
Let and be quantum mechanical state spaces, that is, finite dimensional Hilbert spaces with basis states and , respectively. By a postulate of quantum mechanics, the state space of the composite system is given by the tensor product
with base states , 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
If a pure state can be written in the form where is a pure state of the i-th subsystem, it is said to be separable. Otherwise it is called entangled. When a system is in an entangled pure state, it is not possible to assign states to its subsystems. This will be true, in the appropriate sense, for the mixed state case as well.
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.
Separability for mixed states
Consider the mixed state case. A mixed state of the composite system is described by a density matrix acting on . ρ 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 is called simply separable (or it is called a "product state").
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 . 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.
Separability criterion
The problem of deciding whether a state is separable in general is sometimes called the separability problem<quantum separability problem>...</quantum separability problem>
in quantum information theory. It is considered to be a difficult problem. It has been shown to be NP-hard.[1][2] 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 the range criterion and reduction criterion.
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.
References
- ↑ Gurvits, L., Classical deterministic complexity of Edmonds’ problem and quantum entanglement, in Proceedings of the 35th ACM Symposium on Theory of Computing, ACM Press, New York, 2003.
- ↑ Sevag Gharibian, Strong NP-Hardness of the Quantum Separability Problem, Quantum Information and Computation, Vol. 10, No. 3&4, pp. 343-360, 2010. arXiv:0810.4507.