A programming language characterizing quantum polynomial time - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

A programming language characterizing quantum polynomial time

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

Emmanuel Hainry, Romain Péchoux, Mário Silva. A programming language characterizing quantum polynomial time. 2022. ⟨hal-03895081⟩
34 Consultations
26 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More