2000 character limit reached
A lower bound of concurrence for multipartite quantum systems
Published 30 Dec 2017 in quant-ph | (1801.00078v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.