2000 character limit reached
Lower bound on concurrence for arbitrary-dimensional tripartite quantum systems
Published 15 Mar 2016 in quant-ph, math-ph, and math.MP | (1603.04716v3)
Abstract: In this paper, we study the concurrence of arbitrary dimensional tripartite quantum systems. An explicit operational lower bound of concurrence is obtained in terms of the concurrence of sub-states. A given example show that our lower bound may improve the well known existing lower bounds of concurrence. The significance of our result is to get a lower bound when we study the concurrence of arbitrary dimensional 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.