Bounds for multipartite concurrence
classification
🪐 quant-ph
keywords
multipartiteconcurrenceboundsentanglementlowerobtainedbipartitebound
read the original abstract
We study the entanglement of a multipartite quantum state. An inequality between the bipartite concurrence and the multipartite concurrence is obtained. More effective lower and upper bounds of the multipartite concurrence are obtained. By using the lower bound, the entanglement of more multipartite states are detected.
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.