Bisimulation for quantum processes

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 is a joint work with R. Duan and M. Ying, published at POPL 2011.
The full paper is also available at http://arxiv.org/abs/1007.2584.

Dr. Yuan Feng is an Associate Professor at Centre for Quantum Computation and Intelligent Systems (QCIS), University of Technology, Sydney, Australia, with research interests mainly in quantum information and quantum computation. He received his BS and PhD degrees from the Department of Applied Mathematics and the Department of Computer Science and Technology, Tsinghua University, in 1999 and 2004, respectively. Before joining UTS, he was an associate professor at the Department of Computer Science and Te
chnology, Tsinghua University, China.