2008/03/05 by Satyabrata Adhikari, Sunandan Gangopadhyay
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph
paper · pdf · doi:10.1007/s10773-008-9813-z
published as IJTP: Vol.48, Issue-2, 403 (2009) · 7 pages, Latex
arxiv created 2008/03/05 · openalex publication_date 2008/07/31 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Recently, a new class of W-states has been defined by Agarwal and Pati \citeagarwal and it has been shown that they can be used as a quantum channel for teleportation and superdense coding. In this work, we identify those three-qubit states from the set of the new class of W-states which are most efficient or suitable for quantum teleportation. We show that with some probability |W1>=(1/2)(|100>+|010>+√(2)|001>) is best suited for teleportation channel in the sense that it does not depend on the input state.