|
| related topics |
| {state, states, entangled} |
| {let, theorem, proof} |
| {state, algorithm, problem} |
| {states, state, optimal} |
| {algorithm, log, probability} |
|
A two-way algorithm for the entanglement problem
Florian Hulpke, Dagmar Bruss
abstract: 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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0407179
- categories:
- quant-ph
- comments:
- 4 pages, 1 figure
- doi:
- 10.1088/0305-4470/38/24/011
- arxiv_id:
- quant-ph/0407179
- journal_ref:
- J. Phys. A: Math. Gen. 38, 5573 (2005)
- created:
- 2004-07-22
Full article ▸
|
|
| related documents |
| 0407227v3 |
| 0107111v2 |
| 9908050v1 |
| 0404051v4 |
| 0409140v1 |
| 0510078v3 |
| 0307023v2 |
| 0608012v2 |
| 0510237v1 |
| 0412220v2 |
| 0311051v1 |
| 0109102v1 |
| 0302075v1 |
| 0508071v3 |
| 0604123v2 |
| 0509218v1 |
| 0509195v1 |
| 0401129v2 |
| 0511116v2 |
| 0512100v1 |
| 0606017v1 |
| 0607190v1 |
| 0512081v2 |
| 0502082v3 |
| 0606077v1 |
|