Quick search Find article
Quick search
Find article

The reduction of the closest disentangled states

Satoshi Ishizaka

Show affiliations


We study the closest disentangled state to a given entangled state in any system (multi-party with any dimension). We obtain the set of equations the closest disentangled state must satisfy, and show that its reduction is strongly related to the extremal condition of the local filtering on each party. Although the equations we obtain are not still tractable, we find some sufficient conditions for which the closest disentangled state has the same reduction as the given entangled state. Further, we suggest a prescription to obtain a tight upper bound of the relative entropy of entanglement in two-qubit systems.


PACS

03.65.Ud Entanglement and quantum nonlocality (e.g. EPR paradox, Bell's inequalities, GHZ states, etc.)

03.67.-a Quantum information

MSC

81P68 Quantum computation and quantum cryptography (See also 68Q05, 94A60)

Subjects

Computational physics

Quantum information and quantum mechanics

Dates

Issue 38 (27 September 2002)

Received 19 April 2002, in final form 16 July 2002

Published 12 September 2002



View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.