Purification of genuine multipartite entanglement

2011/03/31 by Marcus Huber, Martin Plesch
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bipartite graph #Computer science #Mathematics #Multipartite #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Squashed entanglement #State (computer science) #Theoretical computer science #W state #quant-ph

paper · pdf · doi:10.1103/physreva.83.062321

published as Phys. Rev. A 83, 062321 (2011) · 5 pages, 2 figures

openalex publication_date 2011/06/14 · arxiv created 2011/06/16 · arxiv updated 2011/06/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

In tasks where multipartite entanglement plays a central role, state purification is, due to inevitable noise, a crucial part of the procedure. We consider a scenario exploiting the multipartite entanglement in a straightforward multipartite purification algorithm and compare it to bipartite purification procedures combined with state teleportation. While complete purification requires an infinite amount of input states in both cases, we show that for an imperfect output fidelity the multipartite procedure exhibits a major advantage in terms of input states used.

Citations

• Entanglement purification protocols for all graph states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Multiparticle entanglement purification protocols
• Classification of multiqubit mixed states: Separability and distillability properties
• Multipartite entanglement in quantum algorithms
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Quantum secret sharing
• Quantum communication cost of preparing multipartite entanglement
• Partial separability and entanglement criteria for multiqubit quantum states
• Quantum entanglement
• Entanglement detection