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

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. We finally 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
paper_FBQP_revised.pdf (657.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : CC BY NC SA - Attribution - NonCommercial - ShareAlike

Dates and versions

hal-04190385 , version 1 (29-08-2023)

Licence

Attribution

Identifiers

Cite

Emmanuel Hainry, Romain Péchoux, Mário Silva. A programming language characterizing quantum polynomial time. Foundations of Software Science and Computation Structures - 26th International Conference, FoSSaCS 2023, Held as Part of the European Joint Conferences on Theory and Practice of Software, {ETAPS} 2023, Paris, France, April 22-27, 2023, Proceedings, Apr 2023, Paris, France. ⟨10.1007/978-3-031-30829-1\_8⟩. ⟨hal-04190385⟩
52 View
25 Download

Altmetric

Share

Gmail Facebook X LinkedIn More