Abstract
We have investigated different strategies for chain teleportation of a d-level quantum state (qu dit-state) with the non-maximally entangled channels. The total success probabilities of chain teleportation protocols, the separate chain teleportation protocol (SCTP) and the global chain teleportation protocol (GCTP) are calculated. In the SCTP the errors are corrected between every step while in the GCTP the errors are corrected only at the end. The result shows that the GCTP is more efficient than the SCTP. Nevertheless, the error-correction of the GCTP will become more complicated with the increase of the node number. For keeping away from this inconvenience of the GCTP, we have presented an eclectic strategy, the piecewise chain teleportation protocol (PCTP) to balance the efficiency and maneuverability of chain teleportation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
