A Categorical Semantics of Quantum Protocols
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
Journal of the ACM (JACM)
Classical Knowledge for Quantum Cryptographic Reasoning
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed Quantum Programming
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Quantum predicative programming
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
| Hi-index | 0.00 |
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 [V. Danos, E. Kashefi and P. Panangaden, The measurement calculus (2004), arXiv:quant-ph/0412135], 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.