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/0702155

Entanglement purification with two-way classical communication

Leung, Alan W., Peter W. Shor

Published Feb 15, 2007• 4 citations
arXivHTMLPDF

Abstract

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.
DOI
10.48550/arxiv.quant-ph/0702155

Related papers

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•4 citations

Adaptive protocols for the quantum depolarizing channel

Alan W. Leung

In the first part, 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, we show that the yields of these protocols are higher than the yield of universal hashing for F less than 0.99999 and as F goes to 1. In the second part, we define, for any quantum discrete memoryless channel, quantum entanglement capacity with classical feedback, a quantity that lies between two other well-studied quantities. These two quantities - namely the quantum capacity assisted by two-way classical communication and the quantum capacity with classical feedback - are widely conjectured to be different. We then present adaptive protocols for this newly-defined quantity on the quantum depolarizing channel. These protocols in turn imply new lower bounds on the quantum capacity with classical feedback.

•Jan 1, 2007•1 citation

Capacity-achieving entanglement purification protocol for Pauli dephasing channel

Özlem Erkılıç, Matthew S. Winnel, Aritra Das +4 more

Abstract Quantum communication enables secure information transmission and entanglement distribution, but these tasks are fundamentally limited by the capacities of quantum channels. While quantum repeaters can mitigate losses and noise, entanglement swapping via a central node is ineffective against the Pauli dephasing channel due to degradation from Bell-state measurements. This suggests that purifying distributed Bell states before entanglement swapping is necessary. Although one-way hashing codes are known to saturate the dephasing channel capacity, no explicit two-way purification protocol has previously been shown to achieve this bound. In this work, we present a two-way entanglement purification protocol with an explicit, scalable circuit that asymptotically achieves the dephasing channel capacity. With each iteration, the fidelity of Bell states increases. At the final round, the residual dephasing error is suppressed doubly-exponentially, scaling as O ( p 2 n ) , enabling near-perfect Bell pairs for any fixed number of purification rounds n . The explicit circuit we propose is versatile and applicable to any number of Bell pairs, offering a practical solution for mitigating decoherence in quantum networks and distributed quantum computing.

arXiv:2411.14573•Quantum Science and Technology•Jan 20, 2026•2 citations

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

Improved two-party and multi-party purification protocols

Elitza Maneva, John A. Smolin

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.

arXiv:quant-ph/0003099•Contemporary mathematics - American Mathematical Society•Jan 1, 2002•72 citations

Mixed-state entanglement and quantum error correction

Charles H. Bennett, David Peter Divincenzo, John A. Smolin +1 more

Entanglement purification protocols (EPPs) and quantum error-correcting codes (QECCs) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbitrary quantum state |\ensuremath{\xi}〉 can be transmitted at some rate Q through a noisy channel \ensuremath{\chi} without degradation. We prove that an EPP involving one-way classical communication and acting on mixed state M^(\ensuremath{\chi}) (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel \ensuremath{\chi}) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts ${\mathit{D}}_{1}$(M) and ${\mathit{D}}_{2}$(M) that can be locally distilled from it by EPPs using one- and two-way classical communication, respectively, and give an exact expression for E(M) when M is Bell diagonal. While EPPs require classical communication, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way communication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way communication is available. We exhibit a family of codes based on universal hashing able to achieve an asymptotic Q (or D) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single-error-correcting quantum block code. We prove that iff a QECC results in high fidelity for the case of no error then the QECC can be recast into a form where the encoder is the matrix inverse of the decoder. \textcopyright{} 1996 The American Physical Society.

arXiv:quant-ph/9604024•Physical Review A•Nov 1, 1996•5,363 citations
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.
In the first part, 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, we show that the yields of these protocols are higher than the yield of universal hashing for F less than 0.99999 and as F goes to 1. In the second part, we define, for any quantum discrete memoryless channel, quantum entanglement capacity with classical feedback, a quantity that lies between two other well-studied quantities. These two quantities - namely the quantum capacity assisted by two-way classical communication and the quantum capacity with classical feedback - are widely conjectured to be different. We then present adaptive protocols for this newly-defined quantity on the quantum depolarizing channel. These protocols in turn imply new lower bounds on the quantum capacity with classical feedback.
Abstract Quantum communication enables secure information transmission and entanglement distribution, but these tasks are fundamentally limited by the capacities of quantum channels. While quantum repeaters can mitigate losses and noise, entanglement swapping via a central node is ineffective against the Pauli dephasing channel due to degradation from Bell-state measurements. This suggests that purifying distributed Bell states before entanglement swapping is necessary. Although one-way hashing codes are known to saturate the dephasing channel capacity, no explicit two-way purification protocol has previously been shown to achieve this bound. In this work, we present a two-way entanglement purification protocol with an explicit, scalable circuit that asymptotically achieves the dephasing channel capacity. With each iteration, the fidelity of Bell states increases. At the final round, the residual dephasing error is suppressed doubly-exponentially, scaling as O ( p 2 n ) , enabling near-perfect Bell pairs for any fixed number of purification rounds n . The explicit circuit we propose is versatile and applicable to any number of Bell pairs, offering a practical solution for mitigating decoherence in quantum networks and distributed quantum computing.
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.
Entanglement purification protocols (EPPs) and quantum error-correcting codes (QECCs) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbitrary quantum state |\ensuremath{\xi}〉 can be transmitted at some rate Q through a noisy channel \ensuremath{\chi} without degradation. We prove that an EPP involving one-way classical communication and acting on mixed state M^(\ensuremath{\chi}) (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel \ensuremath{\chi}) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts D1{\mathit{D}}_{1}D1​(M) and D2{\mathit{D}}_{2}D2​(M) that can be locally distilled from it by EPPs using one- and two-way classical communication, respectively, and give an exact expression for E(M) when M is Bell diagonal. While EPPs require classical communication, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way communication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way communication is available. We exhibit a family of codes based on universal hashing able to achieve an asymptotic Q (or D) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single-error-correcting quantum block code. We prove that iff a QECC results in high fidelity for the case of no error then the QECC can be recast into a form where the encoder is the matrix inverse of the decoder. \textcopyright{} 1996 The American Physical Society.