How much does it cost to teleport?

1996/05/16 by H. F. Chau, Chau, H. F., Hoi‐Kwong Lo +2 · 1 citation
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph

paper · pdf · doi:10.48550/arxiv.quant-ph/9605025

5 pages, extended abstract submitted to PHYSCOMP96

arxiv created 1996/05/16 · openalex publication_date 1996/05/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that the entropy of entanglement of a state characterizes its ability to teleport. In particular, in order to teleport faithfully an unknown quantum N-state, the two users must share an entangled state with at least log₂ N bits entropy of entanglement. We also note that the maximum capacity for a mixed state \cal M to teleport equals the maximum amount of entanglement entropy that can be distilled out from \cal M. Our result, therefore, provides an alternative interpretation for entanglement purification.

Citations

• Good Quantum Error-Correcting Codes Exist
• Distinguishability and Accessible Information in Quantum Theory

Cited by

• Path superposition as resource for perfect quantum teleportation with separable states

Related

• Quantum Teleportation: from Pure to Mixed States and Standard to Optimal
• Teleportation cost and hybrid compression of quantum signals
• Relevance of rank for a mixed state quantum teleportation resource
• Rank dependent bounds on mixedness and entanglement for quantum teleportation
• Teleporting Noncommuting Qubits Require Maximal Entanglement