A lower bound of concurrence for multipartite quantum systems
classification
🪐 quant-ph
keywords
lowerquantumsystemsboundconcurrenceotimes2boundsmultipartite
read the original abstract
We present a lower bound of concurrence for four-partite systems in terms of the concurrence for $M\, (2\leq M\leq 3)$ part quantum systems and give an analytical lower bound for $2\otimes2\otimes2\otimes2$ mixed quantum sates. It is shown that these lower bounds are able to improve the existing bounds and detect entanglement better. Furthermore, our approach can be generalized to multipartite quantum systems.
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.