dorsal/arxiv
View SchemaDistributed measurement-based quantum computation
| Authors | Vincent Danos, Ellie D'Hondt, Elham Kashefi, Prakash Panangaden |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0506070 |
| URL | https://arxiv.org/abs/quant-ph/0506070 |
Abstract
We develop a formal model for distributed measurement-based quantum computations, adopting an agent-based view, such that computations are described locally where possible. Because the network quantum state is in general entangled, we need to model it as a global structure, reminiscent of global memory in classical agent systems. Local quantum computations are described as measurement patterns. Since measurement-based quantum computation is inherently distributed, this allows us to extend naturally several concepts of the measurement calculus, a formal model for such computations. Our goal is to define an assembly language, i.e. we assume that computations are well-defined and we do not concern ourselves with verification techniques. The operational semantics for systems of agents is given by a probabilistic transition system, and we define operational equivalence in a way that it corresponds to the notion of bisimilarity. With this in place, we prove that teleportation is bisimilar to a direct quantum channel, and this also within the context of larger networks.
{
"annotation_id": "6d895bc0-7d04-4238-a6c0-b7bcd295d8cf",
"date_created": "2026-03-02T18:02:17.083000Z",
"date_modified": "2026-03-02T18:02:17.083000Z",
"file_hash": "e1b781203717374f87256ed4f6702c0a26548e7b134c655acdbd0a9c0e13bcff",
"private": false,
"record": {
"abstract": "We develop a formal model for distributed measurement-based quantum\ncomputations, adopting an agent-based view, such that computations are\ndescribed locally where possible. Because the network quantum state is in\ngeneral entangled, we need to model it as a global structure, reminiscent of\nglobal memory in classical agent systems. Local quantum computations are\ndescribed as measurement patterns. Since measurement-based quantum computation\nis inherently distributed, this allows us to extend naturally several concepts\nof the measurement calculus, a formal model for such computations. Our goal is\nto define an assembly language, i.e. we assume that computations are\nwell-defined and we do not concern ourselves with verification techniques. The\noperational semantics for systems of agents is given by a probabilistic\ntransition system, and we define operational equivalence in a way that it\ncorresponds to the notion of bisimilarity. With this in place, we prove that\nteleportation is bisimilar to a direct quantum channel, and this also within\nthe context of larger networks.",
"arxiv_id": "quant-ph/0506070",
"authors": [
"Vincent Danos",
"Ellie D\u0027Hondt",
"Elham Kashefi",
"Prakash Panangaden"
],
"categories": [
"quant-ph"
],
"title": "Distributed measurement-based quantum computation",
"url": "https://arxiv.org/abs/quant-ph/0506070"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "1d7ff22f-4893-4a36-9e45-a4d160402b1b",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}