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

arXiv:1108.4607

Simple characterizations for commutativity of quantum weakest preconditions

Tianrong Lin

Published Aug 23, 2011• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1108.4607

Related papers

Commutativity of quantum weakest preconditions

Mingsheng Ying, Jianxin Chen, Yuan Feng +1 more

Information Processing Letters•Jun 16, 2007•15 citations

Generalised quantum weakest preconditions

Roman Gielerak, Marek Sawerwain

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

A simple sufficient condition for the coexistence of quantum effects

Teiko Heinosaari

Two quantum effects are considered coexistent if they can be measured together. It is known that commutativity and comparability are sufficient but not necessary for the coexistence of two effects. We unify those two conditions to a simple but more widely applicable sufficient condition.

arXiv:1303.7308•Journal of Physics A Mathematical and Theoretical•Apr 3, 2013•16 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

A formal language for expressing quantum predicates

Umut Yiğit Dural

We develop a formal language, a syntax, for specifying quantum predicates, which are yes/no properties of quantum systems. Specifically we study classical-quantum predicates using projector-based Birkhoff-von Neumann quantum logic. We give an extensional definition of a weakest precondition calculus that preserves projector-based predicates fora simple loop-free classical-quantum programming language. We prove that our weakest precondition calculus is relatively complete in the sense of Cook for the classical-quantum programming language we specify. To achieve this, we show that for any post condition expressible in our formal language, the corresponding weakest precondition with respect to any program is also expressible in our formal language. This result establishes a foundation for reasoning about classical-quantum programs using an intensional approach.

•Jan 1, 2025•0 citations

Noncommutative versions of inequalities in quantum information theory

Ali Reza Dadkhah, Mohammad Sal Moslehian, Kenjiro Yanagi

arXiv:1905.02014•Analysis and Mathematical Physics•May 15, 2019•5 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.
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.
We develop a formal language, a syntax, for specifying quantum predicates, which are yes/no properties of quantum systems. Specifically we study classical-quantum predicates using projector-based Birkhoff-von Neumann quantum logic. We give an extensional definition of a weakest precondition calculus that preserves projector-based predicates fora simple loop-free classical-quantum programming language. We prove that our weakest precondition calculus is relatively complete in the sense of Cook for the classical-quantum programming language we specify. To achieve this, we show that for any post condition expressible in our formal language, the corresponding weakest precondition with respect to any program is also expressible in our formal language. This result establishes a foundation for reasoning about classical-quantum programs using an intensional approach.