2000 character limit reached
Lower Bounds of Concurrence for Multipartite States
Published 4 May 2012 in quant-ph | (1205.0954v1)
Abstract: We study the entanglement of multipartite quantum states. Some lower bounds of the multipartite concurrence are reviewed. We further present more effective lower bounds for detecting and qualifying entanglement, by establishing functional relations between the concurrence and the generalized partial transpositions of the multipartite 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.