Proof rules for purely quantum programs

Details Proof rules for purely quantum programs Proof rules for purely quantum programs

2005-07-18

arxiv.org/abs/cs/0507043v3

Computer Science

Programming Languages

Now 12 pages, introduction and Section 3 rewritten, some errors corrected

Scientific paper

We apply the notion of quantum predicate proposed by D'Hondt and Panangaden to analyze a purely quantum language fragment which describes the quantum part of a future quantum computer in Knill's architecture. The denotational semantics, weakest precondition semantics, and weakest liberal precondition semantics of this language fragment are introduced. To help reasoning about quantum programs involving quantum loops, we extend proof rules for classical probabilistic programs to our purely quantum programs.

Affiliated with

Also associated with

No associations

Rating

Proof rules for purely quantum programs 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 Proof rules for purely quantum programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof rules for purely quantum programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187953