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

Journal of Yanbian University

Probabilistic Teleportation of a Cluster State

Shou Zhang

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

A scheme which teleportates a cluster state is presented.An unknown four-particle cluster state is transmitted from a sender to a receiver by using a non-maximally three-particle entangled state and a non-maximally four-particle entangled state as a quantum channel.It is shown that the teleportation can be successfully realized with a certain probability by performing appropriate unitary transformations on the particles of the receiver.

Related papers

Probabilistic Teleportation of a Four-particle Cluster State

Mingsheng Ying

We propose a scheme for teleporting an unknown four-particle cluster state from a sender to a receiver by using two non-maximally four-particle entangled states as the quantum channel.It is shown that the teleportation can be successfully realized with certain probability by introducing some appropriate unitary transformations on the particles of the receiver.

Journal of Yanbian University•Jan 1, 2009•0 citations

Teleportation of an Unknown Three-Particle Entangled State via a Cluster State

Li Zhi Yu

Two schemes of teleporting an unknown three-particle entangled state from the sender (Alice) to the receiver (Bob) are proposed. In both schemes, a four-particle maximally entangled cluster state and a four-particle non-maximally entangled cluster state are used quantum channel, respectively. It is shown that if the quantum channel is the maximally entangled cluster state, the unknown three-particle entangled state can be teleported perfectly with the successful probability is 1; if the quantum channel is the non-maximally entangled cluster state, the probability of successful teleportation is determined by two smaller superposition coefficients.

Advanced materials research•Aug 16, 2013•2 citations

Probabilistic teleportation of arbitrary two-particle entangled state via cluster state

NI Zhi-xiang

Two schemes for teleporting an unknown two-particle entangled state via a four-qubit non-maximally entangled cluster state as quantum channel are proposed.In the first scheme,a special bipartite entangled state was teleported,the receiver Bob can reconstruct the original state with a certain probability according to the sender Alice's measurement results,and the successful probability is determined by the smallest two coefficients' absolute values of the cluster state.In the latter scheme an arbitrary two-particle entangled state was teleported.Contrast to the first scheme, Bob should perform a quantum controlled phase gate operation besides the unitary transformation. The considerable advantage is that it employs a non-maximally entangled cluster state as quantum channel in these two schemes.Thus,the schemes can greatly reduce the amount of entanglement resources and need less classical bits.

Chinese Journal of Quantum Electronics•Jan 1, 2010•0 citations

Probabilistic Teleportation of Three-Atom State via Five-Atom Cluster State

Lizhi Yu, Tao Wu

A scheme for probabilistic teleportation of an unknown three-atom entangled state via a five-atom non-maximally entangled cluster state as quantum channel is proposed. In this scheme, the sender performs two Bell state and a single-atom measurements on the atoms, the receiver can reconstruct the original state with a certain probability by introducing an auxiliary atom and operating appropriate unitary transformations and controlled-not (C-not) operations according to the sender Alice's measurement results. As a result, the probability of successful teleportation is determined by the smallest two of the coefficients' absolute values of the cluster state. The considerable advantage of our scheme is that we employ a non-maximally entangled cluster state as quantum channel in the scheme, which can greatly reduce the amount of entanglement resources and need less classical bits. If we employ a maximally entangled cluster state as quantum channel, the probabilistic teleportation scheme becomes usual teleportation, the successful probability being 100%.

Communications in Theoretical Physics•Jun 1, 2013•3 citations

Probabilistic Teleportation of a Four-Particle Entangled State

You-Bang Zhan, Hao Fu, Dong Zheng-Chao

A Scheme for teleporting an unknown four-particle entangled state is proposed via entangled swapping. In this scheme, four pairs of entangled particles are used as quantum channel. It is shown that, if the four pairs of particles are nonmaximally entangled, the teleportation can be successfully realized with certain probability if a receiver adopts some appropriate unitary transformations.

Communications in Theoretical Physics•Jan 1, 2005•8 citations

Probabilistic Teleportation of a Four-Particle Entangled W State

You-Bang Zhan, Hao Fu

In this paper, two schemes for teleporting an unknown four-particle entangled W state is proposed. In the first scheme, two partial entangled four-particle states are used as quantum channels, while in the second scheme, four non-maximally entangled particle pairs are considered as quantum channels. It is shown that the teleportation can be successfully realized with certain probability, for both schemes, if a receiver adopts some appropriate unitary transformations. It is also shown that the successful probabilities of these two schemes are different.

Communications in Theoretical Physics•Mar 1, 2005•5 citations
A scheme which teleportates a cluster state is presented.An unknown four-particle cluster state is transmitted from a sender to a receiver by using a non-maximally three-particle entangled state and a non-maximally four-particle entangled state as a quantum channel.It is shown that the teleportation can be successfully realized with a certain probability by performing appropriate unitary transformations on the particles of the receiver.
Two schemes of teleporting an unknown three-particle entangled state from the sender (Alice) to the receiver (Bob) are proposed. In both schemes, a four-particle maximally entangled cluster state and a four-particle non-maximally entangled cluster state are used quantum channel, respectively. It is shown that if the quantum channel is the maximally entangled cluster state, the unknown three-particle entangled state can be teleported perfectly with the successful probability is 1; if the quantum channel is the non-maximally entangled cluster state, the probability of successful teleportation is determined by two smaller superposition coefficients.
Two schemes for teleporting an unknown two-particle entangled state via a four-qubit non-maximally entangled cluster state as quantum channel are proposed.In the first scheme,a special bipartite entangled state was teleported,the receiver Bob can reconstruct the original state with a certain probability according to the sender Alice's measurement results,and the successful probability is determined by the smallest two coefficients' absolute values of the cluster state.In the latter scheme an arbitrary two-particle entangled state was teleported.Contrast to the first scheme, Bob should perform a quantum controlled phase gate operation besides the unitary transformation. The considerable advantage is that it employs a non-maximally entangled cluster state as quantum channel in these two schemes.Thus,the schemes can greatly reduce the amount of entanglement resources and need less classical bits.
A scheme for probabilistic teleportation of an unknown three-atom entangled state via a five-atom non-maximally entangled cluster state as quantum channel is proposed. In this scheme, the sender performs two Bell state and a single-atom measurements on the atoms, the receiver can reconstruct the original state with a certain probability by introducing an auxiliary atom and operating appropriate unitary transformations and controlled-not (C-not) operations according to the sender Alice's measurement results. As a result, the probability of successful teleportation is determined by the smallest two of the coefficients' absolute values of the cluster state. The considerable advantage of our scheme is that we employ a non-maximally entangled cluster state as quantum channel in the scheme, which can greatly reduce the amount of entanglement resources and need less classical bits. If we employ a maximally entangled cluster state as quantum channel, the probabilistic teleportation scheme becomes usual teleportation, the successful probability being 100%.
In this paper, two schemes for teleporting an unknown four-particle entangled W state is proposed. In the first scheme, two partial entangled four-particle states are used as quantum channels, while in the second scheme, four non-maximally entangled particle pairs are considered as quantum channels. It is shown that the teleportation can be successfully realized with certain probability, for both schemes, if a receiver adopts some appropriate unitary transformations. It is also shown that the successful probabilities of these two schemes are different.