317 citations · 321 across the 11 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.LO2024
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…
cs.LO2024
Declassification Policy for Program Complexity Analysis
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion +1
In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complex…