2 papers
cs.LO2025
Quantum Programming in Polylogarithmic Time
Florent Ferrari, Emmanuel Hainry, Romain Péchoux +1
Polylogarithmic time delineates a relevant notion of feasibility on several classical computational models such as Boolean circuits or parallel random access machines. As far as th…
cs.LO2023
A feasible and unitary quantum programming language
Alejandro Díaz-Caro, Emmanuel Hainry, Romain Péchoux +1
We introduce a novel quantum programming language featuring higher-order programs and quantum controlflow which ensures that all qubit transformations are unitary. Our language boa…