vix.ing · top · new · best · stats

Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels

1995/11/22 by Charles H. Bennett, Gilles Brassard, Sandu Popescu +3 · 2,974 citations
Computer Science · Mathematics · Physics and Astronomy · #Amplitude damping channel #Channel (broadcasting) #Combinatorics #Computer science #Mathematical analysis #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum discord #Quantum entanglement #Quantum information science #Quantum mechanics #Quantum teleportation #Telecommunications #Teleportation #Topology (electrical circuits) #Upper and lower bounds #quant-ph

paper · pdf · doi:10.1103/physrevlett.76.722

published in Physical Review Letters 76(5), 722-725 (American Physical Society) · 4 pages (revtex) plus 1 figure (postscript). See also http://vesta.physics.ucla.edu/~smolin/ . Replaced to correct interchanged $σ_x$ and $σ_z$ near top of column 2, page 2

arxiv created 1995/11/22 · openalex publication_date 1996/01/29 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

Two separated observers, by applying local operations to a supply of not-too-impure entangled states (e.g., singlets shared through a noisy channel), can prepare a smaller number of entangled pairs of arbitrarily high purity (e.g., near-perfect singlets). These can then be used to faithfully teleport unknown quantum states from one observer to the other, thereby achieving faithful transmission of quantum information through a noisy channel. We give upper and lower bounds on the yield D(M) of pure singlets (|\ensuremathΨ^\ensuremath-〉) distillable from mixed states M, showing D(M)>0 if 〈\ensuremathΨ^\ensuremath-|M|\ensuremathΨ^\ensuremath-〉>(1)/(2).

Citations

Cited by