Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
A process algebra for probabilistic and nondeterministic processes
Information Processing Letters
Communication and Concurrency
Quantum computation and quantum information
Quantum computation and quantum information
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Introduction to Process Algebra
Introduction to Process Algebra
The Linear Time - Branching Time Spectrum II
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Process Algebra with Probabilistic Choice
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Towards a quantum programming language
Mathematical Structures in Computer Science
Types and typechecking for Communicating Quantum Processes
Mathematical Structures in Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
Probabilistic bisimulations for quantum processes
Information and Computation
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
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 |
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and distributed quantum computations and quantum communication protocols, communications over quantum channels that move qubits physically from one place to another must also be taken into account.Inspired by classical process algebras, which provide a framework for modelling cooperating computations, a process algebraic notation is defined. This notation provides a homogeneous style for formal descriptions of concurrent and distributed computations comprising both quantum and classical parts. Based upon an operational semantics that makes sure that quantum objects, operations and communications operate according to the postulates of quantum mechanics, an equivalence is defined among process states considered as having the same behaviour. This equivalence is a probabilistic branching bisimulation. From this relation, an equivalence on processes is defined. However, it is not a congruence because it is not preserved by parallel composition.