Quantum Weakest Preconditions

Details Quantum Weakest Preconditions Quantum Weakest Preconditions

2005-01-26

arxiv.org/abs/quant-ph/0501157v2

Mathematical Structures in Computer Science, 2006

Physics

Quantum Physics

24 pages, 3 figures. Substantial rewrite based on referee reports

Scientific paper

We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between the usual state-transformer semantics and the weakest precondition semantics. Rather than trying to reduce quantum computation to probabilistic programming we develop a notion that is directly taken from concepts used in quantum computation. The proof that weakest preconditions exist for completely positive maps follows immediately from the Kraus representation theorem. As an example we give the semantics of Selinger's language in terms of our weakest preconditions. We also cover some specific situations and exhibit an interesting link with stabilizers.

Affiliated with

Also associated with

No associations

Rating

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 Quantum Weakest Preconditions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Weakest Preconditions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627957