Lower Bound of Concurrence Based on Generalized Positive Maps
classification
🪐 quant-ph
keywords
boundconcurrencelowerpositiveanalyticalarbitrarybetterbipartite
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.