Communication Dans Un Congrès Année : 2023

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 (723.03 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03895081 , version 2 (12-12-2022)
hal-03895081 , version 1 (29-08-2023)
hal-03895081 , version 3 (18-10-2025)

Licence

Identifiants

Citer

Emmanuel Hainry, Romain Péchoux, Mário Silva. A programming language characterizing quantum polynomial time. FOSSACS 2023 - 26th International Conference on Foundations of Software Science and Computational Structures, Orna Kupferman; Pawel Sobocinski, Apr 2023, Paris, France. pp.156-175, ⟨10.1007/978-3-031-30829-1_8⟩. ⟨hal-03895081v3⟩
529 Consultations
502 Téléchargements

Altmetric

Partager

  • More