Entanglement purification protocols for all graph states

2006/06/30 by Caroline Kruszynska, C. Kruszynska, Akimasa Miyake +2 · 6 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.052316

published as Phys. Rev. A 74, 052316 (2006) · revtex 10 pages, 6 figures

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

Abstract

We present multiparty entanglement purification protocols that are capable of purifying arbitrary graph states directly. We develop recurrence and breeding protocols and compare our methods with strategies based on bipartite entanglement purification in static and communication scenarios. We find that direct multiparty purification is of advantage with respect to achievable yields and minimal required fidelity in static scenarios, and with respect to obtainable fidelity in the case of noisy operations in both scenarios.

Citations

• Quantum repeaters based on entanglement purification
• Quantum communication cost of preparing multipartite entanglement

Cited by

• Purification to locally maximally entangleable states
• DISTRIBUTED QUANTUM COMPUTATION ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS
• Integrating Entanglement Purification into All-Photonic Quantum Repeaters
• Purification of genuine multipartite entanglement
• Entanglement and local information access for graph states
• Simple proof of confidentiality for private quantum channels in noisy environments