{
  "annotation_id": "2f254615-c8b2-4987-8118-9913062031f5",
  "date_created": "2026-03-02T18:02:27.674000Z",
  "date_modified": "2026-03-02T18:02:27.674000Z",
  "file_hash": "db706a96523f5b057e6589db12a763208eaab99e108d7a2d246654d4f01d3844",
  "private": false,
  "record": {
    "abstract": "Full formal descriptions of algorithms making use of quantum principles must\ntake into account both quantum and classical computing components, as well as\ncommunications between these components. Moreover, to model concurrent and\ndistributed quantum computations and quantum communication protocols,\ncommunications over quantum channels which move qubits physically from one\nplace to 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.\nThis notation provides a homogeneous style to formal descriptions of concurrent\nand distributed computations comprising both quantum and classical parts. Based\nupon an operational semantics which makes sure that quantum objects, operations\nand communications operate according to the postulates of quantum mechanics, an\nequivalence is defined among process states considered as having the same\nbehavior. This equivalence is a probabilistic branching bisimulation. From this\nrelation, an equivalence on processes is defined. However, it is not a\ncongruence because it is not preserved by parallel composition.",
    "arxiv_id": "quant-ph/0603274",
    "authors": [
      "Marie Lalire"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Relations among quantum processes: bisimilarity and congruence",
    "url": "https://arxiv.org/abs/quant-ph/0603274"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0c7707ca-31d4-482e-a4ac-1ec009577c65",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}