315 citations · 315 across the 5 of their papers we have counts for
8 papers · 1 filter
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…
Higher-Order Programs with Indefinite Causal Orders: a Linear Approach to Coherent Control of Quantum Processes
Kathleen Barsse, Romain Péchoux, Simon Perdrix
Processes with indefinite causal orders (ICOs), such as the quantum switch, are higher-order quantum processes that superpose the order in which quantum operations are performed. S…
Quantum Control and General Recursion beyond the Unitary Case
Kathleen Barsse, Romain Péchoux, Simon Perdrix
Coherent control, aka quantum control, is a central concept in quantum computing that is attracting increasing attention from both the quantum foundations and quantum software comm…
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 combining quantum and classical control
Kinnari Dave, Louis Lemonnier, Romain Péchoux +1
The two main notions of control in quantum programming languages are often referred to as "quantum" control and "classical" control. With the latter, the control flow is based on c…