Probabilistic chain teleportation of a qutrit-state
From MaRDI portal
Publication:3010100
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.
Recommendations
- A note on ``Chain teleportation with partially entangled states
- Quantum channels of the qutrit state teleportation
- Controlled Probabilistic Teleportation of an Unknown Multi-Particle High-Dimensional Entangled State
- Probabilistic teleportation of an arbitrary three-particle state
- Probabilistic Teleportation of a Three-Particle State
Cited in
(5)- A note on ``Chain teleportation with partially entangled states
- Controlled remote information concentration via GHZ-type states
- Controlled teleportation of a qudit state by partially entangled GHZ states
- Bidirectional quantum controlled teleportation of qudit state via partially entangled GHZ-type states
- Influence of magnetic field on qutrit teleportation under intrinsic decoherence
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)