A useful strong lower bound on two-qubit concurrence

Xue‐Na Zhu, Shao-Ming Fei

Xianfei Qi, Ting Gao, Fengli Yan

Zhihua Chen, Zhihao Ma, Otfried Gühne +1 more

Entanglement monotones, such as the concurrence, are useful tools to characterize quantum correlations in various physical systems. The computation of the concurrence involves, however, difficult optimizations and only for the simplest case of two qubits a closed formula was found by Wootters [Phys. Rev. Lett. 80, 2245 (1998)]. We show how this approach can be generalized, resulting in lower bounds on the concurrence for higher dimensional systems as well as for multipartite systems. We demonstrate that for certain families of states our results constitute the strongest bipartite entanglement criterion so far; moreover, they allow us to recognize novel families of multiparticle bound entangled states.

K. G. Paulson, S. V. M. Satyanarayana

Entanglement and mixedness of a bipartite mixed state resource are crucial for the success of quantum teleportation. Upper bounds on measures of mixedness, namely, von Neumann entropy and linear entropy beyond which the bipartite state ceases to be useful for quantum teleportation are known in the literature. In this work, we generalize these bounds and obtain rank dependent upper bounds on von Nuemann entropy and linear entropy for an arbitrary bipartite mixed state resource. We observe that the upper bounds on measures of mixedness increase with increase in the rank. For two qubit mixed states, we obtain rank dependent lower bound on the concurrence, a measure of entanglement, below which the state is useless for quantum teleportation. Werner state, which is a fourth rank state, exhibits the theoretical upper bound on mixedness among two qubit mixed states. We construct Werner like states of lower ranks and show that these states possess the theoretical rank dependent upper bounds obtained on the measures of mixedness and theoretical rank dependent lower bounds on the concurrence.

Xue‐Na Zhu, Ming Li, Shao-Ming Fei

Ning Yang, Yu Guo, Shuanping Du

Although numerous measures of entanglement have been proposed so far, the calculation of a given faithful entanglement measure is a hard work since it is always involved in some optimization process. It is, therefore, important to estimate the lower bound of a given entanglement measure for an arbitrary quantum state. This results in a subject of intensive mathematical research. In particular, along this line, the lower bounds of concurrence or other measures that are induced from concurrence have been explored a lot. Here, we investigate the lower bounds of two kinds of entanglement monotones, i.e., $q$-concurrence ($q>1$) and $α$-concurrence ($0<α<1$), or termed the parameterized entanglement monotone together. We obtain, in the light of the informationally complete ($N$, $M$)-positive operator-valued measure [($N$, $M$)-POVM], the lower bounds for the case of $\frac12<α<1$, $1<q<2$ for two-qudit states, and the case of $2\leqslant q<3$ for two-qubit states. We list several examples which show that the lower bounds based on ($N$, $M$)-POVM outperform that of GSIC-POVM and SIC-POVM, and all these measurement based bounds are better then the ones induced by positive partial transpose (PPT) and realignment criteria in literature. In addition, we obtain an analytical formula of the parameterized entanglement monotone with $\frac12<α<1$ and $1<q<2$ for the isotropic state.