2006/02/28 by Erik Hostens, Jeroen Dehaene, Bart De Moor
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Bell state #Bipartite graph #Computer science #Diagonal #Discrete mathematics #Distillation #Entanglement distillation #Entropy (arrow of time) #Mathematics #Physics #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #State (computer science) #quant-ph
paper · pdf · doi:10.1103/physreva.73.062337
published as Phys. Rev. A 73, 062337 (2006) · 11 pages, 5 figures, RevTeX4
arxiv created 2006/05/17 · openalex publication_date 2006/06/30 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present an asymptotic bipartite entanglement-distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like breeding, the protocol starts with an infinite number of copies of a Bell-diagonal mixed state. Breeding can be carried out as successive stages of partial information extraction, yielding the same result: one bit of information is gained at the cost (measurement) of one pure Bell state pair (ebit). The basic principle of our protocol is at every stage to replace measurements on ebits by measurements on a finite number of copies, whenever there are two equiprobable outcomes. In that case, the entropy of the global state is reduced by more than one bit. Therefore, every such replacement results in an improvement of the protocol. We explain how our protocol is organized as to have as many replacements as possible. The yield is then calculated for Werner states.