Bound of entanglement of assistance and monogamy constraints

2009/04/18 by Zong-Guo Li, Shao-Ming Fei, Sergio Albeverio +2
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Bound state #Combinatorics #Mathematical analysis #Mathematics #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Qubit #Squashed entanglement #State (computer science) #Upper and lower bounds #W state #quant-ph

paper · pdf · doi:10.1103/physreva.80.034301

4 pages

arxiv created 2009/04/18 · openalex publication_date 2009/09/25 · arxiv updated 2015/05/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

We investigate the entanglement of assistance which quantifies capabilities of producing pure bipartite entangled states from a pure tripartite state. The lower bound and upper bound of entanglement of assistance are obtained. In the light of the upper bound, monogamy constraints are proved for arbitrary n-qubit states.

Citations

• Evolution equation of entanglement for bipartite systems
• Lower bounds of concurrence for tripartite quantum systems
• Concurrence of Mixed Multipartite Quantum States
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Entanglement versus Correlations in Spin Systems
• General Monogamy Inequality for Bipartite Qubit Entanglement
• Deterministic entanglement of assistance and monogamy constraints
• Concurrence of Arbitrary Dimensional Bipartite Quantum States
• Universal state inversion and concurrence in arbitrary dimensions
• Entanglement of collaboration
• Distributed Entanglement