Bounds on Multipartite Concurrence and Tangle
arXiv:1608.01592 · doi:10.1007/s11128-016-1385-x
Abstract
We present an analytical lower bound of multipartite concurrence based on the generalized Bloch representations of density matrices. It is shown that the lower bound can be used as an effective entanglement witness of genuine multipartite entanglement. Tight lower and upper bounds for multipartite tangles are also derived. Since the lower bounds depend on just part of the correlation tensors, the result is experimentally feasible.
10 pages,no figure
References in corpus (7)
- Taming multiparticle entanglement
- Measuring Multipartite Concurrence with a Single Factorizable Observable
- Further results on entanglement detection and quantification from the correlation matrix criterion
- A lower bound of concurrence for multipartite quantum states
- An Experimentally accessible geometric measure for entanglement in -qubit pure states
- Entanglement Enhances Security in Secret Sharing
- Bell inequalities for multipartite qubit quantum systems and their maximal violation