Teleportation of an Unknown Three-Particle Entangled State via a Cluster State
Li Yu
Abstract
Li Yu
Abstract
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.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Cluster state, Quantum teleportation, W state, Greenberger–Horne–Zeilinger state, Teleportation, State (computer science), One-way quantum computer, Quantum channel