Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Quantum Information

A NOTE ON "CHAIN TELEPORTATION WITH PARTIALLY ENTANGLED STATES"

CHUN-JIE XU, Yimin Liu, Xiaofeng Yin, Zhanjun Zhang

Published Dec 1, 2010• 1 citation
Publisher

Abstract

The global chain teleportation protocol (GCTP) [Eur. Phys. J. D54 (2009) 111] is revisited via a three-node instantiation. The required operation ability and manipulation orderings of the three participants are sightly changed so that in the improved version, three additional important merits are resultant with consuming only an additional one-classical-bit message.

DOI
10.1142/s0219749910006393

Related papers

Improving the efficiency of single and multiple teleportation protocols based on the direct use of partially entangled states

Raphael Fortes, Gustavo Rigolin

arXiv:1207.3048•Annals of Physics•Jun 21, 2013•11 citations

Two Approaches for Indirect Teleportation with Partially Entangled States

Ziyun Zhang, Chunjie Xu, Wen Zhang +1 more

Teleportation of a qubit with two partially entangled qubit states linking three nodes as quantum channels is extensively studied via the usual ancilla method. With the method two realization approaches, i.e., the node progression approach and the global accumulation approach, are presented. Their resource consumptions, operation complexities, and efficiencies are evaluated and compared. It is found that the latter approach is better than the former one besides the error is partially self-corrected. The latter approach is further improved so that two merits are resultant. The improved version is compared with a similar protocol [M.Y. Wang and F.L. Yan, Eur. Phys. J. D 54 (2009) 111 ]. Their merits and additional costs are exposed.

Communications in Theoretical Physics•Dec 1, 2010•0 citations

Chain teleportation via partially entangled states

M. Y. Wang, Fengli Yan

arXiv:0903.1422•The European Physical Journal D•Jun 1, 2009•28 citations

QUANTUM CIRCUITS FOR PROBABILISTIC ENTANGLEMENT TELEPORTATION VIA A PARTIALLY ENTANGLED PAIR

Xiu‐Bo Chen, Qiaoyan Wen, Fu-Chen Zhu

It deserves mentioning that the quantum circuit, i.e. quantum logic network, is essential to the practical realization of teleportation in experiment. Using only one partially entangled pair, we first propose two novel strategies for probabilistically teleporting any partially entangled state of a bipartite system. The feature of the present protocol is to weaken the requirement for the quantum channel, and also to cut down the number of entangled particles initially shared by the sender and receiver. On the other hand, we explicitly construct the generalized measurement described by the positive operator-valued measure (POVM). Two kinds of efficient quantum circuits for implementing the teleportation are offered. In addition, we generalize the two-particle probabilistic teleportation to the system of many particles.

International Journal of Quantum Information•Oct 1, 2007•19 citations

Teleportation of Three-Level Multi-partite Entangled State by a Partial Three-Level Bipartite Entangled State

Dai, Hong-Yi, Zhang +3 more

我们在场为由是使用一个部分纠缠的三水平的由两部组成的状态移植一个未知三水平的由两部组成的纠缠的状态的概率的联盟者电视的一个计划量隧道。这个计划能直接被概括到概率的联盟者电视港口由一个部分三水平的由两部组成的纠缠的状态州的纠缠的未知三水平的 k 粒子。各种单一的转变详细被给。我们计算成功的全部的概率和为这个计划要求的全部的古典通讯费用。

理论物理通讯：英文版•Jan 1, 2008•1 citation

Probabilistic Chain Teleportation of a Qutrit-State

Meiyu Wang, Yan Feng-Li

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.

arXiv:1002.2108•Communications in Theoretical Physics•Aug 1, 2010•11 citations
The global chain teleportation protocol (GCTP) [Eur. Phys. J. D54 (2009) 111] is revisited via a three-node instantiation. The required operation ability and manipulation orderings of the three participants are sightly changed so that in the improved version, three additional important merits are resultant with consuming only an additional one-classical-bit message.
Teleportation of a qubit with two partially entangled qubit states linking three nodes as quantum channels is extensively studied via the usual ancilla method. With the method two realization approaches, i.e., the node progression approach and the global accumulation approach, are presented. Their resource consumptions, operation complexities, and efficiencies are evaluated and compared. It is found that the latter approach is better than the former one besides the error is partially self-corrected. The latter approach is further improved so that two merits are resultant. The improved version is compared with a similar protocol [M.Y. Wang and F.L. Yan, Eur. Phys. J. D 54 (2009) 111 ]. Their merits and additional costs are exposed.
It deserves mentioning that the quantum circuit, i.e. quantum logic network, is essential to the practical realization of teleportation in experiment. Using only one partially entangled pair, we first propose two novel strategies for probabilistically teleporting any partially entangled state of a bipartite system. The feature of the present protocol is to weaken the requirement for the quantum channel, and also to cut down the number of entangled particles initially shared by the sender and receiver. On the other hand, we explicitly construct the generalized measurement described by the positive operator-valued measure (POVM). Two kinds of efficient quantum circuits for implementing the teleportation are offered. In addition, we generalize the two-particle probabilistic teleportation to the system of many particles.
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.