2003/07/31 by Ming-Yong Ye, M. -Y. Ye, Yong-Sheng Zhang +3 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Combinatorics #Computer science #Mathematics #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 #State (computer science) #Teleportation #Topology (electrical circuits) #W state #quant-ph
paper · pdf · doi:10.1103/physreva.69.022310
published as Phys. Rev. A 69, 022310 (2004) · 6 pages
openalex publication_date 2004/02/20 · arxiv created 2004/02/25 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present many ensembles of states that can be remotely prepared by using minimum classical bits from Alice to Bob and their previously shared entangled state and prove that we have found all the ensembles in two-dimensional case. Furthermore we show that any pure quantum state can be remotely and faithfully prepared by using finite classical bits from Alice to Bob and their previously shared nonmaximally entangled state though no faithful quantum teleportation protocols can be achieved by using a nonmaximally entangled state.