2009/12/31 by Raffaele Romano, Peter van Loock
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Channel (broadcasting) #Combinatorics #Communication source #Computer network #Computer science #Mathematics #No-teleportation theorem #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum entanglement #Quantum mechanics #Quantum state #Quantum teleportation #Rank (graph theory) #State (computer science) #Superdense coding #Telecommunications #Teleportation #Theoretical computer science #Topology (electrical circuits) #Transmission (telecommunications) #quant-ph
paper · pdf · doi:10.1103/physreva.82.012334
published as Phys. Rev. A 82, 012334 (2010) · 4 pages, comments are welcome
arxiv created 2010/04/01 · openalex publication_date 2010/07/29 · arxiv updated 2013/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Quantum teleportation enables deterministic and faithful transmission of quantum states, provided a maximally entangled state is preshared between sender and receiver, and a one-way classical channel is available. Here, we prove that these resources are not only sufficient, but also necessary, for deterministically and faithfully sending quantum states through any fixed noisy channel of maximal rank, when a single use of the cannel is admitted. In other words, for this family of channels, there are no other protocols, based on different (and possibly cheaper) sets of resources, capable of replacing quantum teleportation.