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 arbitrary two-particle entangled state via cluster state

NI Zhi-xiang

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

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.

Related papers

Probabilistic Teleportation of Two-atom Entangled State via Four-atom Cluster State

Tao Wu

A scheme for teleporting an unknown two two-level atoms entangled state via four identical two-level atoms non-maximally entangled Cluster state as quantum channel is proposed.In the scheme,the receiver Bob can reconstruct the original state with a certain probability by introducing an auxiliary atom and operating unitary transformations 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.The considerable advantage of the scheme is that a non-maximally entangled Cluster state is employed as quantum channel,thus,the scheme can greatly reduce the amount of entanglement resources and need less classical bits.If a maximally entangled Cluster state is employed as quantum channel,the probabilistic teleportation scheme becomes usual teleportation,of which the successful probability is 100%.

ACTA PHOTONICA SINICA•Jan 1, 2013•1 citation

Probabilistic Teleportation of Two-particle Entangled State via a Cluster State

Junfang Zhu

A scheme for probabilistic teleportation of an unknown two-particle entangled state via a four-qubit non-maximally entangled cluster state as quantum channel is proposed. In this scheme,the unknown entangled states can be teleported with a certain probability,which is determined by the smallest two of the coefficients' absolute values of the cluster state. What's more,if quantum channel is maximally entangled cluster state,the probabilistic teleportation becomes usual teleportation.

Chinese Journal of Luminescence•Jan 1, 2009•0 citations

PROBABILISTIC TELEPORTATION OF AN ARBITRARY SINGLE-PARTICLE VIA FOUR-PARTICLE ENTANGLED STATE

Xiaoqing Tan, Xu Zhou

In this paper, we present two different quantum teleportation schemes of an arbitrary single-particle, one is perfect teleportation and the other is probabilistic teleportation.In the first scheme, a four-particle maximally entangled state is used as the quantum channel.Besides, Bob needs to apply appropriate unitary transformations according to Alice's measurement results to recover the unknown state and the success probability is 1.In the latter scheme, the quantum channel is a four-particle non-maximally entangled state, which is a more general state.Furthermore, Bob needs to introduce an auxiliary qubit so that he can reconstruct the unknown state with the success probability of ( ).

Journal of Mathematical Sciences Advances and Applications•Jan 10, 2017•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 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

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
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 teleporting an unknown two two-level atoms entangled state via four identical two-level atoms non-maximally entangled Cluster state as quantum channel is proposed.In the scheme,the receiver Bob can reconstruct the original state with a certain probability by introducing an auxiliary atom and operating unitary transformations 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.The considerable advantage of the scheme is that a non-maximally entangled Cluster state is employed as quantum channel,thus,the scheme can greatly reduce the amount of entanglement resources and need less classical bits.If a maximally entangled Cluster state is employed as quantum channel,the probabilistic teleportation scheme becomes usual teleportation,of which the successful probability is 100%.
In this paper, we present two different quantum teleportation schemes of an arbitrary single-particle, one is perfect teleportation and the other is probabilistic teleportation.In the first scheme, a four-particle maximally entangled state is used as the quantum channel.Besides, Bob needs to apply appropriate unitary transformations according to Alice's measurement results to recover the unknown state and the success probability is 1.In the latter scheme, the quantum channel is a four-particle non-maximally entangled state, which is a more general state.Furthermore, Bob needs to introduce an auxiliary qubit so that he can reconstruct the unknown state with the success probability of ( ).
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.
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%.