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:quant-ph/0010012

Entanglement vs. Noncommutativity in Teleportation

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

Published Oct 3, 2000• 0 citations
arXivHTMLPDF

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.48550/arxiv.quant-ph/0010012

Related papers

Entanglement versus noncommutativity in teleportation

Sibasish Ghosh A, Guruprasad Kar, Anirban Roy +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.

Physical Review A•Feb 14, 2002•6 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

Perfect Quantum Teleportation via Bell States

Xiaoqing Tan, Xiaochun Li and Pei Yang

Quantum mechanics shows superiority than classical mechanics in many aspects and quantum entanglement plays an essential role in information processing and some computational tasks such as quantum teleportation (QT). QT was proposed to transmit the unknown states, in which EPR pairs, the entangled states, can be used as quantum channels. In this paper, we present two simple schemes for teleporting a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state respectively. Alice and Bob have shared an entangle state. Two Bell states are used as quantum channels. Then after Alice measuring her qubits and informing Bob her measurement results, Bob can perfectly reconstruct the original state by performing corresponding unitary operators on his qubits. It shown that a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state can be teleported perfectly, i.e. the success probabilities of our schemes are both 1.

Computers, materials & continua/Computers, materials & continua (Print)•Jan 1, 2018•21 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.
Quantum mechanics shows superiority than classical mechanics in many aspects and quantum entanglement plays an essential role in information processing and some computational tasks such as quantum teleportation (QT). QT was proposed to transmit the unknown states, in which EPR pairs, the entangled states, can be used as quantum channels. In this paper, we present two simple schemes for teleporting a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state respectively. Alice and Bob have shared an entangle state. Two Bell states are used as quantum channels. Then after Alice measuring her qubits and informing Bob her measurement results, Bob can perfectly reconstruct the original state by performing corresponding unitary operators on his qubits. It shown that a product state of two arbitrary single-particle and an arbitrary two-particle pure entangled state can be teleported perfectly, i.e. the success probabilities of our schemes are both 1.