A programming language characterizing quantum polynomial time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

A programming language characterizing quantum polynomial time

Abstract

We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of terminating programs with bounded width, that provides a first programming language-based characterization of the quantum complexity class FBQP. Finally, we present a tractable semantics-preserving algorithm compiling a PFOQ program to a quantum circuit of size polynomial in the number of input qubits.
Fichier principal
Vignette du fichier
FBQP_Implicit.pdf (622.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

Cite

Emmanuel Hainry, Romain Péchoux, Mário Silva. A programming language characterizing quantum polynomial time. 2022. ⟨hal-03895081⟩
16 View
14 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More