7 papers
Quantum Term Rewrite Systems: Applications to Complexity Analysis
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux +1
Term Rewrite Systems (TRS) is a computational model offering a level of abstraction well-suited towards static analysis, e.g., termination or complexity analyses. In this paper, we…
Resource-Aware Quantum Programming with General Recursion and Quantum Control
Kostia Chardonnet, Emmanuel Hainry, Romain Péchoux +2
This paper introduces the hybrid quantum language with general recursion , driven towards resource-analysis. By design, does not require the specif…
Expectation-based Analysis of Higher-Order Quantum Programs
Martin Avanzini, Alejandro DÃaz-Caro, Emmanuel Hainry +1
The paper extends the expectation transformer based analysis of higher-order probabilistic programs to the quantum higher-order setting. The quantum language we are considering can…
A programming language characterizing quantum polynomial time
Emmanuel Hainry, Romain Péchoux, Mário Silva
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 term…
Branch Sequentialization in Quantum Polytime
Emmanuel Hainry, Romain Péchoux, Mário Alberto Machado da Silva
Quantum algorithms leverage the use of quantumly-controlled data in order to achieve computational advantage. This implies that the programs use constructs depending on quantum dat…
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…