Lower Bound of Concurrence Based on Positive Maps
classification
🪐 quant-ph
keywords
concurrencelowerboundcriteriaentanglementquantumsomeanalytical
read the original 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.
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.