2009/02/28 by Joonwoo Bae, Markus Tiersch, Simeon Sauer +5 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Bipartite graph #Bound state #Class (philosophy) #Computer science #Concurrence #Construct (python library) #Discrete mathematics #Mathematical analysis #Mathematics #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Squashed entanglement #Statistical physics #Upper and lower bounds #quant-ph
paper · pdf · doi:10.1103/physreva.80.022317
published as Phys. Rev. A 80, 022317 (2009) · 5 pages, 4 figures. Published version
openalex publication_date 2009/08/13 · arxiv created 2009/08/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We derive an explicit analytic estimate for the entanglement of a large class of bipartite quantum states, which extends into bound entanglement regions. This is done by using an efficiently computable concurrence lower bound, which is further employed to numerically construct a volume of 3\ifmmode×\else\texttimes\fi3 bound entangled states.