POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
GSOS and finite labelled transition systems
Theoretical Computer Science
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An axiomatic basis for computer programming
Communications of the ACM
Quantum computing
A Discipline of Programming
Towards a quantum programming language
Mathematical Structures in Computer Science
Progress in Quantum Algorithms
Quantum Information Processing
Mathematical Structures in Computer Science
Quantum Programming Languages: An Introductory Overview
The Computer Journal
Generalised quantum weakest preconditions
Quantum Information Processing
Hi-index | 0.00 |
A general definition of a quantum predicate and quantum labelled transition systems for finite quantum computation systems is presented. The notion of a quantum predicate as a positive operator-valued measure is developed. The main results of this paper are a theorem about the existence of generalised predicates for quantum programs defined as completely positive maps and a theorem about the existence of a GSOS format for quantum labelled transition systems. The first theorem is a slight generalisation of D'Hondt and Panagaden's theorem about the quantum weakest precondition in terms of discrete support positive operator-valued measures.