Weak measurement is a new way to manipulate and control quantum systems. Different from projection measurement, weak measurement only makes a small change in status. Applying weak measurement to quantum discord, Singh and Pati proposed a new kind of quantum correlations called super quantum discord (SQD) [Annals of Physics textbf{343},141(2014)]. Unfortunately, the super quantum discord is also difficult to calculate. There are only few explicit formulae about SQD. We derive an analytical formulae of SQD for general X-type two-qubit states, which surpass the conclusion for Werner states and Bell diagonal states. Furthermore, our results reveal more knowledge about the new insight of quantum correlation and give a new way to compare SQD with normal quantum discord. Finally, we analyze its dynamics under nondissipative channels.
We calculate the relative entropy of entanglement for rotationally invariant states of spin-1/2 and arbitrary spin-$j$ particles or of spin-1 particle and spin-$j$ particle with integer $j$. A lower bound of relative entropy of entanglement and an upper bound of distillable entanglement are presented for rotationally invariant states of spin-1 particle and spin-$j$ particle with half-integer $j$.
We classify biqutrit and triqutrit pure states under stochastic local operations and classical communication. By investigating the right singular vector spaces of the coefficient matrices of the states, we obtain explicitly two equivalent classes of biqutrit states and twelve equivalent classes of triqutrit states respectively.
We investigate the separability of arbitrary dimensional tripartite sys- tems. By introducing a new operator related to transformations on the subsystems a necessary condition for the separability of tripartite systems is presented.
The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed density matrices from combinatorial laplacian matrices of graphs discussed in Braunstein {it et al.} Annals of Combinatorics, {bf 10}(2006)291 to tripartite states. Then we proved that the degree condition defined in Braunstein {it et al.} Phys. Rev. A {bf 73}, (2006)012320 is sufficient and necessary for the tripartite separability of the density matrix of a nearest point graph.
