Quantum Expectation Transformers for Cost Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Quantum Expectation Transformers for Cost Analysis

Abstract

We introduce a new kind of expectation transformer for a mixed classical-quantum programming language. Our semantic approach relies on a new notion of a cost structure, which we introduce and which can be seen as a specialisation of the Kegelspitzen of Keimel and Plotkin. We show that our weakest precondition analysis is both sound and adequate with respect to the operational semantics of the language. Using the induced expectation transformer, we provide formal analysis methods for the expected cost analysis and expected value analysis of classical-quantum programs. We illustrate the usefulness of our techniques by computing the expected cost of several well-known quantum algorithms and protocols, such as coin tossing, repeat until success, entangled state preparation, and quantum walks.
Fichier principal
Vignette du fichier
AVGQ.pdf (668.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03540366 , version 1 (23-01-2022)

Identifiers

  • HAL Id : hal-03540366 , version 1

Cite

Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix, Vladimir Zamdzhiev. Quantum Expectation Transformers for Cost Analysis. Symposium on Logic In Computer Science LICS ’22, Aug 2022, Haifa, Israel. ⟨hal-03540366⟩
106 View
57 Download

Share

Gmail Facebook Twitter LinkedIn More