2000 character limit reached
Bounds for multipartite concurrence
Published 19 May 2010 in quant-ph | (1005.3356v1)
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.
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.