Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0003099

Improved two-party and multi-party purification protocols

Elitza Maneva, John A. Smolin

Published Mar 21, 2000• 0 citations
arXivHTMLPDF

Abstract

We present an improved protocol for entanglement purification of bipartite mixed states using several states at a time rather than two at a time as in the traditional recurrence method. We also present a generalization of the hashing method to n-partite cat states, which achieves a finite yield of pure cat states for any desired fidelity. Our results are compared to previous protocols.

DOI
10.48550/arxiv.quant-ph/0003099

Related papers

Entanglement purification with two-way classical communication

A.W. Leung, Peter W. Shor

We present an entanglement purification protocol for Bell-diagonal mixed states and show that this protocol has improved yields over the recurrence methods and the method proposed by Maneva-Smolin. We then generalize this protocol to a family, and show that this family is also a generalization of the recurrence method, the modified recurrence method and the method proposed by Maneva-Smolin. We show that the yields of these protocols on the Werner state $\rho_F$ are higher than those of universal hashing for F less than 0.99999 and as F goes to 1.

Quantum Information and Computation•Mar 1, 2008•5 citations

Entanglement purification protocols for all graph states

Caroline Kruszynska, Akimasa Miyake, Hans J. Briegel +1 more

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.

arXiv:quant-ph/0606090•Physical Review A•Nov 10, 2006•75 citations

Efficient entanglement purification protocols for d -level systems

Jorge Miguel-Ramiro, Wolfgang Dür

We introduce entanglement purification protocols for $d$-level systems (qudits) with improved efficiency as compared to previous protocols. While we focus on protocols for bipartite systems, we also propose generalizations to multipartite qudit systems. The schemes we introduce include recurrence protocols that operate on two copies, as well as hashing protocols that operate on large ensembles. We analyze properties of the protocols with respect to minimal required fidelity and yield, and study their performance in the presence of noise and imperfections. We determine error thresholds and study the dependence on local dimension. We find that our schemes do not only outperform previous approaches, but also show an improved robustness and better efficiency with increasing dimension. While error thresholds for different system sizes are not directly comparable, our results nevertheless suggest that quantum information processing using qudits, in particular for long-distance quantum communication, may offer an advantage over approaches based on qubit systems.

arXiv:1806.10162•Physical Review A•Oct 8, 2018•48 citations

Entanglement purification with two-way classical communication

Leung, Alan W., Peter W. Shor

We present an improved protocol for entanglement purification of bipartite mixed states. The protocol requires two-way classical communication and hence implies an improved lower bound on the quantum capacity with two-way classical communication of the quantum depolarizing channel.

arXiv:quant-ph/0702155•Feb 15, 2007•2 citations

Adaptive Entanglement Purification Protocols with Two-way Classical Communication

Leung, Alan W., Peter W. Shor

We present a family of entanglement purification protocols that generalize four previous methods, namely the recurrence method, the modified recurrence method, and the two methods proposed by Maneva-Smolin and Leung-Shor. We will show that this family of protocols have improved yields over a wide range of initial fidelities F, and hence imply new lower bounds on the quantum capacity assisted by two-way classical communication of the quantum depolarizing channel. In particular, the yields of these protocols are higher than the yield of universal hashing for F less than 0.993 and as F goes to 1.

arXiv:quant-ph/0702156•Feb 15, 2007•2 citations

Entanglement purification protocol for a mixture of a pure entangled state and a pure product state

Mikołaj Czechlewski, Andrzej Grudka, Satoshi Ishizaka +1 more

We present an entanglement purification protocol for a mixture of a pure entangled state and a pure product state, which are orthogonal to each other. The protocol is a combination of bisection method and one-way hashing protocol. We give recursive formula for the rate of the protocol for different states, i.e., the number of maximally entangled two-qubit pairs obtained with the protocol per a single copy of the initial state. We also calculate numerically the rate for some states.

arXiv:0811.4046•Physical Review A•Jul 30, 2009•14 citations
We present an improved protocol for entanglement purification of bipartite mixed states using several states at a time rather than two at a time as in the traditional recurrence method. We also present a generalization of the hashing method to n-partite cat states, which achieves a finite yield of pure cat states for any desired fidelity. Our results are compared to previous protocols.
We present an entanglement purification protocol for Bell-diagonal mixed states and show that this protocol has improved yields over the recurrence methods and the method proposed by Maneva-Smolin. We then generalize this protocol to a family, and show that this family is also a generalization of the recurrence method, the modified recurrence method and the method proposed by Maneva-Smolin. We show that the yields of these protocols on the Werner state ρF\rho_FρF​ are higher than those of universal hashing for F less than 0.99999 and as F goes to 1.
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.
We introduce entanglement purification protocols for ddd-level systems (qudits) with improved efficiency as compared to previous protocols. While we focus on protocols for bipartite systems, we also propose generalizations to multipartite qudit systems. The schemes we introduce include recurrence protocols that operate on two copies, as well as hashing protocols that operate on large ensembles. We analyze properties of the protocols with respect to minimal required fidelity and yield, and study their performance in the presence of noise and imperfections. We determine error thresholds and study the dependence on local dimension. We find that our schemes do not only outperform previous approaches, but also show an improved robustness and better efficiency with increasing dimension. While error thresholds for different system sizes are not directly comparable, our results nevertheless suggest that quantum information processing using qudits, in particular for long-distance quantum communication, may offer an advantage over approaches based on qubit systems.
We present a family of entanglement purification protocols that generalize four previous methods, namely the recurrence method, the modified recurrence method, and the two methods proposed by Maneva-Smolin and Leung-Shor. We will show that this family of protocols have improved yields over a wide range of initial fidelities F, and hence imply new lower bounds on the quantum capacity assisted by two-way classical communication of the quantum depolarizing channel. In particular, the yields of these protocols are higher than the yield of universal hashing for F less than 0.993 and as F goes to 1.