pith. sign in

arxiv: quant-ph/0010012 · v3 · submitted 2000-10-03 · 🪐 quant-ph

Entanglement vs. Noncommutativity in Teleportation

classification 🪐 quant-ph
keywords entanglementproofqubitssimpleteleportationalternativebipartitechannel
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.