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

Calculation of the Branching Ratio of B−→hc+K−B^{-}\to h_{c}+K^{-} in PQCD

The branching ratio of $B^-\to h_c+K^-$ is re-evaluated in the PQCD approach. In this theoretical framework all the phenomenological parameters in the wavefunctions and Sudakov factor are priori fixed by fitting other experimental data, and in the whole numerical computations we do not introduce any new parameter. Our results are consistent with the upper bounds set by the Babar and Belle measurements.Comment: 12 pages, 1 figure, version to appear in Phys. Rev.

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