Affiliation:
1. University of Technology, Sydney, Australia, and Tsinghua University, China
2. Shanghai Jiao Tong University, China
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.
Funder
Australian Research Council
National Natural Science Foundation of China
Chinese Academy of Sciences
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Branching bisimulation semantics for quantum processes;Information Processing Letters;2024-08
2. Quantum Bisimilarity via Barbs and Contexts: Curbing the Power of Non-deterministic Observers;Proceedings of the ACM on Programming Languages;2024-01-05
3. References;Foundations of Quantum Programming;2024
4. Prospects;Foundations of Quantum Programming;2024
5. Distributed quantum programs;Foundations of Quantum Programming;2024