Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Information Processing Letters

Commutativity of quantum weakest preconditions

Mingsheng Ying, Jianxin Chen, Yuan Feng, Runyao Duan

Published Jun 16, 2007• 15 citations
Publisher
DOI
10.1016/j.ipl.2007.06.003

Related papers

Generalised quantum weakest preconditions

Roman Gielerak, Marek Sawerwain

arXiv:0710.5239•Quantum Information Processing•Oct 26, 2009•4 citations

Quantum Computing: From Weakest Preconditions to Voltage Pulses

Thomas Noll, Christina Gehnen, Roy Hermanns

Lecture notes in computer science•Nov 12, 2024•0 citations

Simple characterizations for commutativity of quantum weakest preconditions

Tianrong Lin

In a recent letter [Information Processing Letters~104 (2007) 152-158], it has shown some sufficient conditions for commutativity of quantum weakest preconditions. This paper provides some alternative and simple characterizations for the commutativity of quantum weakest preconditions, i.e., Theorem 3.1, Theorem 3.2 and Proposition 3.3 in what follows. We also show that to characterize the commutativity of quantum weakest preconditions in terms of $[M,N]$ ($=MN-NM$) is hard in the sense of Proposition 4.1 and Proposition 4.2.

arXiv:1108.4607•Aug 23, 2011•0 citations

Bounds for quantum weakest preconditions

Jonas Deutsch

This thesis presents multiple proof rules for bounds on weakest (liberal) preconditions of quantum loops. It adapts Park induction as a basic mechanism for establishing upper bounds of weakest preconditions and lower bounds of weakest liberal preconditions. Building on Park induction, it discusses k-induction and derives the related approach chain comparison as further techniques for reasoning about upper bounds. Finally, it introduces guard strengthening as a mechanism to prove the correctness of lower bounds on weakest preconditions.

•Jan 1, 2025•0 citations

Noncommutativity of quantum observables

B. Rumbos

International Journal of Theoretical Physics•Aug 1, 1993•0 citations

Quantum weakest preconditions

Ellie D’Hondt, Prakash Panangaden

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 stabilisers.

arXiv:quant-ph/0501157•Mathematical Structures in Computer Science•Jun 1, 2006•158 citations
In a recent letter [Information Processing Letters~104 (2007) 152-158], it has shown some sufficient conditions for commutativity of quantum weakest preconditions. This paper provides some alternative and simple characterizations for the commutativity of quantum weakest preconditions, i.e., Theorem 3.1, Theorem 3.2 and Proposition 3.3 in what follows. We also show that to characterize the commutativity of quantum weakest preconditions in terms of [M,N][M,N][M,N] (=MN−NM=MN-NM=MN−NM) is hard in the sense of Proposition 4.1 and Proposition 4.2.
This thesis presents multiple proof rules for bounds on weakest (liberal) preconditions of quantum loops. It adapts Park induction as a basic mechanism for establishing upper bounds of weakest preconditions and lower bounds of weakest liberal preconditions. Building on Park induction, it discusses k-induction and derives the related approach chain comparison as further techniques for reasoning about upper bounds. Finally, it introduces guard strengthening as a mechanism to prove the correctness of lower bounds on weakest preconditions.
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 stabilisers.