Jump to content

Separable state

From Wikipedia, the free encyclopedia

Inquantum mechanics,separable statesare multipartitequantum statesthat can be written as a convex combination of product states.Product statesare 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 ofpure statesthe definition simplifies: a pure state is separable if and only if it is a product state.

A state is said to beentangledif it is not separable. In general, determining if a state is separable is not straightforward and the problem is classed asNP-hard.

Separability of bipartite systems

[edit]

Consider first composite states with two degrees of freedom, referred to asbipartite states.By a postulate of quantum mechanics these can be described as vectors in thetensor productspace.In this discussion we will focus on the case of theHilbert spacesandbeing finite-dimensional.

Pure states

[edit]

Letandbe orthonormal bases forand,respectively. A basis foris 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

whereis a constant. Ifcan be written as asimple tensor,that is, in the formwitha pure state in thei-th space, it is said to be aproduct state,and, in particular,separable.Otherwise it is calledentangled.Note that, even though the notions ofproductandseparablestates coincide for pure states, they do not in the more general case of mixed states.

Pure states are entangled if and only if theirpartial statesare notpure.To see this, write theSchmidt decompositionofas

whereare positive real numbers,is the Schmidt rank of,andandare sets of orthonormal states inand,respectively. The stateis entangled if and only if.At the same time, the partial state has the form

It follows thatis pure --- that is, is projection with unit-rank --- if and only if,which is equivalent tobeing 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, asdensity matrices.A pure stateis thus entangled if and only if thevon Neumann entropyof the partial stateis nonzero.

Formally, the embedding of a product of states into the product space is given by theSegre 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,the states,,,are all product (and thus separable) pure states, as iswith.On the other hand, states likeorare not separable.

Mixed states

[edit]

Consider the mixed state case. A mixed state of the composite system is described by adensity matrixacting on.Such a stateis separable if there exist,andwhich are mixed states of the respective subsystems such that

where

Otherwiseis called an entangled state. We can assume without loss of generality in the above expression thatandare all rank-1 projections, that is, they representpure ensemblesof the appropriate subsystems. It is clear from the definition that the family of separable states is aconvex 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 thatandare themselves states andIf these requirements are satisfied, then we can interpret the total state as a probability distribution over uncorrelatedproduct states.

In terms ofquantum channels,a separable state can be created from any other state usinglocal actions and classical communicationwhile an entangled state cannot.

When the state spaces are infinite-dimensional, density matrices are replaced by positivetrace classoperators 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 asand is calledsimply separableorproduct state.One property of the product state is that in terms ofentropy,

Extending to the multipartite case

[edit]

The above discussion generalizes easily to the case of a quantum system consisting of more than two subsystems. Let a system havensubsystems and have state space.A pure stateis separable if it takes the form

Similarly, a mixed state ρ acting onHis 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

[edit]

The problem of deciding whether a state is separable in general is sometimes calledthe separability probleminquantum information theory.It is considered to be a difficult problem. It has been shown to beNP-hardin 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.

Aseparability criterionis a necessary condition a state must satisfy to be separable. In the low-dimensional (2 X 2and2 X 3) cases, thePeres-Horodecki criterionis actually a necessary and sufficient condition for separability. Other separability criteria include (but not limited to) therange 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, thePeres-Horodecki criterionalso 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-mode Gaussian states (see Ref.[10]for a seemingly different but essentially equivalent approach). It was later found[11]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[12][13]or by using entropic measures.[14][15]

Characterization via algebraic geometry

[edit]

Quantum mechanics may be modelled on aprojective Hilbert space,and thecategorical productof two such spaces is theSegre embedding.In the bipartite case, a quantum state is separable if and only if it lies in theimageof the Segre embedding. Jon Magne Leinaas,Jan MyrheimandEirik Ovrumin 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

[edit]

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

[edit]

References

[edit]
  1. ^Gharahi, Masoud; Mancini, Stefano; Ottaviani, Giorgio (October 1, 2020)."Fine-structure classification of multiqubit entanglement by algebraic geometry".Physical Review Research.2(4): 043003.arXiv:1910.09665.Bibcode:2020PhRvR...2d3003G.doi:10.1103/PhysRevResearch.2.043003.S2CID204824024.
  2. ^abGurvits, 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.
  3. ^abSevag 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.
  4. ^Hofmann, Holger F.; Takeuchi, Shigeki (September 22, 2003). "Violation of local uncertainty relations as a signature of entanglement".Physical Review A.68(3): 032103.arXiv:quant-ph/0212090.Bibcode:2003PhRvA..68c2103H.doi:10.1103/PhysRevA.68.032103.S2CID54893300.
  5. ^Gühne, Otfried (March 18, 2004). "Characterizing Entanglement via Uncertainty Relations".Physical Review Letters.92(11): 117903.arXiv:quant-ph/0306194.Bibcode:2004PhRvL..92k7903G.doi:10.1103/PhysRevLett.92.117903.PMID15089173.S2CID5696147.
  6. ^Gühne, Otfried; Lewenstein, Maciej (August 24, 2004). "Entropic uncertainty relations and entanglement".Physical Review A.70(2): 022316.arXiv:quant-ph/0403219.Bibcode:2004PhRvA..70b2316G.doi:10.1103/PhysRevA.70.022316.S2CID118952931.
  7. ^Huang, Yichen (July 29, 2010). "Entanglement criteria via concave-function uncertainty relations".Physical Review A.82(1): 012335.Bibcode:2010PhRvA..82a2335H.doi:10.1103/PhysRevA.82.012335.
  8. ^Gühne, Otfried; Tóth, Géza (2009). "Entanglement detection".Physics Reports.474(1–6):1–75.arXiv:0811.2803.Bibcode:2009PhR...474....1G.doi:10.1016/j.physrep.2009.02.004.S2CID119288569.
  9. ^Simon, R. (2000). "Peres-Horodecki Separability Criterion for Continuous Variable Systems".Physical Review Letters.84(12):2726–2729.arXiv:quant-ph/9909044.Bibcode:2000PhRvL..84.2726S.doi:10.1103/PhysRevLett.84.2726.PMID11017310.S2CID11664720.
  10. ^Duan, Lu-Ming; Giedke, G.; Cirac, J. I.; Zoller, P. (2000). "Inseparability Criterion for Continuous Variable Systems".Physical Review Letters.84(12):2722–2725.arXiv:quant-ph/9908056.Bibcode:2000PhRvL..84.2722D.doi:10.1103/PhysRevLett.84.2722.PMID11017309.S2CID9948874.
  11. ^Werner, R. F.; Wolf, M. M. (2001). "Bound Entangled Gaussian States".Physical Review Letters.86(16):3658–3661.arXiv:quant-ph/0009118.Bibcode:2001PhRvL..86.3658W.doi:10.1103/PhysRevLett.86.3658.PMID11328047.S2CID20897950.
  12. ^Shchukin, E.; Vogel, W. (2005). "Inseparability Criteria for Continuous Bipartite Quantum States".Physical Review Letters.95(23): 230502.arXiv:quant-ph/0508132.Bibcode:2005PhRvL..95w0502S.doi:10.1103/PhysRevLett.95.230502.PMID16384285.S2CID28595936.
  13. ^Hillery, Mark; Zubairy, M.Suhail (2006). "Entanglement Conditions for Two-Mode States".Physical Review Letters.96(5): 050503.arXiv:quant-ph/0507168.Bibcode:2006PhRvL..96e0503H.doi:10.1103/PhysRevLett.96.050503.PMID16486912.S2CID43756465.
  14. ^Walborn, S.; Taketani, B.; Salles, A.; Toscano, F.; de Matos Filho, R. (2009). "Entropic Entanglement Criteria for Continuous Variables".Physical Review Letters.103(16): 160505.arXiv:0909.0147.Bibcode:2009PhRvL.103p0505W.doi:10.1103/PhysRevLett.103.160505.PMID19905682.S2CID10523704.
  15. ^Yichen Huang (October 2013). "Entanglement Detection: Complexity and Shannon Entropic Criteria".IEEE Transactions on Information Theory.59(10):6774–6778.doi:10.1109/TIT.2013.2257936.S2CID7149863.
  16. ^abLeinaas, Jon Magne; Myrheim, Jan; Ovrum, Eirik (July 19, 2006)."Geometrical aspects of entanglement".Physical Review A.74(1).arXiv:quant-ph/0605079.doi:10.1103/PhysRevA.74.012313.ISSN1050-2947.
[edit]