2000/06/30 by Charles H. Bennett, David P. DiVincenzo, Peter W. Shor +3 · 4 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Combinatorics #Communication source #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 information science #Quantum mechanics #Quantum state #Quantum teleportation #Qubit #State (computer science) #Statistical physics #Superdense coding #Telecommunications #Teleportation #Topology (electrical circuits) #W state #quant-ph
paper · pdf · doi:10.1103/physrevlett.87.077902
published as Phys. Rev. Lett. v.87 (2001) p.077902 · 4 pages including 1 epsf figure; v3 has an additional author and discusses relation to work of Devetak and Berger (quant-ph/0102123); v4 improves low-entanglement protocols without back communication to perform as well as low-entanglement protocols with back communication; v5 (journal version) has a few small changes
openalex publication_date 2001/07/26 · arxiv created 2001/07/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting part of a known entangled state. We explore the tradeoff between entanglement and classical communication required for RSP, and discuss RSP capacities of general quantum channels.