Entanglement purification with two-way classical communication

Authors:
Alan W. Leung;Peter W. Shor
Affiliations:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA;Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA
Venue:
Quantum Information & Computation
Year:
2008

Citing 4
Cited 1

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Quantum computation and quantum information

Quantum computation and quantum information
Quantum information theory

IEEE Transactions on Information Theory

Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 are higher than those of universal hashing for F less than 0.99999 and as F goes to 1.