Quantum Weakest Preconditions

Simple item page
dc.creatorD'Hondt, Ellie
dc.creatorPanangaden, Prakash
dc.date2005-01-26
dc.date2006-02-23
dc.date.accessioned2026-07-07T06:40:51Z
dc.date.available2026-07-07T06:40:51Z
dc.descriptionWe 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.
dc.description24 pages, 3 figures. Substantial rewrite based on referee reports
dc.identifierhttps://arxiv.org/abs/quant-ph/0501157
dc.identifierhttp://arxiv.org/abs/quant-ph/0501157
dc.identifierMathematical Structures in Computer Science, 2006
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101506
dc.subjectQuantum Physics
dc.titleQuantum Weakest Preconditions
dc.typetext

Files

Collections

arXiv