{
  "annotation_id": "574d9128-2d83-442a-ac3f-1820de4938f6",
  "date_created": "2026-03-02T18:02:19.425000Z",
  "date_modified": "2026-03-02T18:02:19.425000Z",
  "file_hash": "07fdd97998b64c0878b438df97c7ec14c2efd949cbb07795556052ba43eb3f9e",
  "private": false,
  "record": {
    "abstract": "Full formal descriptions of algorithms making use of quantum principles must\ntake into account both quantum and classical computing components and assemble\nthem so that they communicate and cooperate.Moreover, to model concurrent and\ndistributed quantum computations, as well as quantum communication protocols,\nquantum to quantum communications which move qubits physically from one place\nto another must also be taken into account.\n  Inspired by classical process algebras, which provide a framework for\nmodeling cooperating computations, a process algebraic notation is defined,\nwhich provides a homogeneous style to formal descriptions of concurrent and\ndistributed computations comprising both quantum and classical parts.Based upon\nan operational semantics which makes sure that quantum objects, operations and\ncommunications operate according to the postulates of quantum mechanics, a\nprobabilistic branching bisimulation is defined among processes considered as\nhaving the same behavior.",
    "arxiv_id": "quant-ph/0508116",
    "authors": [
      "Marie Lalire"
    ],
    "categories": [
      "quant-ph",
      "cs.PL"
    ],
    "title": "A probabilistic branching bisimulation for quantum processes",
    "url": "https://arxiv.org/abs/quant-ph/0508116"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f4f081c3-2c9d-4ebb-b888-04ebbefd1228",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}