Bounds on Multipartite Concurrence and Tangle

TL;DR

This paper derives analytical bounds on multipartite concurrence and tangle, providing practical entanglement detection methods based on correlation tensors, with implications for quantum information processing.

Contribution

It introduces a new analytical lower bound for multipartite concurrence using generalized Bloch representations, enhancing entanglement detection.

Findings

Lower bound effectively witnesses genuine multipartite entanglement

Tight bounds for multipartite tangles are established

Bounds depend on partial correlation tensors, enabling experimental feasibility

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.