2000 character limit reached
Lower Bound of Multipartite Concurrence Based on Sub-quantum State Decomposition
Published 8 Aug 2012 in quant-ph | (1208.1745v1)
Abstract: We study the entanglement of tripartite quantum states and provide analytical lower bound of concurrence in terms of the concurrence of sub-states. The lower bound may improve all the existing lower bounds of concurrence. The approach is generalized to arbitrary dimensional 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.