2004/11/18 by Florian Mintert, Andreas Buchleitner · 3 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Concurrence #Discrete mathematics #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Quantum state #State (computer science) #Statistical physics #quant-ph
paper · pdf · doi:10.1103/physreva.72.012336
arxiv created 2004/11/18 · openalex publication_date 2005/07/27 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We derive an analytic approximation for the concurrence of weakly mixed bipartite quantum states---typical objects in state of the art experiments. This approximation is shown to be a lower bound of the concurrence of arbitrary states.