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

arXiv:1112.1469 · Physical Review A

Optimal probabilistic simulation of quantum channels from the future to the past

Dina Genkina, Giulio Chiribella, Lucién Hardy

Published Feb 22, 2012• 23 citations
arXivHTMLPDF

Abstract

We introduce the study of quantum protocols that probabilistically simulate quantum channels from a sender in the future to a receiver in the past. The maximum probability of simulation is determined by causality and depends on the amount and type (classical or quantum) of information that the channel can transmit. We illustrate this dependence in several examples, including ideal classical and quantum channels, measure-and-prepare channels, partial trace channels, and universal cloning channels. For the simulation of partial trace channels, we consider generalized teleportation protocols that take $N$ input copies of a pure state in the future and produce $M\ensuremath{\le}N$ output copies of the same state in the past. In this case, we show that the maximum probability of successful teleportation increases with the number of input copies, a feature that was impossible in classical physics. In the limit of asymptotically large $N$, the probability converges to the probability of simulation for an ideal classical channel. Similar results are found for universal cloning channels from $N$ copies to $M>N$ approximate copies, exploiting a time-reversal duality between universal cloning and a partial trace.

DOI
10.1103/physreva.85.022330

Related papers

Optimal partial deterministic quantum teleportation of qubits

Ladislav Mišta, Radim Filip

We propose a protocol implementing optimal partial deterministic quantum teleportation for qubits. This is a teleportation scheme realizing deterministically an optimal $1\ensuremath{\rightarrow}2$ asymmetric universal cloning where one imperfect copy of the input state emerges at the sender's station while the other copy emerges at receiver's possibly distant station. The optimality means that the fidelities of the copies saturate the asymmetric cloning inequality. The performance of the protocol relies on the partial deterministic nondemolition Bell measurement that allows us to continuously control the flow of information among the outgoing qubits. We also demonstrate that the measurement is optimal two-qubit operation in the sense of the trade-off between the state disturbance and the information gain.

Physical Review A•Feb 24, 2005•9 citations

Quantum inputs in the prepare-and-measure scenario and stochastic teleportation

Elna Svegborn, Jef Pauwels, Armin Tavakoli

Abstract We investigate prepare-and-measure scenarios in which a sender and a receiver use entanglement to send quantum information over a channel with limited capacity. We formalise this framework, identify its basic properties and provide numerical tools for optimising quantum protocols for generic communication tasks. The seminal protocol for sending quantum information over a classical channel is teleportation. We study a natural stochastic generalisation in which the sender holds N qubits from which the receiver can recover one on demand. We show that, if the classical communication is allowed to exploit extremal non-signalling correlations, then two bits of communication suffice to solve this task exactly for any N . We then consider entanglement-based protocols and show that these can be constructed systematically by leveraging connections to several well-known quantum information primitives, such as teleportation, cloning machines and random access coding. In particular, we show that by using genuine multi-particle entangled measurements, one can construct a universal stochastic teleportation machine, i.e. a device whose teleportation fidelity is independent of the quantum input.

arXiv:2504.00162•Quantum Science and Technology•Feb 5, 2026•2 citations

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

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

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

Probabilistic quantum teleportation in the presence of noise

Raphael Fortes, Gustavo Rigolin

We extend the research program initiated in [Phys. Rev. A 92, 012338 (2015)] from noisy deterministic teleportation protocols to noisy probabilistic (conditional) protocols. Our main goal now is to study how we can increase the fidelity of the teleported state in the presence of noise by working with probabilistic protocols. We work with several scenarios involving the most common types of noise in realistic implementations of quantum communication tasks and find many cases where adding more noise to the probabilistic protocol increases considerably the fidelity of the teleported state, without decreasing the probability of a successful run of the protocol. Also, there are cases where the entanglement of the channel connecting Alice and Bob leading to the greatest fidelity is not maximal. Moreover, there exist cases where the optimal fidelity for the probabilistic protocols are greater than the maximal fidelity $(2/3)$ achievable by using only classical resources, while the optimal ones for the deterministic protocols under the same conditions lie below this limit. This result clearly illustrates that in some cases we can only get a truly quantum teleportation if we use probabilistic instead of deterministic protocols.

arXiv:1604.04644•Physical Review A•Jun 23, 2016•43 citations
We introduce the study of quantum protocols that probabilistically simulate quantum channels from a sender in the future to a receiver in the past. The maximum probability of simulation is determined by causality and depends on the amount and type (classical or quantum) of information that the channel can transmit. We illustrate this dependence in several examples, including ideal classical and quantum channels, measure-and-prepare channels, partial trace channels, and universal cloning channels. For the simulation of partial trace channels, we consider generalized teleportation protocols that take NNN input copies of a pure state in the future and produce M\ensuremath≤NM\ensuremath{\le}NM\ensuremath≤N output copies of the same state in the past. In this case, we show that the maximum probability of successful teleportation increases with the number of input copies, a feature that was impossible in classical physics. In the limit of asymptotically large NNN, the probability converges to the probability of simulation for an ideal classical channel. Similar results are found for universal cloning channels from NNN copies to M>NM>NM>N approximate copies, exploiting a time-reversal duality between universal cloning and a partial trace.
We propose a protocol implementing optimal partial deterministic quantum teleportation for qubits. This is a teleportation scheme realizing deterministically an optimal $1\ensuremath{\rightarrow}2$ asymmetric universal cloning where one imperfect copy of the input state emerges at the sender's station while the other copy emerges at receiver's possibly distant station. The optimality means that the fidelities of the copies saturate the asymmetric cloning inequality. The performance of the protocol relies on the partial deterministic nondemolition Bell measurement that allows us to continuously control the flow of information among the outgoing qubits. We also demonstrate that the measurement is optimal two-qubit operation in the sense of the trade-off between the state disturbance and the information gain.
Abstract We investigate prepare-and-measure scenarios in which a sender and a receiver use entanglement to send quantum information over a channel with limited capacity. We formalise this framework, identify its basic properties and provide numerical tools for optimising quantum protocols for generic communication tasks. The seminal protocol for sending quantum information over a classical channel is teleportation. We study a natural stochastic generalisation in which the sender holds N qubits from which the receiver can recover one on demand. We show that, if the classical communication is allowed to exploit extremal non-signalling correlations, then two bits of communication suffice to solve this task exactly for any N . We then consider entanglement-based protocols and show that these can be constructed systematically by leveraging connections to several well-known quantum information primitives, such as teleportation, cloning machines and random access coding. In particular, we show that by using genuine multi-particle entangled measurements, one can construct a universal stochastic teleportation machine, i.e. a device whose teleportation fidelity is independent of the quantum input.
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.
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.
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 extend the research program initiated in [Phys. Rev. A 92, 012338 (2015)] from noisy deterministic teleportation protocols to noisy probabilistic (conditional) protocols. Our main goal now is to study how we can increase the fidelity of the teleported state in the presence of noise by working with probabilistic protocols. We work with several scenarios involving the most common types of noise in realistic implementations of quantum communication tasks and find many cases where adding more noise to the probabilistic protocol increases considerably the fidelity of the teleported state, without decreasing the probability of a successful run of the protocol. Also, there are cases where the entanglement of the channel connecting Alice and Bob leading to the greatest fidelity is not maximal. Moreover, there exist cases where the optimal fidelity for the probabilistic protocols are greater than the maximal fidelity (2/3)(2/3)(2/3) achievable by using only classical resources, while the optimal ones for the deterministic protocols under the same conditions lie below this limit. This result clearly illustrates that in some cases we can only get a truly quantum teleportation if we use probabilistic instead of deterministic protocols.