Quantum expectation transformers for cost analysis

DOI10.1145/3531130.3533332MaRDI QIDQ6649439

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

Publication date: 6 December 2024

zbMATH Keywords

formal semanticscomplexity analysisquantum programmingexpectation transformer

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic PDL
• On probabilistic term rewriting
• Inferring expected runtimes of probabilistic integer programs using expected sizes
• A category of quantum posets
• Quantum programming with inductive datatypes: causality and affine type theory
• Strong adequacy and untyped full-abstraction for probabilistic coherence spaces
• Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Abstraction, Refinement and Proof for Probabilistic Systems
• Towards a quantum programming language
• An axiomatic basis for computer programming
• Term Rewriting and Applications

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