Distributed measurement-based quantum computation
| dc.creator | Danos, Vincent | |
| dc.creator | D'Hondt, Ellie | |
| dc.creator | Kashefi, Elham | |
| dc.creator | Panangaden, Prakash | |
| dc.date | 2005-06-09 | |
| dc.date.accessioned | 2026-07-07T06:12:57Z | |
| dc.date.available | 2026-07-07T06:12:57Z | |
| dc.description | 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. | |
| dc.description | 17 pages | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0506070 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0506070 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/92943 | |
| dc.subject | Quantum Physics | |
| dc.title | Distributed measurement-based quantum computation | |
| dc.type | text |