{
  "annotation_id": "90128597-f2d5-4309-930e-5b4a645891b2",
  "date_created": "2026-03-02T18:02:23.903000Z",
  "date_modified": "2026-03-02T18:02:23.903000Z",
  "file_hash": "7de1161e34b0b37a47e5fb554a6e37e7ff9fef3730306d539c8026fdcf1647fb",
  "private": false,
  "record": {
    "abstract": "This article is the complement to [quant-ph/0611284], which proves that flows\n(as introduced by [quant-ph/0506062]) can be found efficiently for patterns in\nthe one-way measurement model which have non-empty input and output subsystems\nof the same size. This article presents a complete algorithm for finding flows,\nand a proof of its\u0027 correctness, without assuming any knowledge of\ngraph-theoretic algorithms on the part of the reader. This article is a revised\nversion of [quant-ph/0603072v2], where the results of [quant-ph/0611284] also\nfirst appeared.",
    "arxiv_id": "quant-ph/0603072",
    "authors": [
      "Niel de Beaudrap"
    ],
    "categories": [
      "quant-ph",
      "math.CO"
    ],
    "title": "A complete algorithm to find flows in the one-way measurement model",
    "url": "https://arxiv.org/abs/quant-ph/0603072"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0df84fea-b0a1-41e4-b491-61801b7b140e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}