Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Process algebra
A calculus of mobile processes, II
Information and Computation
A theory of communicating processes with value passing
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A theory of bisimulation for the &lgr;-calculus
Acta Informatica
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication and Concurrency
Quantum computation and quantum information
Quantum computation and quantum information
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Toward a quantum process algebra
Proceedings of the 1st conference on Computing frontiers
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
Types and typechecking for Communicating Quantum Processes
Mathematical Structures in Computer Science
Environmental Bisimulations for Higher-Order Languages
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Probabilistic bisimulations for quantum processes
Information and Computation
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
An algebra of quantum processes
ACM Transactions on Computational Logic (TOCL)
Testing Finitary Probabilistic Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Bisimulation for quantum processes
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
| Hi-index | 0.00 |
Quantum processes describe concurrent communicating systems that may involve quantum information. We propose a notion of open bisimulation for quantum processes and show that it provides both a sound and complete proof methodology for a natural extensional behavioural equivalence between quantum processes. We also give a modal characterisation of the behavioural equivalence, by extending the Hennessy-Milner logic to a quantum setting.