2005/06/30 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 #cond-mat.mes-hall #quant-ph
paper · pdf · doi:10.1103/physrevlett.95.040504
published as Phys. Rev. Lett. 95, 040504 (2005) · 4 pages, published version
arxiv created 2005/07/22 · arxiv updated 2009/12/01
We derive an analytical lower bound for the concurrence of a bipartite quantum state in arbitrary dimension. A functional relation is established relating concurrence, the Peres-Horodecki criterion and the realignment criterion. We demonstrate that our bound is exact for some mixed quantum states. The significance of our method is illustrated by giving a quantitative evaluation of entanglement for many bound entangled states, some of which fail to be identified by the usual concurrence estimation method.