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

IEEE Access

Teleportation of an Unknown Four-Qubit Cluster State Based on Cluster States With Minimum Resource

Ling-Yun Cao, Shibei Xue, Min Jiang

Published Jan 1, 2020• 18 citations
Publisher

Abstract

In this paper, we first present a scheme for teleporting an unknown four-qubit cluster state via a cluster state chain between two distant nodes, which do not share entanglement pairs directly. Adjacent nodes are linked by a partially entangled four-qubit cluster state with each other. In our scheme, we deduce the relationship between the coefficients of the entangled cluster states and the success probability of teleportation. Moreover, we derive the unitary matrixes for establishing direct channel between two distant nodes, which reduce the computational complexity and resource consumption significantly. By performing entanglement swapping simultaneously, our scheme is more flexible and efficient than most existing schemes.

DOI
10.1109/access.2020.2991065

Related papers

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 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 a Cluster State

Shou Zhang

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.

Journal of Yanbian University•Jan 1, 2010•0 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

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

Teleportation of an Arbitrary Two-Particle State via a Single Cluster-Class State

Xin-Wen Wang

Teleportation of an arbitrary two-qubit state with a single partially entangled state, a four-qubit linear cluster-class state, is studied. The case is more practical than previous ones using maximally entangled states as the quantum channel. In order to realize teleportation, we first construct a cluster-basis of 16 orthonormal cluster states. We show that quantum teleportation can be successfully implemented with a certain probability if the receiver can adopt appropriate unitary transformations after receiving the sender's cluster-basis measurement information. In addition, an important conclusion can be obtained that a four-qubit maximally entangled state (cluster state) can be extracted from a single copy of the cluster-class state with the same probability as the teleportation in principle.

Communications in Theoretical Physics•Aug 1, 2009•5 citations
In this paper, we first present a scheme for teleporting an unknown four-qubit cluster state via a cluster state chain between two distant nodes, which do not share entanglement pairs directly. Adjacent nodes are linked by a partially entangled four-qubit cluster state with each other. In our scheme, we deduce the relationship between the coefficients of the entangled cluster states and the success probability of teleportation. Moreover, we derive the unitary matrixes for establishing direct channel between two distant nodes, which reduce the computational complexity and resource consumption significantly. By performing entanglement swapping simultaneously, our scheme is more flexible and efficient than most existing schemes.
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.
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.
Teleportation of an arbitrary two-qubit state with a single partially entangled state, a four-qubit linear cluster-class state, is studied. The case is more practical than previous ones using maximally entangled states as the quantum channel. In order to realize teleportation, we first construct a cluster-basis of 16 orthonormal cluster states. We show that quantum teleportation can be successfully implemented with a certain probability if the receiver can adopt appropriate unitary transformations after receiving the sender's cluster-basis measurement information. In addition, an important conclusion can be obtained that a four-qubit maximally entangled state (cluster state) can be extracted from a single copy of the cluster-class state with the same probability as the teleportation in principle.