Computer Science – Logic in Computer Science
Scientific paper
2011-08-23
Computer Science
Logic in Computer Science
Some typos corrected, comments are welcome
Scientific paper
In a recent letter by Ying et al. [Inf. Process. Lett. 104 (2007) 152-158], it has shown some sufficient conditions for commutativity of quantum weakest preconditions. However, the sufficient and necessary condition for quantum weakest preconditions remains open. This letter presents a simple characterization of the commutativity of quantum weakest preconditions. We show that, two quantum weakest preconditions $wp(\mathcal{E})(M)$ and $wp(\mathcal{E})(N)$ commute if and only if the product $wp(\mathcal{E})(M)\cdot wp(\mathcal{E})(N)$ (or, $wp(\mathcal{E})(N)\cdot wp(\mathcal{E})(M)$) is Hermitian.
No associations
LandOfFree
On commutativity of quantum weakest preconditions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On commutativity of quantum weakest preconditions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On commutativity of quantum weakest preconditions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-67337