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:0805.3553

Teleportation in General Probabilistic Theories

Howard Barnum, Jonathan Barrett, Matthew Leifer, Alexander Wilce

Published May 23, 2008• 6 citations
arXivHTMLPDF

Abstract

In a previous paper, we showed that many important quantum information-theoretic phenomena, including the no-cloning and no-broadcasting theorems, are in fact generic in all non-classical probabilistic theories. An exception is teleportation, which most such theories do not support. In this paper, we investigate which probabilistic theories, and more particularly, which composite systems, {\em do} support a teleportation protocol. We isolate a natural class of composite systems that we term {\em regular}, and establish necessary and sufficient conditions for a regular tripartite system to support a conclusive, or post-selected, teleportation protocol. We also establish a sufficient condition for deterministic teleportation that yields a large supply of theories, neither classical nor quantum, that support such a protocol.

DOI
10.48550/arxiv.0805.3553

Related papers

On statistical and deterministic quantum teleportation

Vladimir Božin, Marina Hruška, Nikola Paunković +1 more

We generalize quantum teleportation to, what we call, statistical teleportation utilizing previous results on distant preparation, and on the basic ingredient entities of an entangled composite-system state vector. Our main result is `the central theorem', establishing a simple necessary and sufficient condition for the crucial entity: the event that the sender of a pure quantum state has to measure in the first step of the two-step (and two-laboratory) teleportation procedure. We derive numerous consequences especially for deterministic teleportation (a special case of statistical teleportation), which is a direct generalization of the known quantum teleportation. Detailed further generalization to proper and improper mixtures is investigated. Finally, it is shown that extension to teleportation with nonlinear distant preparation is not possible unless the idea of teleportation is essentially changed.

Journal of Physics A Mathematical and General•May 15, 1998•3 citations

Cloning and Broadcasting in Generic Probabilistic Theories

Howard Barnum, Jonathan Barrett, Matthew Leifer +1 more

We prove generic versions of the no-cloning and no-broadcasting theorems, applicable to essentially {\em any} non-classical finite-dimensional probabilistic model that satisfies a no-signaling criterion. This includes quantum theory as well as models supporting ``super-quantum'' correlations that violate the Bell inequalities to a larger extent than quantum theory. The proof of our no-broadcasting theorem is significantly more natural and more self-contained than others we have seen: we show that a set of states is broadcastable if, and only if, it is contained in a simplex whose vertices are cloneable, and therefore distinguishable by a single measurement. This necessary and sufficient condition generalizes the quantum requirement that a broadcastable set of states commute.

arXiv:quant-ph/0611295•Nov 30, 2006•59 citations

Probabilistic teleportation of shared high-dimensional multi-particle secrets

Yang Liu, Min Jiang

Quantum secret-sharing is a fundamental technique in quantum communication and plays a crucial role in high-dimensional quantum secret transmission. This paper investigates the teleportation of arbitrary d-dimensional multipartite quantum secrets and proposes both deterministic and probabilistic teleportation protocols. The schemes employ generalized Bell-state measurements, generalized Pauli operators, and auxiliary particles to achieve efficient and secure quantum secret-sharing. The deterministic protocol employs maximally entangled channels to achieve perfect sharing with unit success probability. Moreover, the probabilistic protocol, assisted by auxiliary particles and generalized unitary operations, achieves perfect fidelity quantum secret sharing via non-maximally entangled channels. The protocols are further extended to arbitrary d-dimensional systems, and their robustness under several common quantum noise models is analyzed numerically. Compared with previous schemes, the proposed protocols support arbitrary multipartite entangled states, high-dimensional systems, non-maximally entangled channels, and noise analysis within a unified framework. These results enrich the theory of high-dimensional quantum communication and provide practical approaches for future quantum secret-sharing and secure quantum networks.

Journal of the Optical Society of America B•Sep 4, 2026•0 citations

Probabilistic Teleportation of A Tripartite W State

Shi Jin

In this paper,a protocol which can realize probabilistic quantum teleportation of an unknown classical tripartite W entangled state is proposed.Controlled probabilistic quantum teleportation of an unknown generic tripartite W entangled state with a non-maximal tripartite GHZ entangled state and a pair of non-maximal EPR entangled particles as the quantum channels can be realized too.The teleportation associates with the generalized Bell-basis measurement and the C-Not operate,respectively.After the base vector transformation,an auxiliary qubit which the initial state is in the zero state and the corresponding unitary transformation are included in this protocol.

Journal of Huaiyin Teachers College•Jan 1, 2008•0 citations

Quantum teleportation of quantum causal structures

Marius Krumm, Philippe Allard Guérin, Thomas Zauner +1 more

Quantum teleportation is a very helpful information-theoretic protocol that allows to transfer an unknown arbitrary quantum state from one location to another without having to transmit the quantum system through the intermediate region. Quantum states, quantum channels, and indefinite causal structures are all examples of quantum causal structures that not only enable advanced quantum information processing functions, but can also model causal structures in nonclassical spacetimes. In this letter, we develop quantum teleportation of arbitrary quantum causal structures, as formalized by the process matrix framework. Instead of teleporting all the physical degrees of freedom that implement the causal structure, the central idea is to just teleport the inputs to and outputs from the operations of agents. The communication of outcomes of Bell state measurements, which is necessary for deterministic quantum teleportation, is not possible for all causal structures that one might wish to investigate. To avoid this problem, we propose partially and fully post-selected teleportation protocols. We prove that our partially post-selected teleportation protocol is compatible with all quantum causal structures, including those that involve indefinite causal order.

arXiv:2203.00433•Mar 1, 2022•1 citation

Information processing in generalized probabilistic theories

Jonathan Barrett

I introduce a framework in which a variety of probabilistic theories can be defined, including classical and quantum theories, and many others. From two simple assumptions, a tensor product rule for combining separate systems can be derived. Certain features, usually thought of as specifically quantum, turn out to be generic in this framework, meaning that they are present in all except classical theories. These include the nonunique decomposition of a mixed state into pure states, a theorem involving disturbance of a system on measurement (suggesting that the possibility of secure key distribution is generic), and a no-cloning theorem. Two particular theories are then investigated in detail, for the sake of comparison with the classical and quantum cases. One of these includes states that can give rise to arbitrary nonsignaling correlations, including the superquantum correlations that have become known in the literature as nonlocal machines or Popescu-Rohrlich boxes. By investigating these correlations in the context of a theory with well-defined dynamics, I hope to make further progress with a question raised by Popescu and Rohrlich, which is why does quantum theory not allow these strongly nonlocal correlations? The existence of such correlations forces much of the dynamics in this theory to be, in a certain sense, classical, with consequences for teleportation, cryptography, and computation. I also investigate another theory in which all states are local. Finally, I raise the question of what further axiom(s) could be added to the framework in order to identify quantum theory uniquely, and hypothesize that quantum theory is optimal for computation.

arXiv:quant-ph/0508211•Physical Review A•Mar 5, 2007•760 citations
In a previous paper, we showed that many important quantum information-theoretic phenomena, including the no-cloning and no-broadcasting theorems, are in fact generic in all non-classical probabilistic theories. An exception is teleportation, which most such theories do not support. In this paper, we investigate which probabilistic theories, and more particularly, which composite systems, {\em do} support a teleportation protocol. We isolate a natural class of composite systems that we term {\em regular}, and establish necessary and sufficient conditions for a regular tripartite system to support a conclusive, or post-selected, teleportation protocol. We also establish a sufficient condition for deterministic teleportation that yields a large supply of theories, neither classical nor quantum, that support such a protocol.
We generalize quantum teleportation to, what we call, statistical teleportation utilizing previous results on distant preparation, and on the basic ingredient entities of an entangled composite-system state vector. Our main result is `the central theorem', establishing a simple necessary and sufficient condition for the crucial entity: the event that the sender of a pure quantum state has to measure in the first step of the two-step (and two-laboratory) teleportation procedure. We derive numerous consequences especially for deterministic teleportation (a special case of statistical teleportation), which is a direct generalization of the known quantum teleportation. Detailed further generalization to proper and improper mixtures is investigated. Finally, it is shown that extension to teleportation with nonlinear distant preparation is not possible unless the idea of teleportation is essentially changed.
We prove generic versions of the no-cloning and no-broadcasting theorems, applicable to essentially {\em any} non-classical finite-dimensional probabilistic model that satisfies a no-signaling criterion. This includes quantum theory as well as models supporting ``super-quantum'' correlations that violate the Bell inequalities to a larger extent than quantum theory. The proof of our no-broadcasting theorem is significantly more natural and more self-contained than others we have seen: we show that a set of states is broadcastable if, and only if, it is contained in a simplex whose vertices are cloneable, and therefore distinguishable by a single measurement. This necessary and sufficient condition generalizes the quantum requirement that a broadcastable set of states commute.
Quantum secret-sharing is a fundamental technique in quantum communication and plays a crucial role in high-dimensional quantum secret transmission. This paper investigates the teleportation of arbitrary d-dimensional multipartite quantum secrets and proposes both deterministic and probabilistic teleportation protocols. The schemes employ generalized Bell-state measurements, generalized Pauli operators, and auxiliary particles to achieve efficient and secure quantum secret-sharing. The deterministic protocol employs maximally entangled channels to achieve perfect sharing with unit success probability. Moreover, the probabilistic protocol, assisted by auxiliary particles and generalized unitary operations, achieves perfect fidelity quantum secret sharing via non-maximally entangled channels. The protocols are further extended to arbitrary d-dimensional systems, and their robustness under several common quantum noise models is analyzed numerically. Compared with previous schemes, the proposed protocols support arbitrary multipartite entangled states, high-dimensional systems, non-maximally entangled channels, and noise analysis within a unified framework. These results enrich the theory of high-dimensional quantum communication and provide practical approaches for future quantum secret-sharing and secure quantum networks.
In this paper,a protocol which can realize probabilistic quantum teleportation of an unknown classical tripartite W entangled state is proposed.Controlled probabilistic quantum teleportation of an unknown generic tripartite W entangled state with a non-maximal tripartite GHZ entangled state and a pair of non-maximal EPR entangled particles as the quantum channels can be realized too.The teleportation associates with the generalized Bell-basis measurement and the C-Not operate,respectively.After the base vector transformation,an auxiliary qubit which the initial state is in the zero state and the corresponding unitary transformation are included in this protocol.
Quantum teleportation is a very helpful information-theoretic protocol that allows to transfer an unknown arbitrary quantum state from one location to another without having to transmit the quantum system through the intermediate region. Quantum states, quantum channels, and indefinite causal structures are all examples of quantum causal structures that not only enable advanced quantum information processing functions, but can also model causal structures in nonclassical spacetimes. In this letter, we develop quantum teleportation of arbitrary quantum causal structures, as formalized by the process matrix framework. Instead of teleporting all the physical degrees of freedom that implement the causal structure, the central idea is to just teleport the inputs to and outputs from the operations of agents. The communication of outcomes of Bell state measurements, which is necessary for deterministic quantum teleportation, is not possible for all causal structures that one might wish to investigate. To avoid this problem, we propose partially and fully post-selected teleportation protocols. We prove that our partially post-selected teleportation protocol is compatible with all quantum causal structures, including those that involve indefinite causal order.
I introduce a framework in which a variety of probabilistic theories can be defined, including classical and quantum theories, and many others. From two simple assumptions, a tensor product rule for combining separate systems can be derived. Certain features, usually thought of as specifically quantum, turn out to be generic in this framework, meaning that they are present in all except classical theories. These include the nonunique decomposition of a mixed state into pure states, a theorem involving disturbance of a system on measurement (suggesting that the possibility of secure key distribution is generic), and a no-cloning theorem. Two particular theories are then investigated in detail, for the sake of comparison with the classical and quantum cases. One of these includes states that can give rise to arbitrary nonsignaling correlations, including the superquantum correlations that have become known in the literature as nonlocal machines or Popescu-Rohrlich boxes. By investigating these correlations in the context of a theory with well-defined dynamics, I hope to make further progress with a question raised by Popescu and Rohrlich, which is why does quantum theory not allow these strongly nonlocal correlations? The existence of such correlations forces much of the dynamics in this theory to be, in a certain sense, classical, with consequences for teleportation, cryptography, and computation. I also investigate another theory in which all states are local. Finally, I raise the question of what further axiom(s) could be added to the framework in order to identify quantum theory uniquely, and hypothesize that quantum theory is optimal for computation.