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

Chinese Journal of Quantum Electronics

Probabilistic teleportation of an arbitrary three-particle entangled state via three pairs partly entangled particles

Xuemin Qian

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

We propose a scheme of probabilistic teleportation of an arbitrary three-particle entangled state via three pair nonmaximally entangled particles. Quantum teleportation can be successfully realized with a certain probability if the receiver adopts an appropriate unitary-reduction strategy. The probability of successful teleportation is determined by three smaller coefficients of the three entangled pairs. If the quantum channels are composed of three EPR states, complete teleportation can be realized by this method.

Related papers

Probabilistic Teleportation of a Three-Particle State

FANGJian-Xing, Jian-Xing, Жу +5 more

A scheme for teleporting a three-particle state is proposed when three pairs of entangled particles are used as quantum channels. Quantum teleportation can be successfully realized with a certain probability if the receiver adopts an appropriate unitary-reduction strategy. The probability of successful teleportation is determined by the smaller coefficients of the three entangled pairs.

理论物理通讯：英文版•Jan 1, 2003•0 citations

Probabilistic teleportation of a three-particle state via three pairs of entangled particles

Jianxing Fang, Yinsheng Lin, Shiqun Zhu +1 more

A scheme for teleporting an arbitrary three-particle state is proposed when three pairs of entangled particles are used as quantum channels. Quantum teleportation can be successfully realized with a certain probability if the receiver adopts an appropriate unitary-reduction strategy. The probability of successful teleportation is determined by the smallest coefficients of the three entangled pairs.

Physical Review A•Jan 29, 2003•130 citations

Probabilistic Teleportation of a Three-Particle State

Fang Jian-Xing, Zhu Shi-Qun, Rong Zhang +1 more

A scheme for teleporting a three-particle state is proposed when three pairs of entangled particles are used as quantum channels. Quantum teleportation can be successfully realized with a certain probability if the receiver adopts an appropriate unitary-reduction strategy. The probability of successful teleportation is determined by the smaller coefficients of the three entangled pairs.

Communications in Theoretical Physics•Nov 15, 2003•8 citations

Teleportation of an arbitrary three-particle state

Libing Chen

We propose two schemes for teleporting an arbitrary three-particle state. In the first scheme, a two-particle state and a three-particle entangled state (both non-maximally entangled states) are used as quantum channels, while in the second scheme, three non-maximally entangled particle pairs are employed as quantum channels. We show that teleportation can be successfully realized with certain probability if a receiver adopts some appropriate unitary transformations. Their success probabilities and the classical communication costs are different.

Chinese Physics•Oct 1, 2002•27 citations

Probabilistic Teleportation of an Arbitrary Two-particle State

Gu Yong-Jian, Yi-Zhuang Zheng, Guo Guang-Can

A scheme for the teleportation of an arbitrary two-particle state via two non-maximally entangled particle pairs is proposed. We show that teleportation can be successfully realized with a certain probability if the receiver adopts an appropriate unitary-reduction strategy. A specific strategy is provided in detail. The probability of successful teleportation is determined by the smaller coefficients of the two entangled pairs.

Chinese Physics Letters•Nov 23, 2001•25 citations

Teleportation of an arbitrary three—particle state

陈立冰

We propose two schemes for teleporting an arbitrary three-particle state.In the first scheme,a two-particle state and a three-particle entangled state (both non-maximally entangled states)are used as quantum channels,while in the second scheme,three non-mnaximally entangled particle pairs are employed as quantum channels.We show that teleportation can be successfully realized with certain probability if a receiver adopts some appropriate unitary transformations.Their success probabilities and the classical communication costs are different.

中国物理B：英文版•Jun 12, 2005•0 citations
We propose a scheme of probabilistic teleportation of an arbitrary three-particle entangled state via three pair nonmaximally entangled particles. Quantum teleportation can be successfully realized with a certain probability if the receiver adopts an appropriate unitary-reduction strategy. The probability of successful teleportation is determined by three smaller coefficients of the three entangled pairs. If the quantum channels are composed of three EPR states, complete teleportation can be realized by this method.
We propose two schemes for teleporting an arbitrary three-particle state. In the first scheme, a two-particle state and a three-particle entangled state (both non-maximally entangled states) are used as quantum channels, while in the second scheme, three non-maximally entangled particle pairs are employed as quantum channels. We show that teleportation can be successfully realized with certain probability if a receiver adopts some appropriate unitary transformations. Their success probabilities and the classical communication costs are different.
We propose two schemes for teleporting an arbitrary three-particle state.In the first scheme,a two-particle state and a three-particle entangled state (both non-maximally entangled states)are used as quantum channels,while in the second scheme,three non-mnaximally entangled particle pairs are employed as quantum channels.We show that teleportation can be successfully realized with certain probability if a receiver adopts some appropriate unitary transformations.Their success probabilities and the classical communication costs are different.