2006/06/22 by Heinz-Peter Breuer · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1088/0305-4470/39/38/010
published as J. Phys. A: Math. Gen. 39, 11847 (2006) · 8 pages, 2 figures
arxiv created 2006/06/22 · openalex publication_date 2006/09/05 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Employing a recently proposed separability criterion we develop analytical lower bounds for the concurrence and for the entanglement of formation of bipartite quantum systems. The separability criterion is based on a nondecomposable positive map which operates on state spaces with even dimension N >= 4, and leads to a class of nondecomposable optimal entanglement witnesses. It is shown that the bounds derived here complement and improve the existing bounds obtained from the criterion of positive partial transposition and from the realignment criterion.