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 (21)
- Quantum entanglement
- Quantum Cryptography
- Quantum secret sharing
- Distributed Entanglement
- How to share a quantum secret
- Measurement-based quantum computation
- Decoherence and multipartite entanglement
- Taming multiparticle entanglement
- Detection of high-dimensional genuine multi-partite entanglement of mixed states
- I-concurrence and tangle for isotropic states
- Entanglement of three-qubit Greenberger-Horne-Zeilinger-symmetric states
- Multipartite entanglement detection from correlation tensors
- Measuring Multipartite Concurrence with a Single Factorizable Observable
- Entanglement for rank-2 mixed states
- Further results on entanglement detection and quantification from the correlation matrix criterion
- A lower bound of concurrence for multipartite quantum states
- Quantum Separability Criteria for Arbitrary Dimensional Multipartite States
- An Experimentally accessible geometric measure for entanglement in -qubit pure states
- Genuine multipartite entanglement detection and lower bound of multipartite concurrence
- Entanglement Enhances Security in Secret Sharing
- Bell inequalities for multipartite qubit quantum systems and their maximal violation