2000/05/31 by S. F. Huelga, Susana F. Huelga, J. A. Vaccaro +4 · 277 citations
Computer Science · Physics and Astronomy · #Causality (physics) #Computer science #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 network #Quantum teleportation #Superdense coding #Teleportation #Unitary state #quant-ph
paper · pdf · doi:10.1103/physreva.63.042303
published in Physical Review A 63(4) (American Physical Society) · 5 pages, 2 figures Typographical erros in formulas have been corrected. Conclusions unchanged
arxiv created 2000/07/04 · openalex publication_date 2001/03/15 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
We consider the implementation of an arbitrary unitary operation U upon a distant quantum system. This teleportation of U can be viewed as quantum remote control. We investigate protocols that achieve this using local operations, classical communication, and shared entanglement. Lower bounds on the necessary entanglement and classical communication are determined using causality and the linearity of quantum mechanics. We examine in particular detail the resources required if the remote control is to be implemented as a classical black box. Under these circumstances, we prove that the required resources are, necessarily, those needed for implementation by bidirectional state teleportation.