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:0710.5239 · Quantum Information Processing

Generalised quantum weakest preconditions

Roman Gielerak, Marek Sawerwain

Published Oct 26, 2009• 4 citations
arXivHTMLPDF
DOI
10.1007/s11128-009-0151-8

Related papers

Commutativity of quantum weakest preconditions

Mingsheng Ying, Jianxin Chen, Yuan Feng +1 more

Information Processing Letters•Jun 16, 2007•15 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

Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs

Junyi Liu, Li Zhou, Gilles Barthe +1 more

We study expected runtimes for quantum programs. Inspired by recent work on probabilistic programs, we first define expected runtime as a generalisation of quantum weakest precondition . Then, we show that the expected runtime of a quantum program should be represented as the expectation of an observable (in physics). A method for computing the expected runtimes of quantum programs in finite-dimensional state spaces is developed. Several examples are provided as applications of this method, including computing the expected runtime of quantum Bernoulli Factory – a quantum algorithm for generating random numbers. In particular, using our new method, an open problem of computing the expected runtime of quantum random walks introduced by Ambainis et al. ( STOC 2001) is solved.

arXiv:1911.12557•Journal of the ACM•May 6, 2025•5 citations

Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs

Junyi Liu, Li Zhou, Gilles Barthe +1 more

We study expected runtimes for quantum programs. Inspired by recent work on probabilistic programs, we first define expected runtime as a generalisation of quantum weakest precondition. Then, we show that the expected runtime of a quantum program can be represented as the expectation of an observable (in physics). A method for computing the expected runtimes of quantum programs in finite-dimensional state spaces is developed. Several examples are provided as applications of this method, including computing the expected runtime of quantum Bernoulli Factory – a quantum algorithm for generating random numbers. In particular, using our new method, an open problem of computing the expected runtime of quantum random walks introduced by Ambainis et al. (STOC 2001) is solved.

ACM/IEEE Symposium on Logic in Computer Science (LICS)•Aug 2, 2022•20 citations

Generalized Quantum Inequalities

Sanket Tikare, Svetlin G. Georgiev

Springer eBooks•Jan 1, 2026•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
We study expected runtimes for quantum programs. Inspired by recent work on probabilistic programs, we first define expected runtime as a generalisation of quantum weakest precondition . Then, we show that the expected runtime of a quantum program should be represented as the expectation of an observable (in physics). A method for computing the expected runtimes of quantum programs in finite-dimensional state spaces is developed. Several examples are provided as applications of this method, including computing the expected runtime of quantum Bernoulli Factory – a quantum algorithm for generating random numbers. In particular, using our new method, an open problem of computing the expected runtime of quantum random walks introduced by Ambainis et al. ( STOC 2001) is solved.
We study expected runtimes for quantum programs. Inspired by recent work on probabilistic programs, we first define expected runtime as a generalisation of quantum weakest precondition. Then, we show that the expected runtime of a quantum program can be represented as the expectation of an observable (in physics). A method for computing the expected runtimes of quantum programs in finite-dimensional state spaces is developed. Several examples are provided as applications of this method, including computing the expected runtime of quantum Bernoulli Factory – a quantum algorithm for generating random numbers. In particular, using our new method, an open problem of computing the expected runtime of quantum random walks introduced by Ambainis et al. (STOC 2001) is solved.
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.