Quantum expectation transformers for cost analysis

DOI10.1145/3531130.3533332MaRDI QIDQ6649439zbMATH OpenFDO

Authors Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev

Publication date 6 December 2024

Full work available at URL https://doi.org/10.1145/3531130.3533332

zbMATH Keywords

complexity analysisexpectation transformerformal semanticsquantum programming

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Cites work

• A category of quantum posets
• A probabilistic PDL
• A weakest pre-expectation semantics for mixed-sign expectations
• Abstraction, Refinement and Proof for Probabilistic Systems
• An axiomatic basis for computer programming
• Convexity and order in probabilistic call-by-name FPC
• scientific article; zbMATH DE number 6712178 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• Inferring expected runtimes of probabilistic integer programs using expected sizes
• On probabilistic term rewriting
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum programming with inductive datatypes: causality and affine type theory
• Strong adequacy and untyped full-abstraction for probabilistic coherence spaces
• Term Rewriting and Applications
• Towards a quantum programming language
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Weakest precondition reasoning for expected run-times of probabilistic programs

Cited in

(2)

• Weighted rewriting
• Quantum weakest preconditions for reasoning about expected runtimes of quantum programs

This page was built for publication: Quantum expectation transformers for cost analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649439)