An imperative programming language characterizing FBQP - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Poster Communications Year :

An imperative programming language characterizing FBQP


We introduce an imperative programming language called QPT (Quantum Poly-Time) with recursion rules that captures the complexity class FBQP (Functions Bounded-error Quantum Polytime), the class of functions computable in polynomial time by a quantum Turing machine with at most 1/3 probability of error, commonly accepted as the class of feasible problems for quantum computers. Our result takes advantage of a function algebra proposed by Yamakami characterizing FBQP.
Fichier principal
Vignette du fichier
27Silva.pdf (537.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03895106 , version 1 (12-12-2022)


  • HAL Id : hal-03895106 , version 1


Emmanuel Hainry, Romain Péchoux, Mário Silva. An imperative programming language characterizing FBQP. QPL 2022 - Quantum Physics and Logic, Jun 2022, Oxford, United Kingdom. . ⟨hal-03895106⟩
19 View
4 Download


Gmail Facebook Twitter LinkedIn More