Lower Bound of Concurrence Based on Generalized Positive Maps

preprint2014arXivOpen access

Abstract

We study the concurrence of arbitrary dimensional bipartite quantum systems. By using a positive but not completely positive map, we present an analytical lower bound of concurrence. Detailed examples are used to show that our bound can detect entanglement better and can improve the well known existing lower bounds.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.