{
  "annotation_id": "cf28c2f1-f2f1-4a3e-9c76-039dfec6e950",
  "date_created": "2026-03-02T18:02:34.706000Z",
  "date_modified": "2026-03-02T18:02:34.706000Z",
  "file_hash": "a38e71b8620983bacae196414e944f5738ca98c9214dbd0e062c1acc989f9ee1",
  "private": false,
  "record": {
    "abstract": "The one-way measurement model is a framework for universal quantum\ncomputation, in which algorithms are partially described by a graph G of\nentanglement relations on a collection of qubits. A sufficient condition for an\nalgorithm to perform a unitary embedding between two Hilbert spaces is for the\ngraph G, together with input/output vertices I, O \\subset V(G), to have a flow\nin the sense introduced by Danos and Kashefi [quant-ph/0506062]. For the\nspecial case of |I| = |O|, using a graph-theoretic characterization, I show\nthat such flows are unique when they exist. This leads to an efficient\nalgorithm for finding flows, by a reduction to solved problems in graph theory.",
    "arxiv_id": "quant-ph/0611284",
    "authors": [
      "Niel de Beaudrap"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.77.022328",
    "journal_ref": "Phys. Rev. A 77, 022328 (2008)",
    "title": "Finding flows in the one-way measurement model",
    "url": "https://arxiv.org/abs/quant-ph/0611284"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "892ff88e-22e0-4444-b7ac-34db5e24cb16",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}