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

Entropy

Probabilistic Resumable Quantum Teleportation of a Two-Qubit Entangled State

Zhan-Yun Wang, Yitao Gou, Jin-Xing Hou, Like Cao, Xiao-Hui Wang

Published Apr 1, 2019• 11 citations
Publisher

Abstract

We explicitly present a generalized quantum teleportation of a two-qubit entangled state protocol, which uses two pairs of partially entangled particles as quantum channel. We verify that the optimal probability of successful teleportation is determined by the smallest superposition coefficient of these partially entangled particles. However, the two-qubit entangled state to be teleported will be destroyed if teleportation fails. To solve this problem, we show a more sophisticated probabilistic resumable quantum teleportation scheme of a two-qubit entangled state, where the state to be teleported can be recovered by the sender when teleportation fails. Thus the information of the unknown state is retained during the process. Accordingly, we can repeat the teleportion process as many times as one has available quantum channels. Therefore, the quantum channels with weak entanglement can also be used to teleport unknown two-qubit entangled states successfully with a high number of repetitions, and for channels with strong entanglement only a small number of repetitions are required to guarantee successful teleportation.

DOI
10.3390/e21040352

Related papers

Probabilistic resumable quantum teleportation for an arbitrary two-qubit entangled state with different quantum channels

Zuan Meng, Shi-Feng Zhang, Liu‐Yong Cheng +1 more

Abstract We propose two probabilistic resumable quantum teleportation schemes for an arbitrary two-qubit entangled state with different quantum channels. The characteristic of our schemes is that the initial state in the sender’s hand can be recovered instead of being destroyed when teleportation fails, so we can improve the success probabilities by repeating the teleportation process more times. The analysis results show that the number of repetitions required for successful teleportation depends on the entanglement strength of the quantum channels, and even weak entanglement enables a high probability of success.

Laser Physics•Dec 29, 2022•1 citation

Resumable probabilistic teleportation of a three qubit state using different quantum channels

Manoj Kumar Mandal, Binayak Samadder Choudhury, Soumen Samanta +1 more

Abstract In this paper we describe two different probabilistic teleportation protocols for teleporting the same unknown 3-qubit state from the sender Alice to the receiver Bob. The speciality of the state is that it remains a 2-qubit entangled state after any of the three involved qubits is eliminated by partial trace operation. One of the protocols utilizes a two and a three-qubit separate channels while in the other protocol, a five-qubit channel is utilized. One of the channels in the first protocol is a non-maximally entangled Bell state while the 5-qubit channel used in the case of the second protocol is non-maximally entangled. Both the teleportation schemes are probabilistic with the feature that in the case of failure of the teleportation, the state to be teleported is not lost to the sender. So the process can be repeated after failure till success is achieved. Moreover, one of the channels is recovered in the failure case. Both protocols are resumable in the above sense. The above is the speciality of the present work. We analyze the efficiency of our protocol which shows that the present two protocols are better performing than some existing ones.

Physica Scripta•Apr 8, 2024•6 citations

Teleportation of a bipartite quantum state via generalized Bell states

He‐Shan Song

Two-qubit quantum teleportation is closely related to quantum computation,so a teleportation protocol in which an arbitrary bipartite quantum state is perfectly teleported probabilistically from sender to receiver is proposed. One of 16 generalized non-maximally entangled Bell states (G states for simplicity) functions as quantum channel. The teleportation can be successfully realized with a certain probability if sender performs generalized Bell state measurements (G measurements) and receiver introduces an auxiliary particle and operates appropriate unitary transformations and single-qubit measurements. The probability of successful teleportation is determined by the smallest one among the coefficients' absolute values of the quantum channel.

Dalian Ligong Daxue xuebao•Jan 1, 2010•1 citation

Probabilistic teleportation without loss of information

Luis Roa, Caspar Groiseau

We found a scheme for teleporting probabilistically an unknown pure state with optimal probability and without losing the information of the state to be teleported. Accordingly, without having to have copies of the unknown state, the teleportation process can be repeated as many times as one has available quantum channels. Thus, although the quantum channels have a weak entanglement, teleportation is achievable with a high number of repetitions, whereas for channels with strong entanglement only a small number of repetitions are required to guarantee successful teleportation.

Physical Review A•Jan 30, 2015•35 citations

Teleportation of an arbitrary two-qubit state via an entangled four-dimensional qudit pair channel

Yi-Hong Bai

In this study,we will investigate the problem of teleportation of an arbitrary two-qubit state.Firstly,we show how the two-qubit state can be teleported with unit fidelity and unit probability by using a maximally entangled four-dimensional qudit pair as a quantum channel.Then,we put forward a scheme for probabilistic teleporting the state with unit fidelity via a partially entangled quantum qudit channel.The probability of successful teleportation is determined by the smallest Schmidt coefficient of the entangled qudit pair.

Journal of Foshan University•Jan 1, 2006•0 citations

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
We explicitly present a generalized quantum teleportation of a two-qubit entangled state protocol, which uses two pairs of partially entangled particles as quantum channel. We verify that the optimal probability of successful teleportation is determined by the smallest superposition coefficient of these partially entangled particles. However, the two-qubit entangled state to be teleported will be destroyed if teleportation fails. To solve this problem, we show a more sophisticated probabilistic resumable quantum teleportation scheme of a two-qubit entangled state, where the state to be teleported can be recovered by the sender when teleportation fails. Thus the information of the unknown state is retained during the process. Accordingly, we can repeat the teleportion process as many times as one has available quantum channels. Therefore, the quantum channels with weak entanglement can also be used to teleport unknown two-qubit entangled states successfully with a high number of repetitions, and for channels with strong entanglement only a small number of repetitions are required to guarantee successful teleportation.
Abstract We propose two probabilistic resumable quantum teleportation schemes for an arbitrary two-qubit entangled state with different quantum channels. The characteristic of our schemes is that the initial state in the sender’s hand can be recovered instead of being destroyed when teleportation fails, so we can improve the success probabilities by repeating the teleportation process more times. The analysis results show that the number of repetitions required for successful teleportation depends on the entanglement strength of the quantum channels, and even weak entanglement enables a high probability of success.
Abstract In this paper we describe two different probabilistic teleportation protocols for teleporting the same unknown 3-qubit state from the sender Alice to the receiver Bob. The speciality of the state is that it remains a 2-qubit entangled state after any of the three involved qubits is eliminated by partial trace operation. One of the protocols utilizes a two and a three-qubit separate channels while in the other protocol, a five-qubit channel is utilized. One of the channels in the first protocol is a non-maximally entangled Bell state while the 5-qubit channel used in the case of the second protocol is non-maximally entangled. Both the teleportation schemes are probabilistic with the feature that in the case of failure of the teleportation, the state to be teleported is not lost to the sender. So the process can be repeated after failure till success is achieved. Moreover, one of the channels is recovered in the failure case. Both protocols are resumable in the above sense. The above is the speciality of the present work. We analyze the efficiency of our protocol which shows that the present two protocols are better performing than some existing ones.
Two-qubit quantum teleportation is closely related to quantum computation,so a teleportation protocol in which an arbitrary bipartite quantum state is perfectly teleported probabilistically from sender to receiver is proposed. One of 16 generalized non-maximally entangled Bell states (G states for simplicity) functions as quantum channel. The teleportation can be successfully realized with a certain probability if sender performs generalized Bell state measurements (G measurements) and receiver introduces an auxiliary particle and operates appropriate unitary transformations and single-qubit measurements. The probability of successful teleportation is determined by the smallest one among the coefficients' absolute values of the quantum channel.
We found a scheme for teleporting probabilistically an unknown pure state with optimal probability and without losing the information of the state to be teleported. Accordingly, without having to have copies of the unknown state, the teleportation process can be repeated as many times as one has available quantum channels. Thus, although the quantum channels have a weak entanglement, teleportation is achievable with a high number of repetitions, whereas for channels with strong entanglement only a small number of repetitions are required to guarantee successful teleportation.
In this study,we will investigate the problem of teleportation of an arbitrary two-qubit state.Firstly,we show how the two-qubit state can be teleported with unit fidelity and unit probability by using a maximally entangled four-dimensional qudit pair as a quantum channel.Then,we put forward a scheme for probabilistic teleporting the state with unit fidelity via a partially entangled quantum qudit channel.The probability of successful teleportation is determined by the smallest Schmidt coefficient of the entangled qudit pair.