1998/11/30 by Tomáš Opatrný, T. Opatrny, Gershon Kurizki +1
Chemistry · Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Chemistry #Chromatography #Computer science #Distillation #Entanglement distillation #Fidelity #Function (biology) #Matching (statistics) #Mathematical optimization #Mathematics #Minification #Physics #Projection (relational algebra) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum entanglement #Quantum mechanics #Statistics #Unitary state #W state #quant-ph
paper · pdf · doi:10.1103/physreva.60.167
published as Phys.Rev. A60 (1999) 167-172 · 6 pages, 5 figures, REVTEX. New examples, figures and references, more detailed explanations. To appear in Phys. Rev. A
arxiv created 1999/04/09 · openalex publication_date 1999/07/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We put forward a method for optimized distillation of partly entangled pairs of quantum bits into a smaller number of more entangled pairs by recurrent local unitary operations and projections. Optimized distillation is achieved by minimization of a cost function with up to 30 real parameters, which is chosen to be sensitive to the fidelity and the projection probability at each step. We show that in many cases this approach can significantly improve the distillation efficiency in comparison to the present methods.