Probabilistic chain teleportation of a qutrit-state

From MaRDI portal
Publication:3010100

DOI10.1088/0253-6102/54/2/12zbMATH Open1217.81031arXiv1002.2108OpenAlexW2051789091MaRDI QIDQ3010100FDOQ3010100


Authors: Meiyu Wang, Feng-Li Yan Edit this on Wikidata


Publication date: 30 June 2011

Published in: Communications in Theoretical Physics (Search for Journal in Brave)

Abstract: We investigate chain teleportation of a qutrit-state via the non-maximally two-qutrit entangled channels. For the case of four parties, the efficiencies of two chain teleportation protocols, the separate chain teleportation protocol (SCTP) and the global chain teleportation protocol (GCTP), are calculated. In SCTP the errors are corrected between every step while in GCTP the errors are corrected only at the end. Furthermore, we present a piecewise global chain teleportation protocol (PGCTP) for keeping away from the inconvenience of error-correction of GCTP. We show that PGCTP is more efficient than SCTP.


Full work available at URL: https://arxiv.org/abs/1002.2108




Recommendations





Cited In (5)





This page was built for publication: Probabilistic chain teleportation of a qutrit-state

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010100)