pith. sign in

arxiv: 1512.08845 · v1 · pith:YAE2EKW7new · submitted 2015-12-30 · 🪐 quant-ph

Genuine multipartite entanglement detection and lower bound of multipartite concurrence

classification 🪐 quant-ph
keywords multipartitegenuineentanglementconcurrencelowerbipartiteboundclassification
0
0 comments X
read the original abstract

The problems of genuine multipartite entanglement detection and classification are challenging. We show that a multipartite quantum state is genuine multipartite entangled if the multipartite concurrence is larger than certain quantities given by the number and the dimension of the subsystems. This result also provides a classification of various genuine multipartite entanglement. Then, we present a lower bound of the multipartite concurrence in terms of bipartite concurrences. While various operational approaches are available for providing lower bounds of bipartite concurrences, our results give an effective operational way to detect and classify the genuine multipartite entanglement. As applications, the genuine multipartite entanglement of tripartite systems is analyzed in detail.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.