2007/08/31 by Sreraman Muralidharan, Prasanta K. Panigrahi · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Combinatorics #Computer science #Mathematics #No-teleportation theorem #One-way quantum computer #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 #Qubit #State (computer science) #Superdense coding #Teleportation #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.77.032321
8 Pages, added sections on state sharing
arxiv created 2008/02/06 · openalex publication_date 2008/03/13 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We investigate the usefulness of a recently introduced five-qubit state by Brown et al. [I. D. K. Brown, S. Stepney, A. Sudbery, and S. L. Braunstein, J. Phys. A 38, 1119 (2005)] for quantum teleportation, quantum-state sharing, and superdense coding. It is shown that this state can be utilized for perfect teleportation of arbitrary single and two-qubit systems. We devise various schemes for quantum-state sharing of an arbitrary single- and two-particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits.