2007/11/04 by Guoming Wang, Mingsheng Ying
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics #Computer science #Formalism (music) #Mathematics #Multipartite #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum entanglement #Quantum information #Quantum mechanics #Quantum teleportation #Superdense coding #Teleportation #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.77.032324
published as Phys. Rev. A 77, 032324 (2008) · 12 pages, no figure
arxiv created 2007/11/04 · openalex publication_date 2008/03/14 · arxiv updated 2011/08/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We study the possibility of performing perfect teleportation of unknown quantum states from multiple senders to a single receiver with a previously shared stabilizer state. In the model we considered, the utilized stabilizer state is partitioned into several subsystems and then each subsystem is distributed to a distinct party. We present two sufficient conditions for a stabilizer state to achieve a given nonzero teleportation capacity with respect to a given partition plan. The corresponding teleportation protocols are also explicitly given. Interestingly, we find that even mixed stabilizer states are also useful for perfect many-to-one teleportation. Finally, our work provides a perspective from stabilizer formalism to view the standard teleportation protocol and also suggests a technique for analyzing teleportation capability of multipartite entangled states.