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

Adaptive Entanglement Purification Protocols with Two-way Classical Communication

Leung, Alan W., Peter W. Shor

Published Feb 15, 2007• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.quant-ph/0702156

Related papers

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

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

Quantum entanglement capacity with classical feedback

Alan W. Leung

For any quantum discrete memoryless channel, we define a quantity called quantum entanglement capacity with classical feedback $({E}_{B})$, and we show that this quantity lies between two other well-studied quantities. These two quantities---namely the quantum capacity assisted by two-way classical communication $({Q}_{2})$ and the quantum capacity with classical feedback $({Q}_{B})$---are widely conjectured to be different: There exists a quantum discrete memoryless channel for which ${Q}_{2}>{Q}_{B}$. We then present a general scheme to convert any quantum error-correcting codes into adaptive protocols for this newly defined quantity of the quantum depolarizing channel, and illustrate with the repetition code and Shor code. We contrast the present notion with entanglement purification protocols by showing that, whilst the Leung-Shor protocol can be applied directly, recurrence methods need to be supplemented with other techniques but at the same time offer a way to improve the aforementioned repetition code. For the quantum depolarizing channel, we prove a formula that gives lower bounds on the quantum capacity with classical feedback from any ${E}_{B}$ protocols. We then apply this formula to the ${E}_{B}$ protocols that we discuss to obtain lower bounds on the quantum capacity with classical feedback of the quantum depolarizing channel.

arXiv:0709.2953•Physical Review A•Jan 18, 2008•7 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•4 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

Two-way quantum communication channels

Andrew M. Childs, Debbie Leung, Hoi‐Kwong Lo

We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel. 1.

•Jun 5, 2005•17 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.
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.
For any quantum discrete memoryless channel, we define a quantity called quantum entanglement capacity with classical feedback (EB)({E}_{B})(EB​), and we show that this quantity lies between two other well-studied quantities. These two quantities---namely the quantum capacity assisted by two-way classical communication (Q2)({Q}_{2})(Q2​) and the quantum capacity with classical feedback (QB)({Q}_{B})(QB​)---are widely conjectured to be different: There exists a quantum discrete memoryless channel for which Q2>QB{Q}_{2}>{Q}_{B}Q2​>QB​. We then present a general scheme to convert any quantum error-correcting codes into adaptive protocols for this newly defined quantity of the quantum depolarizing channel, and illustrate with the repetition code and Shor code. We contrast the present notion with entanglement purification protocols by showing that, whilst the Leung-Shor protocol can be applied directly, recurrence methods need to be supplemented with other techniques but at the same time offer a way to improve the aforementioned repetition code. For the quantum depolarizing channel, we prove a formula that gives lower bounds on the quantum capacity with classical feedback from any EB{E}_{B}EB​ protocols. We then apply this formula to the EB{E}_{B}EB​ protocols that we discuss to obtain lower bounds on the quantum capacity with classical feedback of the quantum depolarizing channel.
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel. 1.