pith. sign in

arxiv: 1007.2584 · v3 · pith:VAK4OCXVnew · submitted 2010-07-15 · 🪐 quant-ph · cs.LO

Bisimulation for quantum processes

classification 🪐 quant-ph cs.LO
keywords quantumbisimulationprocessesprovealgebraalgebraicbasicclassical
0
0 comments X
read the original abstract

In this paper we introduce a novel notion of probabilistic bisimulation for quantum processes and prove that it is congruent with respect to various process algebra combinators including parallel composition even when both classical and quantum communications are present. We also establish some basic algebraic laws for this bisimulation. In particular, we prove uniqueness of the solutions to recursive equations of quantum processes, which provides a powerful proof technique for verifying complex quantum protocols.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.