2005/11/15 by Kai Chen, Sergio Albeverio, Shao-Ming Fei · 8 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.1103/physrevlett.95.210501
published as Phys. Rev. Lett. 95, 210501 (2005) · 4 pages
openalex publication_date 2005/11/15 · arxiv created 2005/11/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
We give an explicit tight lower bound for the entanglement of formation for arbitrary bipartite mixed states by using the convex hull construction of a certain function. This is achieved by revealing a novel connection among the entanglement of formation, the well-known Peres-Horodecki, and realignment criteria. The bound gives a quite simple and efficiently computable way to evaluate quantitatively the degree of entanglement for any bipartite quantum state.