2019/03/31 by Satyabrata Adhikari · 6 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Artificial intelligence #Class (philosophy) #Combinatorics #Computer science #Mathematics #Physics #Probabilistic logic #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum entanglement #Quantum mechanics #Quantum teleportation #Qubit #State (computer science) #Superdense coding #Teleportation #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1134/s1063776120090010
published in Journal of Experimental and Theoretical Physics 131(3), 375-384 (Pleiades Publishing) · 9 pages, Accepted in Journal of Experimental and Theoretical Physics
arxiv created 2019/11/02 · openalex created_date 2019/11/22 · openalex publication_date 2020/09/01 · arxiv updated 2021/01/20 · openalex updated_date 2026/08/05
Abstract In this work, we propose a probabilistic teleportation protocol to teleport a single qubit via three-qubit W-states using two-qubit measurement basis. We show that for the proper choice of the state parameter of the resource state, it is possible to make success probability of the protocol very high. We deduce the condition for the successful execution of our teleportation protocol and this gives us new class of three-qubit W-states which act as a resource state. We have constructed operators that can be used to verify the condition of teleportation in experiment. This verification is necessary for the detection of whether the given three-qubit state is useful in our teleportation protocol or not. Further we quantify the amount of entanglement contained in the newly identified shared W-class of states. Moreover, we show that the W-class of shared state used in the teleportation protocol can be prepared using NMR set up.