Lower Bound of Concurrence Based on Positive Maps
Abstract: We study the concurrence of arbitrary dimensional bipartite quantum systems. An explicit analytical lower bound of concurrence is obtained, which detects entanglement for some quantum states better than some well-known separability criteria, and improves the lower bounds such as from the PPT, realignment criteria and the Breuer's entanglement witness.
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.