Scalable Ellipsoidal Classification for Bipartite Quantum States

Details Scalable Ellipsoidal Classification for Bipartite Quantum States Scalable Ellipsoidal Classification for Bipartite Quantum States

2008-06-30

arxiv.org/abs/0806.4855v2

Physics

Quantum Physics

8 pages, 5 figures, 3 tables. Revised version, to appear in Physical Review A

Scientific paper

10.1103/PhysRevA.78.052306

The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^{2}- 1$, whose components are the projections of the matrix onto some selected basis. We suggest a method to test separability, based on successive optimization programs. First, we find the Minimum Volume Covering Ellipsoid that encloses a particular set of properly vectorized bipartite separable states, and then we compute the Euclidean distance of an arbitrary vectorized bipartite Density Operator to this ellipsoid. If the vectorized Density Operator falls inside the ellipsoid, it is regarded as separable, otherwise it will be taken as entangled. Our method is scalable and can be implemented straightforwardly in any desired dimension. Moreover, we show that it allows for detection of Bound Entangled States

Affiliated with

Also associated with

No associations

Rating

Scalable Ellipsoidal Classification for Bipartite Quantum States does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Scalable Ellipsoidal Classification for Bipartite Quantum States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scalable Ellipsoidal Classification for Bipartite Quantum States will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154838