1 citations · 2 across the 9 of their papers we have counts for
5 papers · 1 filter
(Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography
Ugo Dal Lago, Giulia Giusti
In this paper, we show how a recently introduced -calculus for randomized computation, called , can accurately capture the notions of first- and second-order poly…
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
Andrea Colledan, Ugo Dal Lago
We introduce a type system for the Quipper language designed to derive upper bounds on the size of the circuits produced by the typed program. This size can be measured according t…
On Computational Indistinguishability and Logical Relations
Ugo Dal Lago, Zeinab Galal, Giulia Giusti
A -calculus is introduced in which all programs can be evaluated in probabilistic polynomial time and in which there is sufficient structure to represent sequential cryptographi…
Circuit Width Estimation via Effect Typing and Linear Dependency (Long Version)
Andrea Colledan, Ugo Dal Lago
Circuit description languages are a class of quantum programming languages in which programs are classical and produce a description of a quantum computation, in the form of a quan…
Multi types and reasonable space
Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni
Accattoli, Dal Lago, and Vanoni have recently proved that the space used by the Space KAM, a variant of the Krivine abstract machine, is a reasonable space cost model for the lambd…