A two-way algorithm for the entanglement problem

Details A two-way algorithm for the entanglement problem A two-way algorithm for the entanglement problem

2004-07-22

arxiv.org/abs/quant-ph/0407179v1

J. Phys. A: Math. Gen. 38, 5573 (2005)

Physics

Quantum Physics

4 pages, 1 figure

Scientific paper

10.1088/0305-4470/38/24/011

We propose an algorithm which proves a given bipartite quantum state to be separable in a finite number of steps. Our approach is based on the search for a decomposition via a countable subset of product states, which is dense within all product states. Performing our algorithm simultaneously with the algorithm by Doherty, Parrilo and Spedalieri (which proves a quantum state to be entangled in a finite number of steps) leads to a two-way algorithm that terminates for any input state. Only for a set of arbitrary small measure near the border between separable and entangled states the result is inconclusive.

Affiliated with

Also associated with

No associations

Rating

A two-way algorithm for the entanglement problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A two-way algorithm for the entanglement problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A two-way algorithm for the entanglement problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-278856