The minimum distance problem for two-way entanglement purification

@article{Ambainis2006TheMD,
  title={The minimum distance problem for two-way entanglement purification},
  author={Andris Ambainis and Daniel Gottesman},
  journal={IEEE Transactions on Information Theory},
  year={2006},
  volume={52},
  pages={748-753}
}
Entanglement purification takes a number of noisy EPR pairs |00>+|11> and processes them to produce a smaller number of more reliable pairs. If this is done with only a forward classical side channel, the procedure is equivalent to using a quantum error-correcting code (QECC). We instead investigate entanglement purification protocols with two-way classical side channels (2-EPPs) for finite block sizes. In particular, we consider the analog of the minimum distance problem for QECCs, and show… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

Similar Papers

Loading similar papers…