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

Physical Review A

Probabilistic teleportation without loss of information

Luis Roa, Caspar Groiseau

Published Jan 30, 2015• 33 citations
Publisher

Abstract

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.

DOI
10.1103/physreva.91.012344

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•9 citations

Recovering information in probabilistic quantum teleportation

Luis Roa, Andrea Espinoza, Ariana S. Muñoz +1 more

In this paper we redesign the probabilistic teleportation scheme considered in Phys. Rev. A 61 , 034301 (2000) by Wan-Li Li et al. , where the optimal state extraction protocol complements the basic teleportation process with a partially entangled pure state channel, in order to transfer the unknown state with fidelity 1. Unlike that scheme, where the information of the unknown state is lost if the state extraction fails, our proposal teleports exactly and optimally an unknown state, and allows to recover faithfully that state when the process has not succeeded. In order to study the resilience of the scheme, we apply it to the teleportation problem through a quantum channel in a mixed state with pure dephasing. We find that a successful process transfers an unfaithful state, namely, the outcome state acquires the decoherence of the channel, but the unknown state is recovered by the sender with fidelity 1 if the teleportation fails. In addition, in this case, the fidelity of the teleported state has quantum features only if the channel has an amount of entanglement different from zero.

Frontiers of Physics•Nov 16, 2019•5 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 Unknown Multi-level Particle State

Hongcai Li

Consider the optimal probabilistic teleportation of an unknown S-level particle state via the quantum channel that is prepared by L pairs non-maximally entangled states of two-level particles.The probabilistic teleportation of a three-level particle state is discussed,and then extends to the unknown S-level particle state.The successful probability is calculated.

Journal of Fujian Normal University•Jan 1, 2005•0 citations

Concealed Quantum Information

Luis Roa

We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the receiver. Thus, in order to complete the teleportation process it is required to perform an "unambiguous non-orthogonal quantum states discrimination" and an "extraction of the quantum information" processes. This general scheme allows one to design a strategy for concealing the unknown information of the teleported state. Besides, we showed that the teleportation and the "concealing the quantum information" process, can be probabilistically performed even though the bipartite quantum channel is maximally entangled.

arXiv:0708.4018•Aug 29, 2007•0 citations

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
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.
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.
In this paper we redesign the probabilistic teleportation scheme considered in Phys. Rev. A 61 , 034301 (2000) by Wan-Li Li et al. , where the optimal state extraction protocol complements the basic teleportation process with a partially entangled pure state channel, in order to transfer the unknown state with fidelity 1. Unlike that scheme, where the information of the unknown state is lost if the state extraction fails, our proposal teleports exactly and optimally an unknown state, and allows to recover faithfully that state when the process has not succeeded. In order to study the resilience of the scheme, we apply it to the teleportation problem through a quantum channel in a mixed state with pure dephasing. We find that a successful process transfers an unfaithful state, namely, the outcome state acquires the decoherence of the channel, but the unknown state is recovered by the sender with fidelity 1 if the teleportation fails. In addition, in this case, the fidelity of the teleported state has quantum features only if the channel has an amount of entanglement different from zero.
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.
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the receiver. Thus, in order to complete the teleportation process it is required to perform an "unambiguous non-orthogonal quantum states discrimination" and an "extraction of the quantum information" processes. This general scheme allows one to design a strategy for concealing the unknown information of the teleported state. Besides, we showed that the teleportation and the "concealing the quantum information" process, can be probabilistically performed even though the bipartite quantum channel is maximally entangled.
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.