Symbolic bisimulation for quantum processes

Yuan Feng, Yuxin Deng, Mingsheng Ying

Research output: Contribution to journalArticlepeer-review

22 Scopus citations

Abstract

With the previous notions of bisimulation presented in the literature, to check if two quantum processes are bisimilar, we have to instantiate their free quantum variables with arbitrary quantum states, and verify the bisimilarity of the resulting configurations. This makes checking bisimilarity infeasible from an algorithmic point of view, because quantum states constitute a continuum. In this article, 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 previous work, when strong bisimulations are considered. An algorithm for checking symbolic ground bisimilarity is presented. We also give a modal characterisation for quantum bisimilarity based on an extension of Hennessy-Milner logic to quantum processes.

Original languageEnglish
Article number14
JournalACM Transactions on Computational Logic
Volume15
Issue number2
DOIs
StatePublished - Apr 2014
Externally publishedYes

Keywords

  • Open bisimulation
  • Quantum processes
  • Symbolic bisimulation

Fingerprint

Dive into the research topics of 'Symbolic bisimulation for quantum processes'. Together they form a unique fingerprint.

Cite this