{
  "annotation_id": "89dbece6-d729-4fb3-a0db-67ae38e13a48",
  "date_created": "2026-03-02T18:02:09.600000Z",
  "date_modified": "2026-03-02T18:02:09.600000Z",
  "file_hash": "a4df2dbd86dd5ccd01a443e667dea376ed9c8aa0076b0b8237c4741ba8533a72",
  "private": false,
  "record": {
    "abstract": "We propose an algorithm which proves a given bipartite quantum state to be\nseparable in a finite number of steps. Our approach is based on the search for\na decomposition via a countable subset of product states, which is dense within\nall product states. Performing our algorithm simultaneously with the algorithm\nby Doherty, Parrilo and Spedalieri (which proves a quantum state to be\nentangled in a finite number of steps) leads to a two-way algorithm that\nterminates for any input state. Only for a set of arbitrary small measure near\nthe border between separable and entangled states the result is inconclusive.",
    "arxiv_id": "quant-ph/0407179",
    "authors": [
      "Florian Hulpke",
      "Dagmar Bruss"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/0305-4470/38/24/011",
    "journal_ref": "J. Phys. A: Math. Gen. 38, 5573 (2005)",
    "title": "A two-way algorithm for the entanglement problem",
    "url": "https://arxiv.org/abs/quant-ph/0407179"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "223296b8-3e91-4e18-9aad-9593063692d6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}