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

Lecture notes in computer science

Quantum Computing: From Weakest Preconditions to Voltage Pulses

Thomas Noll, Christina Gehnen, Roy Hermanns

Published Nov 12, 2024• 0 citations
Publisher
DOI
10.1007/978-3-031-75783-9_9

Related papers

Quantum Computing: Basics and New Results

Anas N. Al‐Rabadi

Springer eBooks•Jan 1, 2004•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

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

Quantum computing: Memorable pulses

NPG Asia Materials•Nov 16, 2009•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

Quantum Weakest Preconditions Revisited: Pre-expectations for Expected Runtime Analysis

Christina Gehnen, Dominique Unruh, Joost-Pieter Katoen

Quantum weakest preconditions are a fundamental tool for program verification of quantum programs. Many variations have been reported in the literature. We revisit quantum weakest preconditions from the perspective of expected runtime analysis of quantum programs and introduce a novel pre-expectation framework that enables to reason about the preconditions of quantum programs without the need of an upper bound. This is particularly interesting for quantum programs involving reward statements. The overall goal is to analyze runtime behavior even in the case of programs with potentially infinite expected runtime. This paper presents several ways to do so, e.g., a program transformation such that the expected runtime of a quantum program can be expressed using the weakest pre-expectation calculus with rewards.

cs.LOCross-listedarXiv:2607.12532•Jul 15, 2026•0 citations
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.
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.
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.
Quantum weakest preconditions are a fundamental tool for program verification of quantum programs. Many variations have been reported in the literature. We revisit quantum weakest preconditions from the perspective of expected runtime analysis of quantum programs and introduce a novel pre-expectation framework that enables to reason about the preconditions of quantum programs without the need of an upper bound. This is particularly interesting for quantum programs involving reward statements. The overall goal is to analyze runtime behavior even in the case of programs with potentially infinite expected runtime. This paper presents several ways to do so, e.g., a program transformation such that the expected runtime of a quantum program can be expressed using the weakest pre-expectation calculus with rewards.