Lower Bounds of Concurrence for Multipartite States

We study the entanglement of multipartite quantum states. Some lower bounds of the multipartite concurrence are reviewed. We further present more effective lower bounds for detecting and qualifying entanglement, by establishing functional relations between the concurrence and the generalized partial transpositions of the multipartite systems.Comment: 13 page

Diffeomorphism Invariance of Geometric Descriptions of Palatini and Ashtekar Gravity

In this paper, we explicitly prove the presymplectic forms of the Palatini and Ashtekar gravity to be zero along gauge orbits of the Lorentz and diffeomorphism groups, which ensures the diffeomorphism invariance of these theories.Comment: Latex, 6 page

Lower Bound of Multipartite Concurrence Based on Sub-quantum State Decomposition

We study the entanglement of tripartite quantum states and provide analytical lower bound of concurrence in terms of the concurrence of sub-states. The lower bound may improve all the existing lower bounds of concurrence. The approach is generalized to arbitrary dimensional multipartite systems.Comment: 5 page

Quantifying quantum coherence based on the generalized α−z−\alpha-z-relative Reˊ\acute{e}nyi entropy

We present a family of coherence quantifiers based on the generalized $\alpha-z-$relative R$\acute{e}$nyi entropy. These quantifiers satisfy all the standard criteria for well-defined measures of coherence, and include some existing coherence measures as special cases.Comment: 9 pages, 1 figure

A lower bound of concurrence for multipartite quantum systems

We present a lower bound of concurrence for four-partite systems in terms of the concurrence for $M\, (2\leq M\leq 3)$ part quantum systems and give an analytical lower bound for $2\otimes2\otimes2\otimes2$ mixed quantum sates. It is shown that these lower bounds are able to improve the existing bounds and detect entanglement better. Furthermore, our approach can be generalized to multipartite quantum systems.Comment: 9 pages,2 figure