Physics – Quantum Physics
Scientific paper
2010-02-25
Physics
Quantum Physics
22 pages, 5 figures included, Fig.1, Fig. 3(a,b,c,d), Fig. 4(a,b,c,d), Fig. 5(a,b) and Fig. 6(a,b) are not included due to fil
Scientific paper
It is known that relative entropy of entanglement for entangled state $\rho$ is defined via its closest separable (or positive partial transpose) state $\sigma$. Recently, it has been shown how to find $\rho$ provided that $\sigma$ is given in two-qubit system. In this paper we study on the inverse process, i.e. how to find $\sigma$ provided that $\rho$ is given. It is shown that if $\rho$ is one of Bell-diagonal, generalized Vedral-Plenio and generalized Horodecki states, one can always find $\sigma$ from a geometrical point of view. This is possible due to the following two facts: (i) The Bloch vectors of $\rho$ and $\sigma$ are identical with each other (ii) The qubit-interaction vector of $\sigma$ can be computed from a crossing point between minimal geometrical object, in which all separable states reside in the presence of Bloch vectors, and a straight line, which connects the point corresponding to the qubit-interaction vector of $\rho$ and the nearest vertex of the maximal tetrahedron, where all two-qubit states reside. It is shown, however, that these nice properties are not maintained for the arbitrary two-qubit states.
Hwang Mi-Ra
Jung Eylee
Kim Hungsoo
Park DaeKil
No associations
LandOfFree
Difficulties in analytic computation for relative entropy of entanglement 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 Difficulties in analytic computation for relative entropy of entanglement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Difficulties in analytic computation for relative entropy of entanglement will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-379450