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

Entanglement versus noncommutativity in teleportation

Sibasish Ghosh A, Guruprasad Kar, Anirban Roy, Ujjwal Sen

Published Feb 14, 2002• 6 citations
Publisher

Abstract

We provide an alternative simple proof of the necessity of entanglement in quantum teleportation by using the no-disentanglement theorem. We show that this is true even when the state to be teleported is known to be among two noncommuting qubits. We further show that to teleport any set of commuting qubits, it is sufficient to have a classically correlated channel. Using this result we provide a simple proof of the fact that any set of bipartite entangled states can be exactly disentangled if the single-particle density matrices of any one party commute.

DOI
10.1103/physreva.65.032309

Related papers

Entanglement vs. Noncommutativity in Teleportation

Sibasish Ghosh A, Guruprasad Kar, Roy, Anirban +1 more

We provide an alternative simple proof of the necessity of entanglement in quantum teleportation by using the no-disentanglement theorem. We show that this is true even when the state to be teleported is known to be among two noncommuting qubits. We further show that to teleport any set of commuting qubits, it is sufficient to have a classically correlated channel. Using this result we provide a simple proof of the fact that any set of bipartite entangled states can be exactly disentangled if the single particle density matrices of any one party commute.

arXiv:quant-ph/0010012•Oct 3, 2000•0 citations

Teleporting Noncommuting Qubits Require Maximal Entanglement

Sibasish Ghosh A, Guruprasad Kar, Roy, Anirban +2 more

Very recently, it was shown by Ghosh, Kar, Roy and Sen (\emph{Entanglement vs. Noncommutativity in Teleportation}, quant-ph/0010012) that if it is \emph{a priori} known that the state to be teleported is from a commuting set of qubits, a separable channel is sufficient. We show that 1 ebit of entanglement is a necessary resource to teleport a qubit even when it is known to be one of two noncommuting states.

arXiv:quant-ph/0012118•Dec 21, 2000•1 citation

Quantum entanglement and teleportation assisted by multiple parties

Hayashida, Takeshi

Quantum teleportation can be performed if and only if a message is combined with a maximally entangled state. Bennett et al. originally claimed this feasibility condition. In this paper, I give a proof of that condition. Moreover, I specify the condition for teleportation when a single-qubit message is combined with a three-qubit state distributed among three parties. I also consider the situation that a single-qubit message is combined with an $n$-qubit state distributed among $n$ parties.

arXiv:1212.2294•Dec 11, 2012•0 citations

A simple unconditionally secure quantum bit commitment protocol via quantum teleportation

Horace P. Yuen

By using local quantum teleportation of a fixed state to one qubit of an entangled pair sent from the other party, it is shown how one party can commit a bit with only classical information as evidence that results in an unconditionally secure protocol. The well-known ``impossibility proof'' does not cover such protocols due to its different commitment and opening prescriptions, which necessitate actual quantum measurements among different possible systems that cannot be entangled as a consequence.

arXiv:quant-ph/0305142•May 23, 2003•3 citations

Teleportation-Induced Correlated Quantum Channels

Filippo Caruso, Vittorio Giovannetti, G. Massimo Palma

Quantum teleportation of an n-qubit state performed using as an entangled resource a general bipartite state of 2n qubits instead of n Bell states is equivalent to a correlated Pauli channel. This yields a new characterization of such channels in terms of many-body correlation functions of the teleporting media. It provides a relatively simple method for determining whether a correlated quantum channel is able to reliably convey quantum messages by studying the entanglement properties of the teleportation mediating system. Our model is then generalized to the continuous-variable case.

arXiv:0906.0506•Physical Review Letters•Jan 14, 2010•19 citations

Bound entanglement and teleportation

Noah Linden, Sandu Popescu

Recently M. Horodecki, P. Horodecki, and R. Horodecki [Phys. Rev. Lett. 80, 5239 (1998)] have introduced a set of density matrices of two spin-1 particles from which it is not possible to distill any maximally entangled states, even though the density matrices are entangled. Thus these density matrices do not allow reliable teleportation. However, it might nevertheless be the case that these states can be used for teleportation, not reliably, but still with fidelity greater than that which may be achieved with a classical scheme. We show that, at least for some of these density matrices, teleportation cannot be achieved with better than classical fidelity.

arXiv:quant-ph/9807069•Physical Review A•Jan 1, 1999•31 citations
We provide an alternative simple proof of the necessity of entanglement in quantum teleportation by using the no-disentanglement theorem. We show that this is true even when the state to be teleported is known to be among two noncommuting qubits. We further show that to teleport any set of commuting qubits, it is sufficient to have a classically correlated channel. Using this result we provide a simple proof of the fact that any set of bipartite entangled states can be exactly disentangled if the single-particle density matrices of any one party commute.
We provide an alternative simple proof of the necessity of entanglement in quantum teleportation by using the no-disentanglement theorem. We show that this is true even when the state to be teleported is known to be among two noncommuting qubits. We further show that to teleport any set of commuting qubits, it is sufficient to have a classically correlated channel. Using this result we provide a simple proof of the fact that any set of bipartite entangled states can be exactly disentangled if the single particle density matrices of any one party commute.
Quantum teleportation can be performed if and only if a message is combined with a maximally entangled state. Bennett et al. originally claimed this feasibility condition. In this paper, I give a proof of that condition. Moreover, I specify the condition for teleportation when a single-qubit message is combined with a three-qubit state distributed among three parties. I also consider the situation that a single-qubit message is combined with an nnn-qubit state distributed among nnn parties.
By using local quantum teleportation of a fixed state to one qubit of an entangled pair sent from the other party, it is shown how one party can commit a bit with only classical information as evidence that results in an unconditionally secure protocol. The well-known ``impossibility proof'' does not cover such protocols due to its different commitment and opening prescriptions, which necessitate actual quantum measurements among different possible systems that cannot be entangled as a consequence.
Quantum teleportation of an n-qubit state performed using as an entangled resource a general bipartite state of 2n qubits instead of n Bell states is equivalent to a correlated Pauli channel. This yields a new characterization of such channels in terms of many-body correlation functions of the teleporting media. It provides a relatively simple method for determining whether a correlated quantum channel is able to reliably convey quantum messages by studying the entanglement properties of the teleportation mediating system. Our model is then generalized to the continuous-variable case.
Recently M. Horodecki, P. Horodecki, and R. Horodecki [Phys. Rev. Lett. 80, 5239 (1998)] have introduced a set of density matrices of two spin-1 particles from which it is not possible to distill any maximally entangled states, even though the density matrices are entangled. Thus these density matrices do not allow reliable teleportation. However, it might nevertheless be the case that these states can be used for teleportation, not reliably, but still with fidelity greater than that which may be achieved with a classical scheme. We show that, at least for some of these density matrices, teleportation cannot be achieved with better than classical fidelity.