Bisimulation through probabilistic testing
Information and Computation
A calculus of mobile processes, II
Information and Computation
A theory of communicating processes with value passing
Information and Computation
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Quantum computation and quantum information
Quantum computation and quantum information
Additive models of probabilistic processes
Theoretical Computer Science
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Toward a quantum process algebra
Proceedings of the 1st conference on Computing frontiers
Towards a quantum programming language
Mathematical Structures in Computer Science
Communicating quantum processes
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relations among quantum processes: bisimilarity and congruence
Mathematical Structures in Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
An algebra of quantum processes
ACM Transactions on Computational Logic (TOCL)
Bisimulation for quantum processes
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundations of quantum programming
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Bisimulation for Quantum Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reachability and termination analysis of concurrent quantum programs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Open bisimulation for quantum processes
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Hi-index | 0.00 |
Modeling and reasoning about concurrent quantum systems is very important for both distributed quantum computing and quantum protocol verification. As a consequence, a general framework formally describing communication and concurrency in complex quantum systems is necessary. For this purpose, we propose a model named qCCS. It is a natural quantum extension of classical value-passing CCS which can deal with input and output of quantum states, and unitary transformations and measurements on quantum systems. The operational semantics of qCCS is given in terms of probabilistic labeled transition system. This semantics has many different features compared with the proposals in the available literature in order to describe the input and output of quantum systems which are possibly correlated with other components. Based on this operational semantics, the notions of strong probabilistic bisimulation and weak probabilistic bisimulation between quantum processes are introduced. Furthermore, some properties of these two probabilistic bisimulations, such as congruence under various combinators, are examined.