2001/01/02 by Phillip Kaye, Michele Mosca · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1088/0305-4470/34/35/319
15 pages, 2 figures
arxiv created 2001/01/02 · openalex publication_date 2001/08/24 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
If two parties, Alice and Bob, share some number, n , of partially entangled pairs of qubits, then it is possible for them to concentrate these pairs into some smaller number of maximally entangled states. We present a simplified version of the algorithm for such entanglement concentration , and we describe efficient networks for implementing these operations.