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

Physica Scripta

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

Manoj Kumar Mandal, Binayak Samadder Choudhury, Soumen Samanta, Arpan Dhara

Published Apr 8, 2024• 6 citations
Publisher

Abstract

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.

DOI
10.1088/1402-4896/ad3bf3

Related papers

Probabilistic Resumable Quantum Teleportation of a Two-Qubit Entangled State

Zhan-Yun Wang, Yitao Gou, Jin-Xing Hou +2 more

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.

Entropy•Apr 1, 2019•11 citations

Deterministic and Probabilistic Short-Distance Teleportation of an Unknown Three-Qubit State

Manoj Kumar Mandal, Binayak Samadder Choudhury, Plaban Saha

Abstract Teleportation across short distances has become relevant in view of some recent developments in quantum technology. The advantage here is that certain auxiliary qubits can be accessed and utilized by both the sender and the receiver. Such act reduces the requirement of the number of qubits in the entangled quantum channel which would have been otherwise necessary. In this paper we present a short-distance teleportation protocol by which an arbitrary three-qubit state can be transferred with the help of auxiliary qubits and a maximally entangled Bell-State. In the second part of the paper we introduce a probabilistic short-distance protocol for the same arbitrary three-qubit state by using a non-maximally entangled Bell-state. The success probability of the protocol is calculated and its relation with the first protocol is discussed. We presented a circuit diagram for the first protocol and execute it in the IBM-QE platform.

International Journal of Theoretical Physics•Sep 23, 2024•3 citations

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

Probabilistic Teleportation of an Arbitrary N-qubit State via Entanglement Swapping

Yi-Qi Wang, Fang Jian-Xing, Jiang Wei-Xing +1 more

Recently, there is much interest in the study of quantum teleportation. Its marvelous security property makes it particularly attractive as potential means for future communication. Uncertain principal and no-cloning theories of quantum mechanics forbid exact copy of quantum states. To solve the problem, quantum teleportation devides message state into two parts: classical message and quantum message which are transmitted through relevant classical and quantum channels from a sender Alice to a distant receiver Bob, respectively. According to both message states, Bob can recover the original message state with certain possibility. Utilizing the general quantum teleportation protocol, in this scheme, a new method is presented by which multi-qubit quantum information can be teleported in a much easier way. It has been extended to teleportation of an arbitrary N-qubit state via entanglement swapping and probabilistic teleportation is investigated as well, which has a more general meaning. N non-maximally entangled triplet GHZ states (Greenberger-Home-Zeilinger), taking the place of the previous EPR states (Einstein-Podolsky-Rosen), serve as quantum channels, which avoids introducing extra auxiliary qubit. In order to complete the teleportation, Alice has to devide all qubits into N parts and make Bell-State measurement on qubit pair (i, x(subscript i)) and tell Bob the measurement result through classical channel, then Bob perform some simple local operations on qubits (y(subscript i), z(subscript i)) to finish teleporting the i-th qubit. Conditioned on N-times similar repeat, Bob can faithfully reconstruct the initial state. Results show that, in this method, the identification difficulty of entangled states is considerably reduced, the new method is more feasible in technique. And the total possibility of successful teleportation is (The equation is abbreviated). As a special case, teleportation of an arbitrary two-qubit state is proposed.

Chinese Journal of Luminescence•Oct 1, 2007•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

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
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.
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 Teleportation across short distances has become relevant in view of some recent developments in quantum technology. The advantage here is that certain auxiliary qubits can be accessed and utilized by both the sender and the receiver. Such act reduces the requirement of the number of qubits in the entangled quantum channel which would have been otherwise necessary. In this paper we present a short-distance teleportation protocol by which an arbitrary three-qubit state can be transferred with the help of auxiliary qubits and a maximally entangled Bell-State. In the second part of the paper we introduce a probabilistic short-distance protocol for the same arbitrary three-qubit state by using a non-maximally entangled Bell-state. The success probability of the protocol is calculated and its relation with the first protocol is discussed. We presented a circuit diagram for the first protocol and execute it in the IBM-QE platform.
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.
Recently, there is much interest in the study of quantum teleportation. Its marvelous security property makes it particularly attractive as potential means for future communication. Uncertain principal and no-cloning theories of quantum mechanics forbid exact copy of quantum states. To solve the problem, quantum teleportation devides message state into two parts: classical message and quantum message which are transmitted through relevant classical and quantum channels from a sender Alice to a distant receiver Bob, respectively. According to both message states, Bob can recover the original message state with certain possibility. Utilizing the general quantum teleportation protocol, in this scheme, a new method is presented by which multi-qubit quantum information can be teleported in a much easier way. It has been extended to teleportation of an arbitrary N-qubit state via entanglement swapping and probabilistic teleportation is investigated as well, which has a more general meaning. N non-maximally entangled triplet GHZ states (Greenberger-Home-Zeilinger), taking the place of the previous EPR states (Einstein-Podolsky-Rosen), serve as quantum channels, which avoids introducing extra auxiliary qubit. In order to complete the teleportation, Alice has to devide all qubits into N parts and make Bell-State measurement on qubit pair (i, x(subscript i)) and tell Bob the measurement result through classical channel, then Bob perform some simple local operations on qubits (y(subscript i), z(subscript i)) to finish teleporting the i-th qubit. Conditioned on N-times similar repeat, Bob can faithfully reconstruct the initial state. Results show that, in this method, the identification difficulty of entangled states is considerably reduced, the new method is more feasible in technique. And the total possibility of successful teleportation is (The equation is abbreviated). As a special case, teleportation of an arbitrary two-qubit state is proposed.
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 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.