2000 character limit reached
Lower Bound of Concurrence Based on Positive Maps (1104.1000v1)
Published 6 Apr 2011 in quant-ph
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.