Computer Science – Logic in Computer Science
Scientific paper
2012-02-16
Computer Science
Logic in Computer Science
30 pages, 7 figures, comments are welcome
Scientific paper
With the previous notions of bisimulation presented in literature, to check if two quantum processes are bisimilar, we have to instantiate the free quantum variables of them with arbitrary quantum states, and verify the bisimilarity of resultant configurations. This makes checking bisimilarity infeasible from an algorithmic point of view because quantum states constitute a continuum. In this paper, we introduce a symbolic operational semantics for quantum processes directly at the quantum operation level, which allows us to describe the bisimulation between quantum processes without resorting to quantum states. We show that the symbolic bisimulation defined here is equivalent to the open bisimulation for quantum processes in the previous work, when strong bisimulations are considered. An algorithm for checking symbolic ground bisimilarity is presented. We also give a modal logical characterisation for quantum bisimilarity based on an extension of Hennessy-Milner logic to quantum processes.
Deng Yuxin
Feng Yangyue
Ying Mingsheng
No associations
LandOfFree
Symbolic bisimulation for quantum processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Symbolic bisimulation for quantum processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic bisimulation for quantum processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-124875