On the Hardness of Analyzing Quantum Programs Quantitatively - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2023

On the Hardness of Analyzing Quantum Programs Quantitatively

Abstract

In this paper, we study quantitative properties of quantum programs. Properties of interest include (positive) almost-sure termination, expected runtime or expected cost, that is, for example, the expected number of applications of a given quantum gate, etc. After studying the completeness of these problems in the arithmetical hierarchy over the Clifford+T fragment of quantum mechanics, we express these problems using a variation of a quantum pre-expectation transformer, a weakest precondition based technique that allows to symbolically compute these quantitative properties. Under a smooth restriction-a restriction to polynomials of bounded degree over a real closed field-we show that the quantitative problem, which consists in finding an upper-bound to the pre-expectation, can be decided in time double-exponential in the size of a program, thus providing, despite its great complexity, one of the first decidable results on the analysis and verification of quantum programs. Finally, we sketch how the latter can be transformed into an efficient synthesis method.
Fichier principal
Vignette du fichier
synthesis-hal.pdf (603.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04349874 , version 1 (20-12-2023)

Licence

Attribution

Identifiers

Cite

Martin Avanzini, Georg Moser, Romain Péchoux, Simon Perdrix. On the Hardness of Analyzing Quantum Programs Quantitatively. 2023. ⟨hal-04349874⟩
29 View
13 Download

Altmetric

Share

Gmail Facebook X LinkedIn More