Pith. sign in

REVIEW

Realization of Optimal Disentanglement by Teleportation via Separable Channel

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/0102010 v1 pith:TEVPWV2G submitted 2001-02-02 quant-ph

Realization of Optimal Disentanglement by Teleportation via Separable Channel

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

We discuss here the best disentanglement processes of states of two two-level systems which belong to (i) the universal set, (ii) the set in which the states of one party lie on a single great circle of the Bloch sphere, and (iii) the set in which the states of one party commute with each other, by teleporting the states of one party (on which the disentangling machine is acting) through three particular type of separable channels, each of which is a mixture of Bell states. In the general scenario, by teleporting one party's state of an arbitrary entangled state of two two-level parties through some mixture of Bell states, we have shown that this entangled state can be made separable by using a physically realizable map $\tilde{V}$, acting on one party's states, if $\tilde{V} (I) = I, \tilde{V} ({\sigma}_j) = {\lambda}_j {\sigma}_j$, where ${\lambda}_j \ge 0$ (for $j = 1, 2, 3$), and ${\lambda}_1 + {\lambda}_2 + {\lambda}_3 \le 1$.

discussion (0)

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