A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Towards a quantum programming language
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Proof rules for the correctness of quantum programs
Theoretical Computer Science
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Foundations of quantum programming
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Hi-index | 0.89 |
The notion of quantum weakest precondition was introduced by D'Hondt and P. Panangaden [E. D'Hondt, P. Panangaden, Quantum weakest preconditions, Mathematical Structures in Computer Science 16 (2006) 429-451], and they presented a representation of weakest precondition of a quantum program in the operator-sum form. In this Letter, we give an intrinsic characterization of the weakest precondition of a quantum program given in a system-environment model. Furthermore, some sufficient conditions for commutativity of quantum weakest preconditions are presented.