A calculus of mobile processes, II
Information and Computation
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Topology in process calculus: approximate correctness and infinite evolution of concurrent programs
Communication and Concurrency
Quantum computation and quantum information
Quantum computation and quantum information
Bisimulation indexes and their applications
Theoretical Computer Science
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
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
Relations among quantum processes: bisimilarity and congruence
Mathematical Structures in Computer Science
Types and typechecking for Communicating Quantum Processes
Mathematical Structures in Computer Science
Probabilistic bisimulations for quantum processes
Information and Computation
From quantum physics to programming languages: a process algebraic approach
UPP'04 Proceedings of the 2004 international conference on Unconventional Programming Paradigms
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
Floyd--hoare logic for quantum programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Equivalence checking of quantum protocols
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
We introduce an algebra qCCS of pure quantum processes in which communications by moving quantum states physically are allowed and computations are modeled by super-operators, but no classical data is explicitly involved. An operational semantics of qCCS is presented in terms of (nonprobabilistic) labeled transition systems. Strong bisimulation between processes modeled in qCCS is defined, and its fundamental algebraic properties are established, including uniqueness of the solutions of recursive equations. To model sequential computation in qCCS, a reduction relation between processes is defined. By combining reduction relation and strong bisimulation we introduce the notion of strong reduction-bisimulation, which is a device for observing interaction of computation and communication in quantum systems. Finally, a notion of strong approximate bisimulation (equivalently, strong bisimulation distance) and its reduction counterpart are introduced. It is proved that both approximate bisimilarity and approximate reduction-bisimilarity are preserved by various constructors of quantum processes. This provides us with a formal tool for observing robustness of quantum processes against inaccuracy in the implementation of its elementary gates.