Lower bounds of concurrence for tripartite quantum systems

2006/11/13 by Xiu-Hong Gao, Shao-Ming Fei, Ke Wu · 3 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/physreva.74.050303

published as Phys. Rev. A 74 (Rapid Commun.)(2006)050303 · 10 pages

openalex publication_date 2006/11/13 · arxiv created 2006/11/14 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We derive an analytical lower bound for the concurrence of tripartite quantum mixed states. A functional relation is established relating concurrence and the generalized partial transpositions.

Citations

• Distinguishing Separable and Entangled States
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Entanglement of Formation of Bipartite Quantum States
• Separability Criterion for Density Matrices
• Reflections upon separability and distillability
• Concurrence of Arbitrary Dimensional Bipartite Quantum States
• Separability of mixed states: necessary and sufficient conditions

Cited by

• A NOTE ON QUANTUM ENTANGLEMENT AND PPT
• Triangle inequalities in coherence measures and entanglement concurrence
• Bound of entanglement of assistance and monogamy constraints