An axiomatic basis for computer programming
Communications of the ACM
Quantum computation and quantum information
Quantum computation and quantum information
A Discipline of Programming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Quantum Information with Continuous Variables
Quantum Information with Continuous Variables
Towards a quantum programming language
Mathematical Structures in Computer Science
Acta Informatica
Mathematical Structures in Computer Science
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
Natural Quantum Operational Semantics with Predicates
International Journal of Applied Mathematics and Computer Science - Selected Problems of Computer Science and Control
On the completeness of the inductive assertion method
Journal of Computer and System Sciences
Hi-index | 0.00 |
Generalisation of the quantum weakest precondition result of D'Hondt and Panangaden is presented. In particular the most general notion of quantum predicate as positive operator valued measure (termed POVM) is introduced. The previously known quantum weakest precondition result has been extended to cover the case of POVM playing the role of a quantum predicate. Additionally, our result is valid in infinite dimension case and also holds for a quantum programs defined as a positive but not necessary completely positive transformations of a quantum states.