2006/11/30 by Julio I. de Vicente
Computer Science · Mathematics · Physics and Astronomy · #Applied mathematics #Bipartite graph #Chen #Complement (music) #Concurrence #Discrete mathematics #Graph #Law #Mathematics #Norm (philosophy) #Physics #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Representation (politics) #Statistical physics #quant-ph
paper · pdf · doi:10.1103/physreva.75.052320
published as Phys. Rev. A 75, 052320 (2007); 77, 039903(E) (2008) · 5 pages, 1 figure; minor changes, references added; final version: minor correction in proof of lemma 1, scope of theorem 2 clarified, to appear in PRA; mistake in proof of lemma 1 of published version corrected, results unchanged
openalex publication_date 2007/05/17 · arxiv created 2008/02/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We obtain analytical lower bounds on the concurrence of bipartite quantum systems in arbitrary dimensions related to the violation of separability conditions based on local uncertainty relations and on the Bloch representation of density matrices. We also illustrate how these results complement and improve those recently derived [Chen, Albeverio, and Fei, Phys. Rev. Lett. 95, 040504 (2005)] by considering the Peres-Horodecki and the computable cross-norm or realignment criteria.