Pith. sign in

REVIEW

Teleporting Noncommuting Qubits Require Maximal Entanglement

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0012118 v1 pith:U2SJLDGB submitted 2000-12-21 quant-ph

Teleporting Noncommuting Qubits Require Maximal Entanglement

classification quant-ph
keywords entanglementemphknownnoncommutingqubitschannelcommutingebit
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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.

discussion (0)

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