Proof Rules For The Correctness Of Quantum Programs

Elsevier Science Bv
Publication Type:
Journal Article
Theoretical Computer Science, 2007, 386 (1-2), pp. 151 - 166
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008004827.pdf319.2 kB
Adobe PDF
We apply the notion of quantum predicate proposed by D'Hondt and Panangaden to analyze a simple language fragment which may describe the quantum part of a future quantum computer in Knill's architecture. The notion of weakest liberal precondition semanti
Please use this identifier to cite or link to this item: