2 papers
cs.PL2021
Splitting recursion schemes into reversible and classical interacting threads
Armando B. Matos, Luca Paolini, Luca Roversi
Given a simple recursive function, we show how to extract from it a reversible and an classical iterative part. Those parts can synchronously cooperate under a Producer/Consumer pa…
cs.LO2018
QPCF: higher order languages and quantum circuits
Luca Paolini, Mauro Piccolo, Margherita Zorzi
qPCF is a paradigmatic quantum programming language that ex- tends PCF with quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data that can be…