Papers
Topics
Authors
Recent
Search
2000 character limit reached

Lower Bound of Concurrence Based on Positive Maps

Published 6 Apr 2011 in quant-ph | (1104.1000v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.